The DOI matches its Crossref record; 20 of the 20 references it cites were found in a registry or an index.
ELK, a new protocol for efficient large-group key distribution
Abstract
Secure media broadcast over the Internet poses unique security challenges. One problem is access control to a large number of subscribers in a public broadcast. A common solution is to encrypt the broadcast data and to disclose the decryption key to legitimate receivers only. However, how do we securely and efficiently establish a shared secret among the legitimate receivers? And most importantly, how can we efficiently update the group key securely if receivers join or leave? How can we provide reliability for key update messages in a way that scales up to large groups? Recent research makes substantial progress to address these challenges. Current schemes feature efficient key update mechanisms assuming that the key updates are communicated reliably to the receivers. In practice, however the principal impediment to achieve a scalable system is to distribute the key updates reliably to all receivers. We have designed and implemented ELK, a novel key distribution protocol, to address these challenges with the following features: ELK features perfectly reliable, super-efficient member joins; ELK uses smaller key update messages than previous protocols; ELK features a mechanism that allows short hint messages to be used for key recovery allowing a tradeoff of communication overhead with member computation; ELK proposes to append a small amount of key update information to data packets, such that the majority of receivers can recover from lost key update messages; and ELK allows to trade off security with communication overhead.
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
The Theory of Error-Correcting Codes
(1977) · North-Holland Mathematical Library · doi:10.1016/s0924-6509(08)x7030-8 · Cited by 10,760
Polynomial Codes Over Certain Finite Fields
Reed, I. S., & Solomon, G. (1960) · Journal of the Society for Industrial and Applied Mathematics · doi:10.1137/0108018 · Cited by 3,662
How to construct random functions
Goldreich, O., Goldwasser, S., & Micali, S. (1986) · Journal of the ACM · doi:10.1145/6490.6503 · Cited by 2,115
Pricing via processing or combatting junk mail
Dwork, C., & Naor, M. (2007) · Lecture Notes in Computer Science · doi:10.1007/3-540-48071-4_10 · Cited by 1,282
A digital fountain approach to reliable distribution of bulk data
Byers, J. W., Luby, M., Mitzenmacher, M., & Rege, A. (1998) · Proceedings of the ACM SIGCOMM '98 conference on Applications, technologies, architectures, and protocols for computer communication · doi:10.1145/285237.285258 · Cited by 1,138
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
End-to-end Internet packet dynamics
Paxson, V. (1999) · IEEE/ACM Transactions on Networking · doi:10.1109/90.779192 · Cited by 908
Secure communications over insecure channels
Merkle, R. C. (1978) · Communications of the ACM · doi:10.1145/359460.359473 · Cited by 757
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
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
Cited by
LEAP: efficient security mechanisms for large-scale distributed sensor networks
Zhu, S., Setia, S., & Jajodia, S. (2003) · Proceedings of the 10th ACM conference on Computer and communications security · doi:10.1145/948109.948120 · Cited by 1,117
A survey of security issues in mobile ad hoc and sensor networks
Djenouri, D., Khelladi, L., & Badache, A. N. (2005) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2005.1593277 · Cited by 492
Mechanism Design for An Incentive-aware Blockchain-enabled Federated Learning Platform
Toyoda, K., & Zhang, A. N. (2019) · 2019 IEEE International Conference on Big Data (Big Data) · doi:10.1109/bigdata47090.2019.9006344 · Cited by 118
Metadata
- Authors
- Penrig, A., Song, D., & Tygar, D.
- Venue
- Proceedings 2001 IEEE Symposium on Security and Privacy. S&P 2001
- Publisher
- IEEE Comput. Soc
- Published
- 2002-11-13
- Pages
- 247-262
- OpenAlex
- W2118357205
- Cited by
- 354
- References
- 20
- FWCI
- 25.55
- 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: ELK, a new protocol for efficient large-group key distribution. https://app.cochat.ai/papers/10.1109/secpri.2001.924302
- The paper
- Penrig, A., Song, D., & Tygar, D. (2002). ELK, a new protocol for efficient large-group key distribution. Proceedings 2001 IEEE Symposium on Security and Privacy. S&P 2001. https://doi.org/10.1109/secpri.2001.924302
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.