The DOI matches its Crossref record; 22 of the 22 references it cites were found in a registry or an index.
A modular approach to the design and analysis of authentication and key exchange protocols (extended abstract)
Open accessAbstract
We prcscnt a general framework for constructing and analyzing authentication protocols in realistic models of communication networks.This framework provides a sound formalization for the authentication problem and suggests simple and attractive design principles for general authentication and key exchange protocols.The key element in our appronch io a modular treatment of the authentication problem in cryptographic protocols; thii applies to the definition of accurity, to the design of the protocols, and to their analysis.In particulnr, following this modular approach, we show how to systematically transform solutions that work in a model of idaalizcd authenticated communications into solutions that are secure in the realistic setting of communication channels controlled by an active adversary.Using these principles we construct and prove the security of simple and practical authentication and key-exchange protocols.In particular, we provide a security analysis of aomo well-known key exchange protocols (e.g.authenticated Dlfllc-Hcllman key exchange), and of some of the techniques underlying the design of several authentication protocols that are currently being deployed on a large scale for the Intornot Protocol and other applications.
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
Goldreich, O., Micali, S., & Wigderson, A. (1987) · Proceedings of the nineteenth annual ACM conference on Theory of computing - STOC '87 · doi:10.1145/28395.28420 · Cited by 3,590
A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks
Goldwasser, S., Micali, S., & Rivest, R. L. (1988) · SIAM Journal on Computing · doi:10.1137/0217017 · Cited by 2,804
Protocols for secure computations
Yao, A. C.-C. (1982) · doi:10.1109/sfcs.1982.88 · Cited by 2,661
Completeness theorems for non-cryptographic fault-tolerant distributed computation
Ben-Or, M., & Wigderson, A. (1988) · Proceedings of the twentieth annual ACM symposium on Theory of computing - STOC '88 · doi:10.1145/62212.62213 · Cited by 2,524
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
Entity Authentication and Key Distribution
Bellare, M., & Rogaway, P. (2007) · Lecture Notes in Computer Science · doi:10.1007/3-540-48329-2_21 · Cited by 1,752
Multiparty unconditionally secure protocols
Chaum, D., Crépeau, C., & Damgard, I. (1988) · Proceedings of the twentieth annual ACM symposium on Theory of computing - STOC '88 · doi:10.1145/62212.62214 · Cited by 1,544
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
Public-key cryptosystems provably secure against chosen ciphertext attacks
Naor, M., & Yung, M. (1990) · Proceedings of the twenty-second annual ACM symposium on Theory of computing - STOC '90 · doi:10.1145/100216.100273 · Cited by 1,088
Non-Interactive Zero-Knowledge Proof of Knowledge and Chosen Ciphertext Attack
Rackoff, C., & Simon, D. R. (2007) · Lecture Notes in Computer Science · doi:10.1007/3-540-46766-1_35 · Cited by 1,039
New Directions in Cryptography
Diffie, W., & Hellman, M. E. (2022) · Democratizing Cryptography · doi:10.1145/3549993.3550007 · Cited by 668
Key agreement protocols and their security analysis
Blake-Wilson⋆⋆, S., Johnson, D. B., & Menezes, A. (1997) · Lecture notes in computer science · doi:10.1007/bfb0024447 · Cited by 595
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
Self-citationAdaptively secure multi-party computation
Canetti, R., Feige, U., Goldreich, O., & Naor, M. (1996) · Proceedings of the twenty-eighth annual ACM symposium on Theory of computing - STOC '96 · doi:10.1145/237814.238015 · Cited by 548
Self-citationTowards realizing random oracles: Hash functions that hide all partial information
Canetti, R. (1997) · Lecture Notes in Computer Science · doi:10.1007/bfb0052255 · Cited by 365
Self-citationFoundations of Secure Interactive Computing
Beaver, D. (2007) · Lecture Notes in Computer Science · doi:10.1007/3-540-46766-1_31 · Cited by 277
Asynchronous secure computation
Ben-Or, M., Canetti, R., & Goldreich, O. (1993) · Proceedings of the twenty-fifth annual ACM symposium on Theory of computing - STOC '93 · doi:10.1145/167088.167109 · Cited by 227
Self-citationSKEME: a versatile secure key exchange mechanism for Internet
Krawczyk, H. (2002) · Proceedings of Internet Society Symposium on Network and Distributed Systems Security · doi:10.1109/ndss.1996.492418 · Cited by 223
Self-citationSystematic Design of Two-Party Authentication Protocols
Bird, R., Gopal, I. S., Herzberg, A., Janson, P., Kutten, S., Molva, R. A., & Yung, M. M. (2007) · Springer eBooks · doi:10.1007/3-540-46766-1_3 · Cited by 148
Open key exchange: How to defeat dictionary attacks without encrypting public keys
Lucks, S. (1998) · Lecture notes in computer science · doi:10.1007/bfb0028161 · Cited by 114
Entity authentication and authenticated key transport protocols employing asymmetric techniques
Blake-Wilson⋆⋆, S., & Menezes, A. (1998) · Lecture notes in computer science · doi:10.1007/bfb0028166 · Cited by 65
Cited by
The Elliptic Curve Digital Signature Algorithm (ECDSA)
Johnson, D., Menezes, A., & Vanstone, S. (2001) · International Journal of Information Security · doi:10.1007/s102070100002 · Cited by 2,239
Analysis of Key-Exchange Protocols and Their Use for Building Secure Channels
Canetti, R., & Krawczyk, H. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-44987-6_28 · Cited by 1,653
Self-citationAuthenticated 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
Self-citationA practical public key cryptosystem provably secure against adaptive chosen ciphertext attack
Cramer, R., & Shoup, V. (1998) · Lecture Notes in Computer Science · doi:10.1007/bfb0055717 · Cited by 1,437
Relations among notions of security for public-key encryption schemes
Bellare, M., Desai, A., Pointcheval, D., & Rogaway, P. (1998) · Lecture Notes in Computer Science · doi:10.1007/bfb0055718 · Cited by 810
Self-citation
Metadata
- Authors
- Bellare, M., Canetti, R., & Krawczyk, H.
- Venue
- Proceedings of the thirtieth annual ACM symposium on Theory of computing - STOC '98
- Publisher
- ACM Press
- Published
- 1998
- Pages
- 419-428
- OpenAlex
- W1974664062
- Cited by
- 358
- References
- 22
- FWCI
- 11.27
- Type
- conference paper
- Language
- en
- Open access
- gold
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.