The DOI matches its Crossref record; 14 of the 14 references it cites were found in a registry or an index.
Simple and fault-tolerant key agreement for dynamic collaborative groups
Abstract
Secure group communication is an increasingly popular research area having received much attention in recent years. The fundamental challenge revolves around secure and efficient group key management. While centralized methods are often appropriate for key distribution in large groups, many collaborative group settings require distributed key agreement techniques. This work investigates a novel approach to group key agreement by blending binary key trees with Diffie-Hellman key exchange. The resultant protocol suite is very simple, secure and fault-tolerant. Moreover, its efficiency surpasses that of prior art.
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
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
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
Handbook of Applied Cryptography
Menezes, A. J., van Oorschot, P. C., & Vanstone, S. A. (2018) · CRC Press eBooks · doi:10.1201/9780429466335 · Cited by 1,770
Secure group communications using key graphs
Wong, C. K., Gouda, M., & Lam, S. S. (2000) · IEEE/ACM Transactions on Networking · doi:10.1109/90.836475 · Cited by 1,093
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 establishment in large dynamic groups using one-way function trees
Sherman, A. T., & McGrew, D. A. (2003) · IEEE Transactions on Software Engineering · doi:10.1109/tse.2003.1199073 · Cited by 713
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
Self-citationA 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
The VersaKey framework: versatile group key management
Waldvogel, M., Caronni, G., Sun, D., Weiler, N., & Plattner, B. (1999) · IEEE Journal on Selected Areas in Communications · doi:10.1109/49.790485 · Cited by 347
Cited by
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
Provably authenticated group Diffie-Hellman key exchange
Bresson, E., Chevassut, O., Pointcheval, D., & Quisquater, J.-J. (2001) · Proceedings of the 8th ACM conference on Computer and Communications Security · doi:10.1145/501983.502018 · Cited by 372
GroupIt: Lightweight group key management for dynamic iot environments
Kung, Y.-H., & Hsiao, H.-C. (2018) · IEEE Internet of Things Journal · doi:10.1109/jiot.2018.2840321 · Cited by 60
Metadata
- Authors
- Kim, Y., Perrig, A., & Tsudik, G.
- Venue
- Proceedings of the 7th ACM conference on Computer and Communications Security
- Publisher
- ACM
- Published
- 2000-11
- Pages
- 235-244
- ISSN
- 1543-7221 (ISSN-L)
- OpenAlex
- W2054251041
- Cited by
- 488
- References
- 14
- FWCI
- 15.32
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Simple and fault-tolerant key agreement for dynamic collaborative groups. https://app.cochat.ai/papers/10.1145/352600.352638
- The paper
- Kim, Y., Perrig, A., & Tsudik, G. (2000). Simple and fault-tolerant key agreement for dynamic collaborative groups. Proceedings of the 7th ACM conference on Computer and Communications Security. https://doi.org/10.1145/352600.352638
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.
