The DOI matches its Crossref record; 17 of the 17 references it cites were found in a registry or an index.
Encrypted key exchange: password-based protocols secure against dictionary attacks
Open accessAbstract
Classic cryptographic protocols based on user-chosen keys allow an attacker to mount password-guessing attacks. A combination of asymmetric (public-key) and symmetric (secret-key) cryptography that allow two parties sharing a common password to exchange confidential and authenticated information over an insecure network is introduced. In particular, a protocol relying on the counter-intuitive motion of using a secret key to encrypt a public key is presented. Such protocols are secure against active attacks, and have the property that the password is protected against offline dictionary attacks.>
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 method for obtaining digital signatures and public-key cryptosystems
Rivest, R. L., Shamir, A., & Adleman, L. (1978) · Communications of the ACM · doi:10.1145/359340.359342 · Cited by 13,462
A method for obtaining digital signatures and public-key cryptosystems
Rivest, R. L., Shamir, A., & Adleman, L. (1983) · Communications of the ACM · doi:10.1145/357980.358017 · Cited by 13,012
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 · cited 9×
“Encryption with ElGamal has some interesting properties; these make its mode of employment rather diierent.”
MethodInfluentialCryptography and data security
Denning, D. E. (1982) · Calhoun: The Naval Postgraduate School Institutional Archive (Naval Postgraduate School) · Cited by 1,904
Pohlig, S., & Hellman, M. (1978) · IEEE Transactions on Information Theory · doi:10.1109/tit.1978.1055817 · Cited by 1,199
Kerberos: An Authentication Service for Open Network Systems
Steiner, J. G., Athena, Neuman, C., & Schiller, J. I. (1988) · Cited by 1,014
Password security: a case history
Morris, R., & Thompson, K. (1979) · Communications of the ACM · doi:10.1145/359168.359172 · Cited by 926
Discrete logarithms in finite fields and their cryptographic significance
Odlyzko, A. M. (2007) · Lecture Notes in Computer Science · doi:10.1007/3-540-39757-4_20 · Cited by 367
Foiling the cracker: A survey of, and improvements to, password security
Klein, D. V. (1992) · Cited by 349
Security for computer networks
Wood, C. C. (1985) · Computers & Security · doi:10.1016/0167-4048(85)90039-2 · Cited by 214
Rivest, R. L., & Adi Shamir, Z. (1984) · Communications of the ACM · doi:10.1145/358027.358053 · Cited by 131
SPX: global authentication using public key certificates
Tardo, J. J., & Alagappan, K. (2002) · IEEE Computer Society Symposium on Research in Security and Privacy · doi:10.1109/risp.1991.130791 · Cited by 126
Reducing risks from poorly chosen keys
Lomas, T., Gong, L., Saltzer, J. H., & Needhamn, R. (1989) · ACM SIGOPS Symposium on Operating Systems Principles (SOSP) · doi:10.1145/74850.74853 · Cited by 118
TheUNIXSystem: UNIXOperating System Security
Grampp, F. T., & Morris, R. H. (1984) · AT&T Bell Laboratories Technical Journal · doi:10.1002/j.1538-7305.1984.tb00058.x · Cited by 97
Computation of discrete logarithms in prime fields
LaMacchia, B. A., & Odlyzko, A. M. (1991) · Designs Codes and Cryptography · doi:10.1007/bf00123958 · Cited by 93
DeMillo, & Merritt (1983) · Computer · doi:10.1109/mc.1983.1654298 · Cited by 44
Cited by
Authenticated Key Exchange Secure against Dictionary Attacks
Bellare, M., Pointcheval, D., & Rogaway, P. (2000) · Lecture Notes in Computer Science · doi:10.1007/3-540-45539-6_11 · Cited by 1,503
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
Provably Secure Password-Authenticated Key Exchange Using Diffie-Hellman
Boyko, V., MacKenzie, P., & Patel, S. (2000) · Lecture Notes in Computer Science · doi:10.1007/3-540-45539-6_12 · Cited by 729
A Survey of Man in the Middle Attacks
Conti, M., Dragoni, N., & Lesyk, V. (2016) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2016.2548426 · Cited by 724
Comparing passwords, tokens, and biometrics for user authentication
O'Gorman, L. (2003) · Proceedings of the IEEE · doi:10.1109/jproc.2003.819611 · Cited by 659
Metadata
- Authors
- Bellovin, S. M., & Merritt, M.
- Venue
- Proceedings 1992 IEEE Computer Society Symposium on Research in Security and Privacy
- Publisher
- IEEE Comput. Soc. Press
- Published
- 2003-01-02
- Pages
- 72-84
- OpenAlex
- W2157604883
- Cited by
- 1,353
- References
- 17
- FWCI
- 47.26
- Type
- conference paper
- Language
- en
- Open access
- green
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.