The DOI matches its Crossref record; 20 of the 20 references it cites were found in a registry or an index.
Security Analysis of the Strong Diffie-Hellman Problem
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Handbook of applied cryptography
(1997) · Choice Reviews Online · doi:10.5860/choice.34-4512 · Cited by 10,357
A public key cryptosystem and a signature scheme based on discrete logarithms
Elgamal, T. (1985) · IEEE Transactions on Information Theory · doi:10.1109/tit.1985.1057074 · Cited by 8,059
Handbook of Applied Cryptography
Menezes, A. J., van Oorschot, P. C., & Vanstone, S. A. (2018) · CRC Press eBooks · doi:10.1201/9781439821916 · Cited by 2,896
Boneh, D., Boyen, X., & Shacham, H. (2004) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-28628-8_3 · Cited by 2,089
Efficient Selective-ID Secure Identity-Based Encryption Without Random Oracles
Boneh, D., & Boyen, X. (2004) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-24676-3_14 · Cited by 1,766
Short Signatures from the Weil Pairing
Boneh, D., Lynn, B., & Shacham, H. (2004) · Journal of Cryptology · doi:10.1007/s00145-004-0314-9 · Cited by 1,467
Short Signatures Without Random Oracles
Boneh, D., & Boyen, X. (2004) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-24676-3_4 · Cited by 1,447
Hierarchical Identity Based Encryption with Constant Size Ciphertext
Boneh, D., Boyen, X., & Goh, E.-J. (2005) · Lecture Notes in Computer Science · doi:10.1007/11426639_26 · Cited by 1,334
Lower Bounds for Discrete Logarithms and Related Problems
Shoup, V. (1997) · Lecture Notes in Computer Science · doi:10.1007/3-540-69053-0_18 · Cited by 1,229
Collusion Resistant Broadcast Encryption with Short Ciphertexts and Private Keys
Boneh, D., Gentry, C., & Waters, B. (2005) · Lecture Notes in Computer Science · doi:10.1007/11535218_16 · Cited by 1,047
Boldyreva, A. (2003) · Lecture Notes in Computer Science · doi:10.1007/3-540-36288-6_3 · Cited by 1,006
A secure and efficient conference key distribution system: Extended abstract
Burmester, M., & Desmedt, Y. (1995) · Lecture Notes in Computer Science · doi:10.1007/bfb0053443 · Cited by 844
Monte Carlo methods for index computation (𝑚𝑜𝑑𝑝)
Pollard, J. M. (1978) · Mathematics of Computation · doi:10.1090/s0025-5718-1978-0491431-9 · Cited by 825
Polachek, H. (1960) · Mathematics of Computation · doi:10.1090/s0025-5718-60-99239-5 · Cited by 759
A Verifiable Random Function with Short Proofs and Keys
Dodis, Y., & Yampolskiy, A. (2005) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-30580-4_28 · Cited by 428
Pairing-Based Cryptography at High Security Levels
Koblitz, N., & Menezes, A. (2005) · Lecture Notes in Computer Science · doi:10.1007/11586821_2 · Cited by 317
Mitsunari, S., Sakai, R., & Kasahara, M. (2002) · IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences · Cited by 279
Speeding up Pollard's rho method for computing discrete logarithms
Teske, E. (1998) · Lecture notes in computer science · doi:10.1007/bfb0054891 · Cited by 137
The Relationship Between Breaking the Diffie--Hellman Protocol and Computing Discrete Logarithms
Maurer, U. M., & Wolf, S. (1999) · SIAM Journal on Computing · doi:10.1137/s0097539796302749 · Cited by 136
Diffie-Hellman is as Strong as Discrete Log for Certain Primes
den Boer, B. (1990) · Lecture notes in computer science · doi:10.1007/0-387-34799-2_38 · Cited by 88
Cited by
Short Signatures Without Random Oracles and the SDH Assumption in Bilinear Groups
Boneh, D., & Boyen, X. (2008) · Journal of Cryptology · doi:10.1007/s00145-007-9005-7 · Cited by 605
Verifiable Delegation of Computation over Large Datasets
Benabbas, S., Gennaro, R., & Vahlis, Y. (2011) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-22792-9_7 · Cited by 379
Expressive Key-Policy Attribute-Based Encryption with Constant-Size Ciphertexts
Attrapadung, N., Libert, B., & de Panafieu, E. (2011) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-19379-8_6 · Cited by 377
The Algebraic Group Model and its Applications
Fuchsbauer, G., Kiltz, E., & Loss, J. (2018) · Lecture Notes in Computer Science · doi:10.1007/978-3-319-96881-0_2 · Cited by 310
Efficient Protocols for Set Membership and Range Proofs
Camenisch, J., Chaabouni, R., & shelat, A. (2008) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-89255-7_15 · Cited by 284
Metadata
- Authors
- Cheon, J. H.
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 2006
- Pages
- 1-11
- ISSN
- 0302-9743 (ISSN-L)
- 1611-3349
- OpenAlex
- W1523567567
- Cited by
- 274
- References
- 20
- FWCI
- 14.89
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.