The DOI matches its Crossref record; 15 of the 15 references it cites were found in a registry or an index.
Iolus: a framework for scalable secure multicasting
Open accessAbstract
As multicast applications are deployed for mainstream use, the need to secure multicast communications will become critical. Multicast, however, does not fit the point-to-point model of most network security protocols which were designed with unicast communications in mind. As we will show, securing multicast (or group) communications is fundamentally different from securing unicast (or paired) communications. In turn, these differences can result in scalability problems for many typical applications.In this paper, we examine and model the differences between unicast and multicast security and then propose Iolus: a novel framework for scalable secure multicasting. Protocols based on Iolus can be used to achieve a variety of security objectives and may be used either to directly secure multicast communications or to provide a separate group key management service to other "security-aware" applications. We describe the architecture and operation of Iolus in detail and also describe our experience with a protocol based on the Iolus framework.
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
Lecture Notes in Computer Science 1205
(1999) · Industrial Robot: An International Journal · doi:10.1108/ir.1999.04926fae.001 · Cited by 38,662
New directions in cryptography
Diffie, W., & Hellman, M. (1976) · IEEE Transactions on Information Theory · doi:10.1109/tit.1976.1055638 · Cited by 14,713
The MD5 Message-Digest Algorithm
Rivest (1992) · Medical Entomology and Zoology · Cited by 2,853
Host extensions for IP multicasting
Deering, S. (1986) · doi:10.17487/rfc1112 · Cited by 1,344
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
A reliable multicast framework for light-weight sessions and application level framing
Floyd, S., Jacobson, V., McCanne, S., Liu, C.-G., & Zhang, L. (1995) · Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication · doi:10.1145/217382.217470 · Cited by 705
The PIM architecture for wide-area multicast routing
Deering, S., Estrin, D. L., Farinacci, D., Jacobson, V., Liu, C.-G., & Wei, L. (1996) · IEEE/ACM Transactions on Networking · doi:10.1109/90.490743 · Cited by 655
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
Partridge, C., Mendez, T., & Milliken, W. (1993) · doi:10.17487/rfc1546 · Cited by 451
Cited by
Cyber security in the Smart Grid: Survey and challenges
Wang, W., & Lu, Z. (2013) · Computer Networks · doi:10.1016/j.comnet.2012.12.017 · Cited by 1,123
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
Deployment issues for the IP multicast service and architecture
Diot, C., Levine, B. N., Lyles, B., Kassem, H., & Balensiefen, D. (2000) · IEEE Network · doi:10.1109/65.819174 · Cited by 791
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
LEAP+: Efficient security mechanisms for large-scale distributed sensor networks
Zhu, S., Setia, S., & Jajodia, S. (2006) · ACM Transactions on Sensor Networks · doi:10.1145/1218556.1218559 · Cited by 669
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
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
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
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
- Mittra, S.
- Venue
- Proceedings of the ACM SIGCOMM '97 conference on Applications, technologies, architectures, and protocols for computer communication
- Publisher
- ACM
- Published
- 1997-10
- Pages
- 277-288
- OpenAlex
- W2159945176
- Cited by
- 669
- References
- 15
- FWCI
- 16.02
- Type
- conference paper
- Language
- en
- Open access
- bronze
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.