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
13
views
10
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
3,833
similar
All similar
Record
: found
Abstract
: not found
Book Chapter
: not found
Public Key Cryptography – PKC 2004
Short Exponent Diffie-Hellman Problems
other
Author(s):
Takeshi Koshiba
,
Kaoru Kurosawa
Publication date
(Print):
2004
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
Trace Elements and Electrolytes
Most cited references
10
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
Article
: not found
A public key cryptosystem and a signature scheme based on discrete logarithms
T. Elgamal
(1985)
0
comments
Cited
175
times
– based on
0
reviews
Review now
Bookmark
Record
: found
Abstract
: not found
Article
: not found
How to Generate Cryptographically Strong Sequences of Pseudorandom Bits
Manuel R Blum
,
Silvio Micali
(1984)
0
comments
Cited
136
times
– based on
0
reviews
Review now
Bookmark
All references
Author and book information
Book Chapter
Publication date (Print):
2004
Pages
: 173-186
DOI:
10.1007/978-3-540-24632-9_13
SO-VID:
8931f027-6438-404b-ba88-e94eb6149b36
History
Data availability:
Comments
Comment on this book
Sign in to comment
Book chapters
pp. 173
Short Exponent Diffie-Hellman Problems
pp. 145
New Security Results on Encrypted Key Exchange
pp. 248
From Digital Signature to ID-based Identification/Signature
pp. 262
Identity-Based Threshold Decryption
pp. 360
On the Security of Multiple Encryption or CCA-security+CCA-security=CCA-security?
Similar content
3,833
Secure Length-Saving ElGamal Encryption under the Computational Diffie-Hellman Assumption
Authors:
Joonsang Baek
,
Byoungcheon Lee
,
Kwangjo Kim
Group Key Agreement in Information Centric Networks with Tree Group Diffie-Hellman
Authors:
Pierre-Antoine Rault
,
Luigi Iannone
Oracle-Assisted Static Diffie-Hellman Is Easier Than Discrete Logarithms
Authors:
Antoine Joux
,
Reynald Lercier
,
David Naccache
…
See all similar
Cited by
2
Tightly-Secure Signatures from Lossy Identification Schemes
Authors:
Michel Abdalla
,
Pierre-Alain Fouque
,
Vadim Lyubashevsky
…
The Discrete-Logarithm Problem with Preprocessing
Authors:
Henry Corrigan-Gibbs
,
Dmitry Kogan
See all cited by