Browse
Publications
Preprints
About
About UCL Open: Env.
Aims and Scope
Editorial Board
Indexing
APCs
How to cite
Publishing policies
Editorial policy
Peer review policy
Equality, Diversity & Inclusion
About UCL Press
Contact us
For authors
Information for authors
How it works
Benefits of publishing with us
Submit
How to submit
Preparing your manuscript
Article types
Open Data
ORCID
APCs
Contributor agreement
For reviewers
Information for reviewers
Review process
How to peer review
Peer review policy
My ScienceOpen
Sign in
Register
Dashboard
Search
Browse
Publications
Preprints
About
About UCL Open: Env.
Aims and Scope
Editorial Board
Indexing
APCs
How to cite
Publishing policies
Editorial policy
Peer review policy
Equality, Diversity & Inclusion
About UCL Press
Contact us
For authors
Information for authors
How it works
Benefits of publishing with us
Submit
How to submit
Preparing your manuscript
Article types
Open Data
ORCID
APCs
Contributor agreement
For reviewers
Information for reviewers
Review process
How to peer review
Peer review policy
My ScienceOpen
Sign in
Register
Dashboard
Search
11
views
23
references
Top references
cited by
8
Cite as...
0 reviews
Review
0
comments
Comment
0
recommends
+1
Recommend
0
collections
Add to
0
shares
Share
Twitter
Sina Weibo
Facebook
Email
2,260
similar
All similar
Record
: found
Abstract
: not found
Book Chapter
: not found
Public Key Cryptography – PKC 2010
Simple and Efficient Public-Key Encryption from Computational Diffie-Hellman in the Standard Model
other
Author(s):
Kristiyan Haralambiev
,
Tibor Jager
,
Eike Kiltz
,
Victor Shoup
Publication date
(Print):
2010
Publisher:
Springer Berlin Heidelberg
Read this book at
Publisher
Further versions
open (via free pdf)
Powered by
Buy book
Review
Review book
Invite someone to review
Bookmark
Cite as...
There is no author summary for this book yet. Authors can add summaries to their books on ScienceOpen to make them more accessible to a non-specialist audience.
Related collections
Computational epistasis
Most cited references
23
Record
: found
Abstract
: not found
Conference Proceedings
: not found
Random oracles are practical
Mihir Bellare
,
Phillip Rogaway
(1993)
0
comments
Cited
163
times
– based on
0
reviews
Bookmark
Record
: found
Abstract
: not found
Book Chapter
: not found
Efficient Identity-Based Encryption Without Random Oracles
Brent Waters
(2005)
0
comments
Cited
152
times
– based on
0
reviews
Bookmark
Record
: found
Abstract
: not found
Book Chapter
: not found
Identity-Based Encryption from the Weil Pairing
Dan Boneh
,
Matt Franklin
(2001)
0
comments
Cited
133
times
– based on
0
reviews
Bookmark
All references
Author and book information
Book Chapter
Publication date (Print):
2010
Pages
: 1-18
DOI:
10.1007/978-3-642-13013-7_1
SO-VID:
3b9c8599-4a79-43ec-b949-13906cc90487
History
Data availability:
Comments
Comment on this book
Sign in to comment
Book chapters
pp. 1
Simple and Efficient Public-Key Encryption from Computational Diffie-Hellman in the Standard Model
pp. 19
Constant Size Ciphertexts in Threshold Attribute-Based Encryption
pp. 142
Secure Network Coding over the Integers
pp. 279
More Constructions of Lossy and Correlation-Secure Trapdoor Functions
pp. 332
Text Search Protocols with Simulation Based Security
pp. 499
Lattice Mixing and Vanishing Trapdoors: A Framework for Fully Secure Short Signatures and More
Similar content
2,260
Obstacles to the torsion-subgroup attack on the decision Diffie-Hellman Problem
Authors:
Neal Koblitz
,
Alfred J. Menezes
Timing attacks on implementations of Diffie-Hellman, RSA, DSS, and other systems
Authors:
Kocher
,
P.C. Kocher
“In the Midst of Diffi culty Lies Opportunity”: A Woman’s View
Authors:
See all similar
Cited by
8
Efficient Chosen-Ciphertext Security via Extractable Hash Proofs
Authors:
Hoeteck Wee
Simple and Efficient Public-Key Encryption from Computational Diffie-Hellman in the Standard Model
Authors:
Kristiyan Haralambiev
,
Tibor Jager
,
Eike Kiltz
…
Message Authentication, Revisited
Authors:
Yevgeniy Dodis
,
Eike Kiltz
,
Krzysztof Pietrzak
…
See all cited by