The DOI matches its Crossref record; 32 of the 32 references it cites were found in a registry or an index.
Provably authenticated group Diffie-Hellman key exchange
Abstract
Group Diffie-Hellman protocols for Authenticated Key Exchange (AKE) are designed to provide a pool of players with a shared secret key which may later be used, for example, to achieve multicast message integrity. Over the years, several schemes have been offered. However, no formal treatment for this cryptographic problem has ever been suggested. In this paper, we present a security model for this problem and use it to precisely define AKE (with "implicit" authentication) as the fundamental goal, and the entity-authentication goal as well. We then define in this model the execution of an authenticated group Diffie-Hellman scheme and prove its security.
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
Rayward-Smith, V. J. (1991) · Journal of the Operational Research Society · doi:10.1057/jors.1991.155 · Cited by 16,821
New directions in cryptography
Diffie, W., & Hellman, M. (1976) · IEEE Transactions on Information Theory · doi:10.1109/tit.1976.1055638 · Cited by 14,713
Random oracles are practical: a paradigm for designing efficient protocols
Bellare, M., & Rogaway, P. (1993) · Proceedings of the 1st ACM conference on Computer and communications security - CCS '93 · doi:10.1145/168588.168596 · Cited by 4,712
Goldwasser, S., & Micali, S. (1984) · Journal of Computer and System Sciences · doi:10.1016/0022-0000(84)90070-9 · Cited by 2,603
Security Arguments for Digital Signatures and Blind Signatures
Pointcheval, D., & Stern, J. (2000) · Journal of Cryptology · doi:10.1007/s001450010003 · Cited by 2,209
Self-citationEntity 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
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
Self-citationLower Bounds for Discrete Logarithms and Related Problems
Shoup, V. (1997) · Lecture Notes in Computer Science · doi:10.1007/3-540-69053-0_18 · Cited by 1,229
The Exact Security of Digital Signatures-How to Sign with RSA and Rabin
Bellare, M., & Rogaway, P. (1996) · Lecture Notes in Computer Science · doi:10.1007/3-540-68339-9_34 · Cited by 945
The Decision Diffie-Hellman problem
Boneh, D. (1998) · Lecture Notes in Computer Science · doi:10.1007/bfb0054851 · Cited by 895
A secure and efficient conference key distribution system: Extended abstract
Burmester, M., & Desmedt, Y. (1995) · Lecture Notes in Computer Science · doi:10.1007/bfb0053443 · Cited by 844
Key agreement in dynamic peer groups
Steiner, M., Tsudik, G., & Waidner, M. (2000) · IEEE Transactions on Parallel and Distributed Systems · doi:10.1109/71.877936 · Cited by 601
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
A conference key distribution system
Ingemarsson, I., Tang, D., & Wong, C. (1982) · IEEE Transactions on Information Theory · doi:10.1109/tit.1982.1056542 · Cited by 547
vic: a flexible framework for packet video
McCanne, S., & Jacobson, V. (1995) · Proceedings of the third ACM international conference on Multimedia - MULTIMEDIA '95 · doi:10.1145/217279.215315 · Cited by 490
Simple and fault-tolerant key agreement for dynamic collaborative groups
Kim, Y., Perrig, A., & Tsudik, G. (2000) · Proceedings of the 7th ACM conference on Computer and Communications Security · doi:10.1145/352600.352638 · Cited by 488
A Modular Approach to the Design and Analysis of Authentication and Key Exchange Protocols.
Bellare, M., Canetti, R., & Krawczyk, H. (1998) · Cited by 381
Bellare, M., Canetti, R., & Krawczyk, H. (1998) · Proceedings of the thirtieth annual ACM symposium on Theory of computing - STOC '98 · doi:10.1145/276698.276854 · Cited by 358
Number-theoretic constructions of efficient pseudo-random functions
Naor, M., & Reingold, O. (2002) · Proceedings 38th Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1997.646134 · Cited by 353
On the Exact Security of Full Domain Hash
Coron, J.-S. (2000) · Lecture Notes in Computer Science · doi:10.1007/3-540-44598-6_14 · Cited by 347
On Formal Models for Secure Key Exchange.
Shoup, V. (1999) · Cited by 322
New multiparty authentication services and key agreement protocols
Ateniese, G., Steiner, M., & Tsudik, G. (2000) · IEEE Journal on Selected Areas in Communications · doi:10.1109/49.839937 · Cited by 295
Authenticated Diffe-Hellman Key Agreement Protocols
Blake-Wilson, S., & Menezes, A. (1999) · Lecture Notes in Computer Science · doi:10.1007/3-540-48892-8_26 · Cited by 247
Provably Authenticated Group Diffie-Hellman Key Exchange — The Dynamic Case
Bresson, E., Chevassut, O., & Pointcheval, D. (2001) · Lecture notes in computer science · doi:10.1007/3-540-45682-1_18 · Cited by 241
Self-citationRSA-OAEP Is Secure under the RSA Assumption
Fujisaki, E., Okamoto, T., Pointcheval, D., & Stern, J. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-44647-8_16 · Cited by 206
Self-citationCommunication-Efficient Group Key Agreement
Kim, Y., Perrig, A., & Tsudik, G. (2001) · IFIP Advances in Information and Communication Technology · doi:10.1007/0-306-46998-7_16 · Cited by 204
Authenticated multi-party key agreement
Just, M., & Vaudenay, S. (1996) · Lecture Notes in Computer Science · doi:10.1007/bfb0034833 · Cited by 199
A Secure Audio Teleconference System
Steer, D. G., Strawczynski, L., Diffie, W., & Wiener, M. (1990) · Lecture Notes in Computer Science · doi:10.1007/0-387-34799-2_37 · Cited by 177
Mutual Authentication for Low-Power Mobile Devices
Jakobsson, M., & Pointcheval, D. (2002) · Lecture notes in computer science · doi:10.1007/3-540-46088-8_17 · Cited by 96
Self-citationA security analysis of the cliques protocols suites
Pereira, O., & Quisquater, J.-J. (2005) · IEEE Computer Security Foundations Workshop (CSFW) · doi:10.1109/csfw.2001.930137 · Cited by 84
Self-citationSecure protocol transformation via “expansion”
Mayer, A. J., & Yung, M. M. (1999) · ACM SIGSAC Conference on Computer and Communications Security (CCS) · doi:10.1145/319709.319721 · Cited by 28
Cited by
Tree-based group key agreement
Kim, Y., Perrig, A., & Tsudik, G. (2004) · ACM Transactions on Information and System Security · doi:10.1145/984334.984337 · Cited by 492
Scalable Protocols for Authenticated Group Key Exchange
Katz, J., & Yung, M. (2003) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-45146-4_7 · Cited by 393
Block Design-Based Key Agreement for Group Data Sharing in Cloud Computing
Shen, J., Zhou, T., He, D., Zhang, Y., Sun, X., & Xiang, Y. (2019) · IEEE Transactions on Dependable and Secure Computing · doi:10.1109/tdsc.2017.2725953 · Cited by 304
Metadata
- Authors
- Bresson, E., Chevassut, O., Pointcheval, D., & Quisquater, J.-J.
- Venue
- Proceedings of the 8th ACM conference on Computer and Communications Security
- Publisher
- ACM
- Published
- 2001-11-05
- Pages
- 255-264
- ISSN
- 1543-7221 (ISSN-L)
- OpenAlex
- W1977251372
- Cited by
- 372
- References
- 32
- FWCI
- 4.93
- Type
- conference paper
- 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.