The DOI matches its Crossref record; 6 of the 6 references it cites were found in a registry or an index.
Timestamps in key distribution protocols
Open accessAbstract
The distribution of keys in a computer network using single key or public key encryption is discussed. We consider the possibility that communication keys may be compromised, and show that key distribution protocols with timestamps prevent replays of compromised keys. The timestamps have the additional benefit of replacing a two-step handshake.
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
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
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 · cited 2×
“Public key distribution protocols can also be used to distribute communication keys for single-key data encryption [2, 5 ]. The above protocol becomes”
BackgroundEncryption and Secure Computer Networks
Popek, G. J., & Kline, C. S. (1979) · ACM Computing Surveys · doi:10.1145/356789.356794 · Cited by 120
Generation, distribution, and installation of cryptographic keys
Matyas, S. M., & Meyer, C. H. (1978) · IBM Systems Journal · doi:10.1147/sj.172.0126 · Cited by 57
Secure personal computing in an insecure network
Denning, D. E. (1979) · Communications of the ACM · doi:10.1145/359138.359143 · Cited by 24
Self-citation
Cited by
Handbook of applied cryptography
(1997) · Choice Reviews Online · doi:10.5860/choice.34-4512 · Cited by 10,357
Burrows, M., Abadi, M., & Needham, R. (1990) · ACM Transactions on Computer Systems · doi:10.1145/77648.77649 · Cited by 2,523
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
Kerberos: an authentication service for computer networks
Neuman, B. C., & Ts'o, T. (1994) · IEEE Communications Magazine · doi:10.1109/35.312841 · Cited by 1,337
Authentication and authenticated key exchanges
Diffie, W., Van Oorschot, P. C., & Wiener, M. J. (1992) · Designs, Codes and Cryptography · doi:10.1007/bf00124891 · Cited by 1,154
The Kerberos Network Authentication Service (V5)
Neuman, C., Yu, T., Hartman, S., & Raeburn, K. (2005) · doi:10.17487/rfc4120 · Cited by 1,052
An efficient cryptographic protocol verifier based on prolog rules
Blanchet, B. (2005) · Proceedings. 14th IEEE Computer Security Foundations Workshop, 2001. · doi:10.1109/csfw.2001.930138 · Cited by 967
Breaking and fixing the Needham-Schroeder Public-Key Protocol using FDR
Lowe, G. (1996) · Lecture Notes in Computer Science · doi:10.1007/3-540-61042-1_43 · Cited by 872
An attack on the Needham-Schroeder public-key authentication protocol
Lowe, G. (1995) · Information Processing Letters · doi:10.1016/0020-0190(95)00144-2 · Cited by 647
Burrows, M., Abadi, M., & Needham, R. (1989) · Proceedings of the twelfth ACM symposium on Operating systems principles · doi:10.1145/74850.74852 · Cited by 641
Burrows, M., Abadi, M., & Needham, R. M. (1989) · Proceedings of the Royal Society of London. A. Mathematical and Physical Sciences · doi:10.1098/rspa.1989.0125 · Cited by 639
A hierarchy of authentication specifications
Lowe, G. (2002) · Proceedings 10th Computer Security Foundations Workshop · doi:10.1109/csfw.1997.596782 · Cited by 630
Provably secure session key distribution: the three party case
Bellare, M., & Rogaway, P. (1995) · Proceedings of the twenty-seventh annual ACM symposium on Theory of computing - STOC '95 · doi:10.1145/225058.225084 · Cited by 593
Prudent engineering practice for cryptographic protocols
Abadi, M., & Needham, R. (1996) · IEEE Transactions on Software Engineering · doi:10.1109/32.481513 · Cited by 574
Security problems in the TCP/IP protocol suite
Bellovin, S. M. (1989) · ACM SIGCOMM Computer Communication Review · doi:10.1145/378444.378449 · Cited by 550
Authentication in distributed systems: a bibliography
Liebl, A. (1993) · ACM SIGOPS Operating Systems Review · doi:10.1145/163640.163643 · Cited by 534
The Kerberos Network Authentication Service (V5)
Kohl, J., & Neuman, C. (1993) · doi:10.17487/rfc1510 · Cited by 514
The NRL Protocol Analyzer: An Overview
Meadows, C. (1996) · The Journal of Logic Programming · doi:10.1016/0743-1066(95)00095-x · Cited by 459
Strand spaces: why is a security protocol correct?
Fabrega, F. J. T., Herzog, J. C., & Guttman, J. D. (2002) · Proceedings. 1998 IEEE Symposium on Security and Privacy (Cat. No.98CB36186) · doi:10.1109/secpri.1998.674832 · Cited by 393
Efficient and timely mutual authentication
Otway, D., & Rees, O. (1987) · ACM SIGOPS Operating Systems Review · doi:10.1145/24592.24594 · Cited by 335
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
Modeling and Verifying Security Protocols with the Applied Pi Calculus and ProVerif
Blanchet, B. (2016) · Foundations and Trends® in Privacy and Security · doi:10.1561/3300000004 · Cited by 321
A Survey of SIP Authentication and Key Agreement Schemes
Kilinc, H. H., & Yanik, T. (2014) · IEEE Communications Surveys & Tutorials · doi:10.1109/surv.2013.091513.00050 · Cited by 312
Casper: a compiler for the analysis of security protocols
Lowe, G. (2002) · Proceedings 10th Computer Security Foundations Workshop · doi:10.1109/csfw.1997.596779 · Cited by 305
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
A semantic model for authentication protocols
Woo, T. Y. C., & Lam, S. S. (2002) · Proceedings 1993 IEEE Computer Society Symposium on Research in Security and Privacy · doi:10.1109/risp.1993.287633 · Cited by 300
Fault-Tolerant and Scalable Key Management for Smart Grid
Wu, D., & Zhou, C. (2011) · IEEE Transactions on Smart Grid · doi:10.1109/tsg.2011.2120634 · Cited by 279
The Modelling and Analysis of Security Protocols: the CSP Approach
Ryan, P. Y. A., Schneider, S. A., Goldsmith, M., Lowe, G., & Roscoe, A. (2001) · doi:10.25405/ncl.34123404 · Cited by 269
Refinement and extension of encrypted key exchange
Steiner, M., Tsudik, G., & Waidner, M. (1995) · ACM SIGOPS Operating Systems Review · doi:10.1145/206826.206834 · Cited by 253
Blockchain based approach to enhance big data authentication in distributed environment
Abdullah, N., Hakansson, A., & Moradian, E. (2017) · 2017 Ninth International Conference on Ubiquitous and Future Networks (ICUFN) · doi:10.1109/icufn.2017.7993927 · Cited by 72
Metadata
- Authors
- Denning, D. E., & Sacco, G. M.
- Venue
- Communications of the ACM
- Published
- 1981-08
- Volume
- 24
- Issue
- 8
- Pages
- 533-536
- ISSN
- 0001-0782 (ISSN-L)
- 1557-7317
- OpenAlex
- W2001788001
- Cited by
- 682
- References
- 6
- FWCI
- 5.10
- 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.