The DOI matches its Crossref record; 17 of the 17 references it cites were found in a registry or an index.
Secure group communications using key graphs
Abstract
Many emerging network applications are based upon a group communications model. As a result, securing group communications, i.e., providing confidentiality, authenticity, and integrity of messages delivered between group members, will become a critical networking issue. We present, in this paper, a novel solution to the scalability problem of group/multicast key management. We formalize the notion of a secure group as a triple (U,K,R) where U denotes a set of users, K a set of keys held by the users, and R a user-key relation. We then introduce key graphs to specify secure groups. For a special class of key graphs, we present three strategies for securely distributing rekey messages after a join/leave and specify protocols for joining and leaving a secure group. The rekeying strategies and join/leave protocols are implemented in a prototype key server we have built. We present measurement results from experiments and discuss performance comparisons. We show that our group key management service, using any of the three rekeying strategies, is scalable to large groups with frequent joins and leaves. In particular, the average measured processing time per join/leave increases linearly with the logarithm of group size.
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
Merkle, R. C. (2007) · Lecture Notes in Computer Science · doi:10.1007/0-387-34805-0_21 · Cited by 1,691
Kerberos: An Authentication Service for Open Network Systems
Steiner, J. G., Athena, Neuman, C., & Schiller, J. I. (1988) · Cited by 1,014
Fiat, A., & Naor, M. (2007) · Lecture Notes in Computer Science · doi:10.1007/3-540-48329-2_40 · Cited by 728
Iolus: a framework for scalable secure multicasting
Mittra, S. (1997) · Proceedings of the ACM SIGCOMM '97 conference on Applications, technologies, architectures, and protocols for computer communication · doi:10.1145/263105.263179 · Cited by 669
Manber, U. (1989) · Cited by 566
Multicast routing in internetworks and extended LANs
Deering, S. E. (1995) · ACM SIGCOMM Computer Communication Review · doi:10.1145/205447.205457 · Cited by 425
Secure agreement protocols: reliable and atomic group multicast in rampart
Reiter, M. K. (1994) · Proceedings of the 2nd ACM Conference on Computer and communications security - CCS '94 · doi:10.1145/191177.191194 · Cited by 289
Digital signatures for flows and multicasts
Wong, C. K., & Lam, S. S. (1999) · IEEE/ACM Transactions on Networking · doi:10.1109/90.793005 · Cited by 281
Self-citationBerkovits, S. (2007) · Lecture Notes in Computer Science · doi:10.1007/3-540-46416-6_50 · Cited by 274
Cited by
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 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
Blockchain-Based Dynamic Key Management for Heterogeneous Intelligent Transportation Systems
Lei, A., Cruickshank, H., Cao, Y., Asuquo, P., Ogah, C. P. A., & Sun, Z. (2017) · IEEE Internet of Things Journal · doi:10.1109/jiot.2017.2740569 · Cited by 602
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
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
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
Vijayakumar, P., Azees, M., Kannan, A., & Jegatha Deborah, L. (2016) · IEEE Transactions on Intelligent Transportation Systems · doi:10.1109/tits.2015.2492981 · Cited by 320
Key Management Systems for Smart Grid Advanced Metering Infrastructure: A Survey
Ghosal, A., & Conti, M. (2019) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2019.2907650 · Cited by 267
On Security in Publish/Subscribe Services: A Survey
Esposito, C., & Ciampi, M. (2015) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2014.2364616 · Cited by 55
Metadata
- Authors
- Wong, C. K., Gouda, M., & Lam, S. S.
- Venue
- IEEE/ACM Transactions on Networking
- Published
- 2000
- Volume
- 8
- Issue
- 1
- Pages
- 16-30
- ISSN
- 1063-6692 (ISSN-L)
- OpenAlex
- W2019267322
- Cited by
- 1,093
- References
- 17
- FWCI
- 33.56
- 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.