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
54
views
24
references
Top references
cited by
20
Cite as...
0 reviews
Review
0
comments
Comment
0
recommends
+1
Recommend
0
collections
Add to
0
shares
Share
Twitter
Sina Weibo
Facebook
Email
3,916
similar
All similar
Record
: found
Abstract
: not found
Book Chapter
: not found
Advances in Cryptology – CRYPTO 2013
An Algebraic Framework for Diffie-Hellman Assumptions
other
Author(s):
Alex Escala
,
Gottfried Herold
,
Eike Kiltz
,
Carla Ràfols
,
Jorge Villar
Publication date
(Print):
2013
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
Numerical Algebra, Matrix Theory, Differential-Algebraic Equations, and Control Theory
Most cited references
24
Record
: found
Abstract
: not found
Book Chapter
: not found
A practical public key cryptosystem provably secure against adaptive chosen ciphertext attack
Ronald Cramer
,
Victor Shoup
(1998)
0
comments
Cited
177
times
– based on
0
reviews
Bookmark
Record
: found
Abstract
: not found
Book Chapter
: not found
Hierarchical Identity Based Encryption with Constant Size Ciphertext
Dan Boneh
,
Xavier Boyen
,
Eu-Jin Goh
(2005)
0
comments
Cited
109
times
– based on
0
reviews
Bookmark
Record
: found
Abstract
: not found
Conference Proceedings
: not found
Public-key cryptosystems provably secure against chosen ciphertext attacks
M. Yung
,
M Naor
(1990)
0
comments
Cited
103
times
– based on
0
reviews
Bookmark
All references
Author and book information
Book Chapter
Publication date (Print):
2013
Pages
: 129-147
DOI:
10.1007/978-3-642-40084-1_8
SO-VID:
6de24ece-2a64-45b3-9089-2977f817102b
History
Data availability:
Comments
Comment on this book
Sign in to comment
Book chapters
pp. 1
Fast Cut-and-Choose Based Protocols for Malicious and Covert Adversaries
pp. 18
Efficient Secure Two-Party Computation Using Symmetric Cut-and-Choose
pp. 36
Garbled Circuits Checking Garbled Circuits: More Efficient and Secure Two-Party Computation
pp. 54
Improved OT Extension for Transferring Short Secrets
pp. 71
Time-Optimal Interactive Proofs for Circuit Evaluation
pp. 129
An Algebraic Framework for Diffie-Hellman Assumptions
pp. 239
Non-malleable Codes from Two-Source Extractors
pp. 289
Linearly Homomorphic Structure-Preserving Signatures and Their Applications
pp. 344
Quantum One-Time Programs
pp. 398
Instantiating Random Oracles via UCEs
pp. 416
Obfuscating Conjunctions
pp. 435
Fully, (Almost) Tightly Secure IBE and Dual System Groups
pp. 461
Function-Private Identity-Based Encryption: Hiding the Function in Functional Encryption
pp. 479
Attribute-Based Encryption for Circuits from Multilinear Maps
pp. 500
Functional Encryption: New Perspectives and Lower Bounds
pp. 519
On the Achievability of Simulation-Based Security for Functional Encryption
pp. 536
How to Run Turing Machines on Encrypted Data
Similar content
3,916
An identity-based signature from gap Diffie-Hellman groups
Authors:
J.-C. Cha
,
JH Cheon
Integrating Diffie–Hellman Key Exchange into the Digital Signature Algorithm (DSA)
Authors:
L. Harn
,
M Mehta
,
W.-J. Hsin
Obstacles to the torsion-subgroup attack on the decision Diffie-Hellman Problem
Authors:
Neal Koblitz
,
Alfred J. Menezes
See all similar
Cited by
20
An Algebraic Framework for Diffie-Hellman Assumptions
Authors:
Alex Escala
,
Gottfried Herold
,
Eike Kiltz
…
(Hierarchical) Identity-Based Encryption from Affine Message Authentication
Authors:
Olivier Blazy
,
Eike Kiltz
,
Jiaxin Pan
Fully Secure Functional Encryption for Inner Products, from Standard Assumptions
Authors:
Shweta Agrawal
,
Benoit Libert
,
Damien Stehle
See all cited by