The DOI matches its Crossref record; 28 of the 28 references it cites were found in a registry or an index.
The Oracle Diffie-Hellman Assumptions and an Analysis of DHIES
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
New directions in cryptography
Diffie, W., & Hellman, M. (1976) · IEEE Transactions on Information Theory · doi:10.1109/tit.1976.1055638 · Cited by 14,713
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
Goldwasser, S., & Micali, S. (1984) · Journal of Computer and System Sciences · doi:10.1016/0022-0000(84)90070-9 · Cited by 2,603
Keying Hash Functions for Message Authentication
Bellare, M., Canetti, R., & Krawczyk, H. (1996) · Lecture Notes in Computer Science · doi:10.1007/3-540-68697-5_1 · Cited by 1,580
Self-citationA practical public key cryptosystem provably secure against adaptive chosen ciphertext attack
Cramer, R., & Shoup, V. (1998) · Lecture Notes in Computer Science · doi:10.1007/bfb0055717 · Cited by 1,437
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
Secure Integration of Asymmetric and Symmetric Encryption Schemes
Fujisaki, E., & Okamoto, T. (1999) · Lecture Notes in Computer Science · doi:10.1007/3-540-48405-1_34 · Cited by 1,132
Public-key cryptosystems provably secure against chosen ciphertext attacks
Naor, M., & Yung, M. (1990) · Proceedings of the twenty-second annual ACM symposium on Theory of computing - STOC '90 · doi:10.1145/100216.100273 · Cited by 1,088
Non-Interactive Zero-Knowledge Proof of Knowledge and Chosen Ciphertext Attack
Rackoff, C., & Simon, D. R. (2007) · Lecture Notes in Computer Science · doi:10.1007/3-540-46766-1_35 · Cited by 1,039
Dolev, D., Dwork, C., & Naor, M. (1991) · Proceedings of the twenty-third annual ACM symposium on Theory of computing - STOC '91 · doi:10.1145/103418.103474 · Cited by 990
The Exact Security of Digital Signatures-How to Sign with RSA and Rabin
Bellare, M., & Rogaway, P. (1996) · Lecture Notes in Computer Science · doi:10.1007/3-540-68339-9_34 · Cited by 945
Self-citationA concrete security treatment of symmetric encryption
Bellare, M., Desai, A., Jokipii, E., & Rogaway, P. (2002) · Proceedings 38th Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1997.646128 · Cited by 931
Self-citationThe Decision Diffie-Hellman problem
Boneh, D. (1998) · Lecture Notes in Computer Science · doi:10.1007/bfb0054851 · Cited by 895
Relations among notions of security for public-key encryption schemes
Bellare, M., Desai, A., Pointcheval, D., & Rogaway, P. (1998) · Lecture Notes in Computer Science · doi:10.1007/bfb0055718 · Cited by 810
Self-citation(1996) · Lecture Notes in Computer Science · doi:10.1007/3-540-68697-5 · Cited by 783
Information and Communications Security
Qing, S., Wang, G., & Imai, H. (2007) · Lecture notes in computer science · doi:10.1007/978-3-540-77048-0 · Cited by 770
(1994) · Lecture Notes in Computer Science · doi:10.1007/3-540-48658-5 · Cited by 681
(2015) · Lecture Notes in Computer Science · doi:10.1007/978-3-662-48000-7 · Cited by 661
(2020) · Lecture Notes in Computer Science · doi:10.1007/978-3-030-56880-1 · Cited by 628
The Security of Cipher Block Chaining
Bellare, M., Kilian, J., & Rogaway, P. (2007) · Lecture Notes in Computer Science · doi:10.1007/3-540-48658-5_32 · Cited by 394
Self-citationOptimal Asymmetric Encryption-How to Encrypt with RSA
Bellare, M. (1995) · Cited by 382
Self-citationNumber-theoretic constructions of efficient pseudo-random functions
Naor, M., & Reingold, O. (2002) · Proceedings 38th Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1997.646134 · Cited by 353
Hardness of Computing the Most Significant Bits of Secret Keys in Diffie-Hellman and Related Schemes
Boneh, D., & Venkatesan, R. (1996) · Lecture Notes in Computer Science · doi:10.1007/3-540-68697-5_11 · Cited by 266
On the existence of 3-round zero-knowledge protocols
Hada, S., & Tanaka, T. (1998) · Lecture Notes in Computer Science · doi:10.1007/bfb0055744 · Cited by 175
The Notion of Security for Probabilistic Cryptosystems
Micali, S., Rackoff, C., & Sloan, B. (1988) · SIAM Journal on Computing · doi:10.1137/0217025 · Cited by 161
A uniform-complexity treatment of encryption and zero-knowledge
Goldreich, O. (1993) · Journal of Cryptology · doi:10.1007/bf02620230 · Cited by 132
Immunizing public key cryptosystems against chosen ciphertext attacks
Zheng, Y., & Seberry, J. (1993) · IEEE Journal on Selected Areas in Communications · doi:10.1109/49.223871 · Cited by 58
Another Method for Attaining Security Against Adaptively Chosen Ciphertext Attacks
Lim, C. H., & Lee, P. J. (2007) · Springer eBooks · doi:10.1007/3-540-48329-2_36 · Cited by 43
Cited by
Practical Secure Aggregation for Privacy-Preserving Machine Learning
Bonawitz, K., Ivanov, V., Kreuter, B., Marcedone, A., McMahan, H. B., Patel, S., Ramage, D., Segal, A., & Seth, K. (2017) · Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security · doi:10.1145/3133956.3133982 · Cited by 3,956
Guide to Elliptic Curve Cryptography
(2004) · Springer Professional Computing · doi:10.1007/b97644 · Cited by 3,054
Cramer, R., & Shoup, V. (2003) · SIAM Journal on Computing · doi:10.1137/s0097539702403773 · Cited by 978
Password-Based Authenticated Key Exchange in the Three-Party Setting
Abdalla, M., Fouque, P.-A., & Pointcheval, D. (2005) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-30580-4_6 · Cited by 833
Self-citationHMQV: A High-Performance Secure Diffie-Hellman Protocol: (Extended Abstract)
Krawczyk, H. (2005) · Lecture Notes in Computer Science · doi:10.1007/11535218_33 · Cited by 730
Metadata
- Authors
- Abdalla, M., Bellare, M., & Rogaway, P.
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 2001
- Pages
- 143-158
- ISSN
- 0302-9743 (ISSN-L)
- OpenAlex
- W2149093588
- Cited by
- 445
- References
- 28
- FWCI
- 6.26
- 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.