The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
A user authentication scheme not requiring secrecy in the computer
Open accessAbstract
In many computer operating systems a user authenticates himself by entering a secret password known solely to himself and the system. The system compares this password with one recorded in a Password Table which is available to only the authentication program. The integrity of the system depends on keeping the table secret. In this paper a password scheme is presented which does not require secrecy in the computer. All aspects of the system, including all relevant code and data bases, may be known by anyone attempting to intrude. The scheme is based on using a function H which the would-be intruder is unable to invert. This function is applied to the user's password and the result compared to a table entry, a match being interpreted as authentication of the user. The intruder may know all about H and have access to the table, but he can penetrate the system only if he can invert H to determine an input that produces a given output. This paper discusses issues surrounding selection of a suitable H . Two different plausible arguments are given that penetration would be exceedingly difficult, and it is then argued that more rigorous results are unlikely. Finally, some human engineering problems relating to the scheme are discussed.
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
Communication Theory of Secrecy Systems
Shannon, C. E. (1949) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1949.tb00928.x · Cited by 9,440 · cited 2×
“It is pointed out in [6] tha t mixing functions are very desirable cryptologically.”
Background
Cited by
New directions in cryptography
Diffie, W., & Hellman, M. (1976) · IEEE Transactions on Information Theory · doi:10.1109/tit.1976.1055638 · Cited by 14,713
Handbook of applied cryptography
(1997) · Choice Reviews Online · doi:10.5860/choice.34-4512 · Cited by 10,357
Password authentication with insecure communication
Lamport, L. (1981) · Communications of the ACM · doi:10.1145/358790.358797 · Cited by 2,789
The 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
“33. For example, Purdy [35] suggests using the password as the parameter in a high-order polynomial calculated in modulo arithmetic, and Evans, Kantrowitz, and Weiss [ 36 ] suggest a more complex scheme based on multiple functions.”
MethodMerkle, R. C. (2007) · Lecture Notes in Computer Science · doi:10.1007/0-387-34805-0_21 · Cited by 1,691
Protection 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
Protocols for Public Key Cryptosystems
Merkle, R. C. (1980) · 1980 IEEE Symposium on Security and Privacy · doi:10.1109/sp.1980.10006 · Cited by 1,418
“For a more complete discussion of one way functions, see [2,9,13,19].”
BackgroundPohlig, S., & Hellman, M. (1978) · IEEE Transactions on Information Theory · doi:10.1109/tit.1978.1055817 · Cited by 1,199
Hiding information and signatures in trapdoor knapsacks
Merkle, R., & Hellman, M. (1978) · IEEE Transactions on Information Theory · doi:10.1109/tit.1978.1055927 · Cited by 827
New Directions in Cryptography
Diffie, W., & Hellman, M. E. (2022) · Democratizing Cryptography · doi:10.1145/3549993.3550007 · Cited by 668
The MD4 Message Digest Algorithm
Rivest, R. L. (2007) · Lecture Notes in Computer Science · doi:10.1007/3-540-38424-3_22 · Cited by 486
Privacy and authentication: An introduction to cryptography
Diffie, W., & Hellman, M. E. (1979) · Proceedings of the IEEE · doi:10.1109/proc.1979.11256 · Cited by 470
An Efficient and Practical Solution to Remote Authentication: Smart Card
Chien, H.-Y., Jan, J.-K., & Tseng, Y.-M. (2002) · Computers & Security · doi:10.1016/s0167-4048(02)00415-7 · Cited by 455
A remote password authentication scheme for multiserver architecture using neural networks
Li, L.-H., Lin, L.-C., & Hwang, M.-S. (2001) · IEEE Transactions on Neural Networks · doi:10.1109/72.963786 · Cited by 328
Remote password authentication with smart cards
Chang, C.-C., & Wu, T.-C. (1991) · IEE Proceedings E Computers and Digital Techniques · doi:10.1049/ip-e.1991.0022 · Cited by 321
Experiences with the Amoeba Distributed Operating System
Tanenbaum, A. S., Renesse, R. V., Staveren, H. V., Sharp, G. J., Mullender, S. J., Jansen, J., & Rossum, G. V. (2001) · Classic Operating Systems · doi:10.1007/978-1-4757-3510-9_25 · Cited by 311
Password authentication schemes with smart cards
Yang, W.-H., & Shieh, S.-P. (1999) · Computers & Security · doi:10.1016/s0167-4048(99)80136-9 · Cited by 305
Multiuser cryptographic techniques
Diffie, W., & Hellman, M. E. (1976) · Proceedings of the June 7-10, 1976, national computer conference and exposition on - AFIPS '76 · doi:10.1145/1499799.1499815 · Cited by 270
A password authentication scheme over insecure networks
Liao, I.-E., Lee, C.-C., & Hwang, M.-S. (2006) · Journal of Computer and System Sciences · doi:10.1016/j.jcss.2005.10.001 · Cited by 267
Honeywords: making password-cracking detectable
Juels, A., & Rivest, R. L. (2013) · Proceedings of the 2013 ACM SIGSAC conference on Computer & communications security - CCS '13 · doi:10.1145/2508859.2516671 · Cited by 258
Metadata
- Authors
- Evans, A., Kantrowitz, W., & Weiss, E.
- Venue
- Communications of the ACM
- Published
- 1974-08
- Volume
- 17
- Issue
- 8
- Pages
- 437-442
- ISSN
- 0001-0782 (ISSN-L)
- 1557-7317
- OpenAlex
- W2065410314
- Cited by
- 174
- References
- 1
- FWCI
- 31.56
- Type
- journal article
- Language
- en
- Open access
- bronze
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.