The DOI matches its Crossref record; 21 of the 21 references it cites were found in a registry or an index.
Key establishment in large dynamic groups using one-way function trees
Open accessAbstract
We present, implement, and analyze a new scalable centralized algorithm, called OFT, for establishing shared cryptographic keys in large, dynamically changing groups. Our algorithm is based on a novel application of one-way function trees. In comparison with the top-down logical key hierarchy (LKH) method of Wallner et al., our bottom-up algorithm approximately halves the number of bits that need to be broadcast to members in order to rekey after a member is added or evicted. The number of keys stored by group members, the number of keys broadcast to the group when new members are added or evicted, and the computational efforts of group members, are logarithmic in the number of group members. Among the hierarchical methods, OFT is the first to achieve an approximate halving in broadcast length, an idea on which subsequent algorithms have built. Our algorithm provides complete forward and backward security: Newly admitted group members cannot read previous messages, and evicted members cannot read future messages, even with collusion by arbitrarily many evicted members. In addition, and unlike LKH, our algorithm has the option of being member contributory in that members can be allowed to contribute entropy to the group key. Running on a Pentium II, our prototype has handled groups with up to 10 million members. This algorithm offers a new scalable method for establishing group session keys for secure large-group applications such as broadcast encryption, electronic conferences, multicast sessions, and military command and control.
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
Handbook of applied cryptography
(1997) · Choice Reviews Online · doi:10.5860/choice.34-4512 · Cited by 10,357
The MD5 Message-Digest Algorithm
Rivest (1992) · Medical Entomology and Zoology · Cited by 2,853
Security Architecture for the Internet Protocol
Atkinson, R. (1995) · doi:10.17487/rfc1825 · Cited by 2,762
The MD5 Message-Digest Algorithm
Rivest, R. (1992) · doi:10.17487/rfc1321 · Cited by 1,976
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
Revocation and Tracing Schemes for Stateless Receivers
Naor, D., Naor, M., & Lotspiech, J. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-44647-8_3 · Cited by 1,118
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
Perfectly-Secure Key Distribution for Dynamic Conferences
Blundo, C., De Santis, A., Herzberg, A., Kutten, S., Vaccaro, U., & Yung, M. (1993) · Lecture Notes in Computer Science · doi:10.1007/3-540-48071-4_33 · Cited by 1,030
The Internet Key Exchange (IKE)
Harkins, D., & Carrel, D. (1998) · doi:10.17487/rfc2409 · Cited by 1,012
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
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
Chor, B., Fiat, A., & Naor, M. (1994) · International Cryptology Conference · Cited by 468
Chor, B., Fiat, A., & Naor, M. (1994) · Lecture Notes in Computer Science · doi:10.1007/3-540-48658-5_25 · Cited by 366
ELK, a new protocol for efficient large-group key distribution
Penrig, A., Song, D., & Tygar, D. (2002) · Proceedings 2001 IEEE Symposium on Security and Privacy. S&P 2001 · doi:10.1109/secpri.2001.924302 · Cited by 354
Chor, B., Fiat, A., Naor, M., & Pinkas, B. (2000) · IEEE Transactions on Information Theory · doi:10.1109/18.841169 · Cited by 304
Flajolet, P., & Odlyzko, A. M. (2007) · Lecture Notes in Computer Science · doi:10.1007/3-540-46885-4_34 · Cited by 274
Key Management for Large Dynamic Groups: One-Way Function Trees and Amortized Initialization
Balenson, D. M., McGrew, D. A., & Sherman, A. T. (2000) · Cited by 239
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 group key agreement and friends
Ateniese, G., Steiner, M., & Tsudik, G. (1998) · Proceedings of the 5th ACM conference on Computer and communications security · doi:10.1145/288090.288097 · Cited by 176
Efficient and secure conference-key distribution
Burmester, M. V. D., & Desmedt, Y. (1997) · Lecture notes in computer science · doi:10.1007/3-540-62494-5_12 · Cited by 101
Logical Key Hierarchy Protocol
Harney, H., & Harder, E. J. (1999) · Cited by 96
Cited by
Collusion Resistant Broadcast Encryption with Short Ciphertexts and Private Keys
Boneh, D., Gentry, C., & Waters, B. (2005) · Lecture Notes in Computer Science · doi:10.1007/11535218_16 · Cited by 1,047
A survey of key management for secure group communication
Rafaeli, S., & Hutchison, D. (2003) · ACM Computing Surveys · doi:10.1145/937503.937506 · Cited by 760
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
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
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
Metadata
- Authors
- Sherman, A. T., & McGrew, D. A.
- Venue
- IEEE Transactions on Software Engineering
- Published
- 2003-05
- Volume
- 29
- Issue
- 5
- Pages
- 444-458
- ISSN
- 0098-5589 (ISSN-L)
- OpenAlex
- W2165482045
- Cited by
- 713
- References
- 21
- FWCI
- 55.83
- Type
- journal article
- Language
- en
- Open access
- green
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.