The DOI matches its Crossref record; 19 of the 19 references it cites were found in a registry or an index.
Protecting poorly chosen secrets from guessing attacks
Abstract
In a security system that allows people to choose their own passwords, people tend to choose passwords that can be easily guessed. This weakness exists in practically all widely used systems. Instead of forcing users to choose secrets that are likely to be difficult for them to remember, solutions that maintain user convenience and a high level of security at the same time are proposed. The basic idea is to ensure that data available to the attacker is sufficiently unpredictable to prevent an offline verification of whether a guess is successful or not. Common forms of guessing attacks are examined, examples of cryptographic protocols that are immune to such attacks are developed, and a systematic way to examine protocols to detect vulnerabilities to such attacks is suggested.>
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
The Design and Analysis of Computer Algorithms
Aho, A. V., & Hopcroft, J. E. (1974) · CERN Document Server (European Organization for Nuclear Research) · Cited by 9,403
Using encryption for authentication in large networks of computers
Needham, R. M., & Schroeder, M. D. (1978) · Communications of the ACM · doi:10.1145/359657.359659 · Cited by 2,362
Self-citationThe protection of information in computer systems
Saltzer, J. H., & Schroeder, M. D. (1975) · Proceedings of the IEEE · doi:10.1109/proc.1975.9939 · Cited by 2,126
Self-citationProtection of information in computer systems
Saltier, J. H., & Schroeder, M. P. (1975) · IEEE CSIT Newsletter · doi:10.1109/csit.1975.6498831 · Cited by 1,419
Encrypted key exchange: password-based protocols secure against dictionary attacks
Bellovin, S. M., & Merritt, M. (2003) · Proceedings 1992 IEEE Computer Society Symposium on Research in Security and Privacy · doi:10.1109/risp.1992.213269 · Cited by 1,353
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
Foiling the cracker: A survey of, and improvements to, password security
Klein, D. V. (1992) · Cited by 349
Efficient and timely mutual authentication
Otway, D., & Rees, O. (1987) · ACM SIGOPS Operating Systems Review · doi:10.1145/24592.24594 · Cited by 335
Security Mechanisms in High-Level Network Protocols
Voydock, V. L., & Kent, S. T. (1983) · ACM Computing Surveys · doi:10.1145/356909.356913 · Cited by 280
Data Encryption Standard: past and future
Smid, M. E., & Branstad, D. K. (1988) · Proceedings of the IEEE · doi:10.1109/5.4441 · Cited by 230
Cryptography: A new dimension in computer data security
Bookstein, A. (1985) · Information Processing & Management · doi:10.1016/0306-4573(85)90072-x · Cited by 213
UNIX Password Security - Ten Years Later
Feldmeier, D. C., & Karn, P. R. (2007) · Lecture Notes in Computer Science · doi:10.1007/0-387-34805-0_6 · Cited by 172
A security risk of depending on synchronized clocks
Gong, L. (1992) · ACM SIGOPS Operating Systems Review · doi:10.1145/130704.130709 · Cited by 157
Self-citationReducing 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
Self-citationOn message integrity in cryptographic protocols
Stubblebine, S. G., & Gligor, V. D. (2003) · IEEE Computer Society Symposium on Research in Security and Privacy · doi:10.1109/risp.1992.213268 · Cited by 84
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
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
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
Graphical passwords: Learning from the first twelve years
Biddle, R., Chiasson, S., & Van Oorschot, P. C. (2012) · ACM Computing Surveys · doi:10.1145/2333112.2333114 · Cited by 563
Strong password-only authenticated key exchange
Jablon, D. P. (1996) · ACM SIGCOMM Computer Communication Review · doi:10.1145/242896.242897 · Cited by 532
Metadata
- Authors
- Gong, L., Lomas, M. A., Needham, R. M., & Saltzer, J. H.
- Venue
- IEEE Journal on Selected Areas in Communications
- Published
- 1993-06
- Volume
- 11
- Issue
- 5
- Pages
- 648-656
- ISSN
- 0733-8716 (ISSN-L)
- OpenAlex
- W2167006959
- Cited by
- 365
- References
- 19
- FWCI
- 22.54
- Type
- journal article
- 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.