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
25
views
12
references
Top references
cited by
2
Cite as...
0 reviews
Review
0
comments
Comment
0
recommends
+1
Recommend
0
collections
Add to
0
shares
Share
Twitter
Sina Weibo
Facebook
Email
4,373
similar
All similar
Record
: found
Abstract
: not found
Book Chapter
: not found
Cryptography and Coding
Oracle-Assisted Static Diffie-Hellman Is Easier Than Discrete Logarithms
other
Author(s):
Antoine Joux
,
Reynald Lercier
,
David Naccache
,
Emmanuel Thomé
Publication date
(Print):
2009
Publisher:
Springer Berlin Heidelberg
Read this book at
Publisher
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
Open source discrete and agent-based modeling frameworks for biology
Most cited references
12
Record
: found
Abstract
: not found
Article
: not found
Solving sparse linear equations over finite fields
D Wiedemann
(1986)
0
comments
Cited
72
times
– based on
0
reviews
Review now
Bookmark
Record
: found
Abstract
: not found
Book Chapter
: not found
Undeniable Signatures
David Chaum
,
Hans van Antwerpen
(1990)
0
comments
Cited
48
times
– based on
0
reviews
Bookmark
Record
: found
Abstract
: not found
Book Chapter
: not found
A Public Key Cryptosystem and a Signature Scheme Based on Discrete Logarithms
Taher Elgamal
(1985)
0
comments
Cited
39
times
– based on
0
reviews
Bookmark
All references
Author and book information
Book Chapter
Publication date (Print):
2009
Pages
: 351-367
DOI:
10.1007/978-3-642-10868-6_21
SO-VID:
fa672bbc-ab1e-4bfa-947e-33ed94537f68
History
Data availability:
Comments
Comment on this book
Sign in to comment
Book chapters
pp. 351
Oracle-Assisted Static Diffie-Hellman Is Easier Than Discrete Logarithms
pp. 38
Codes as Modules over Skew Polynomial Rings
pp. 278
Attribute-Based Encryption Supporting Direct/Indirect Revocation Modes
Similar content
4,373
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
2
Recent progress on the elliptic curve discrete logarithm problem
Authors:
Steven D. Galbraith
,
Pierrick Gaudry
On the Static Diffie-Hellman Problem on Elliptic Curves over Extension Fields
Authors:
Robert C Granger
See all cited by