The DOI matches its Crossref record; 25 of the 25 references it cites were found in a registry or an index.
Prudent engineering practice for cryptographic protocols
Abstract
We present principles for designing cryptographic protocols. The principles are neither necessary nor sufficient for correctness. They are however helpful, in that adherence to them would have prevented a number of published errors. Our principles are informal guidelines; they complement formal methods, but do not assume them. In order to demonstrate the actual applicability of these guidelines, we discuss some instructive examples from the literature.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
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
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-citationZero-knowledge proofs of identity
Feige, U., Fiat, A., & Shamir, A. (1988) · Journal of Cryptology · doi:10.1007/bf02351717 · Cited by 1,029
(2007) · Brute Force · doi:10.1007/0-387-27160-0_3 · Cited by 934
Timestamps in key distribution protocols
Denning, D. E., & Sacco, G. M. (1981) · Communications of the ACM · doi:10.1145/358722.358740 · Cited by 682
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
Self-citationAuthentication in distributed systems: theory and practice
Lampson, B., Abadi, M., Burrows, M., & Wobber, E. (1992) · ACM Transactions on Computer Systems · doi:10.1145/138873.138874 · Cited by 607
Self-citationA calculus for access control in distributed systems
Abadi, M., Burrows, M., Lampson, B., & Plotkin, G. (1993) · ACM Transactions on Programming Languages and Systems · doi:10.1145/155183.155225 · Cited by 575
Self-citationAuthentication in distributed systems: a bibliography
Liebl, A. (1993) · ACM SIGOPS Operating Systems Review · doi:10.1145/163640.163643 · Cited by 534
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
Zero knowledge proofs of identity
Fiege, U., Fiat, A., & Shamir, A. (1987) · Proceedings of the nineteenth annual ACM conference on Theory of computing - STOC '87 · doi:10.1145/28395.28419 · Cited by 407
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
Trust relationships in secure systems-a distributed authentication perspective
Yahalom, R., Klein, B., & Beth, T. (2002) · Proceedings 1993 IEEE Computer Society Symposium on Research in Security and Privacy · doi:10.1109/risp.1993.287635 · Cited by 263
Limitations of the Kerberos authentication system
Bellovin, S. M., & Merritt, M. (1990) · ACM SIGCOMM Computer Communication Review · doi:10.1145/381906.381946 · Cited by 255
NetCash: a design for practical electronic currency on the Internet
Medvinsky, G., & Neuman, C. (1993) · Proceedings of the 1st ACM conference on Computer and communications security - CCS '93 · doi:10.1145/168588.168601 · Cited by 212
Authentication in the Taos operating system
Wobber, E., Abadi, M., Burrows, M., & Lampson, B. (1994) · ACM Transactions on Computer Systems · doi:10.1145/174613.174614 · Cited by 196
Self-citationAuthentication for distributed systems
Woo, T. Y. C., & Lam, S. S. (1992) · Computer · doi:10.1109/2.108052 · Cited by 195
A security risk of depending on synchronized clocks
Gong, L. (1992) · ACM SIGOPS Operating Systems Review · doi:10.1145/130704.130709 · Cited by 157
Towards formal analysis of security protocols
Mao, W., & Boyd, C. (2002) · doi:10.1109/csfw.1993.246631 · Cited by 129
Protocol failures in cryptosystems
Moore, J. H. (1988) · Proceedings of the IEEE · doi:10.1109/5.4444 · Cited by 123
An analysis of the proxy problem in distributed systems
Varadharajan, V., Allen, P., & Black, S. (2002) · IEEE Computer Society Symposium on Research in Security and Privacy · doi:10.1109/risp.1991.130793 · Cited by 111
Boyd, C., & Mao, W. (2007) · Springer eBooks · doi:10.1007/3-540-48285-7_20 · Cited by 105
A security architecture for fault-tolerant systems
Reiter, M. K., Birman, K., & van Renesse, R. (1994) · ACM Transactions on Computer Systems · doi:10.1145/195792.195823 · Cited by 69
Cited by
Handbook of applied cryptography
(1997) · Choice Reviews Online · doi:10.5860/choice.34-4512 · Cited by 10,357
A calculus for cryptographic protocols: the spi calculus
Abadi, M., & Gordon, A. D. (1997) · Proceedings of the 4th ACM conference on Computer and communications security · doi:10.1145/266420.266432 · Cited by 1,154
Self-citationAn 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
A Calculus for Cryptographic Protocols: The Spi Calculus
Abadi, M., & Gordon, A. D. (1999) · Information and Computation · doi:10.1006/inco.1998.2740 · Cited by 668
Self-citationAn 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
Metadata
- Authors
- Abadi, M., & Needham, R.
- Venue
- IEEE Transactions on Software Engineering
- Published
- 1996
- Volume
- 22
- Issue
- 1
- Pages
- 6-15
- ISSN
- 0098-5589 (ISSN-L)
- OpenAlex
- W2097913369
- Cited by
- 574
- References
- 25
- FWCI
- 32.10
- 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.