The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
Efficient authentication and signing of multicast streams over lossy channels
Abstract
Multicast stream authentication and signing is an important and challenging problem. Applications include the continuous authentication of radio and TV Internet broadcasts, and authenticated data distribution by satellite. The main challenges are fourfold. First, authenticity must be guaranteed even when only the sender of the data is trusted. Second, the scheme needs to scale to potentially millions of receivers. Third, streamed media distribution can have high packet loss. Finally the system needs to be efficient to support fast packet rates. We propose two efficient schemes, TESLA and EMSS, for secure lossy multicast streams. TESLA (Timed Efficient Stream Loss-tolerant Authentication), offers sender authentication, strong loss robustness, high scalability and minimal overhead at the cost of loose initial time synchronization and slightly delayed authentication. EMSS (Efficient Multi-chained Stream Signature), provides nonrepudiation of origin, high loss resistance, and low overhead, at the cost of slightly delayed verification.
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
A method for obtaining digital signatures and public-key cryptosystems
Rivest, R. L., Shamir, A., & Adleman, L. (1978) · Communications of the ACM · doi:10.1145/359340.359342 · Cited by 13,462
Protocols for Public Key Cryptosystems
Merkle, R. C. (1980) · 1980 IEEE Symposium on Security and Privacy · doi:10.1109/sp.1980.10006 · Cited by 1,418
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
A Lightweight Privacy-Preserving Data Aggregation Scheme for Fog Computing-Enhanced IoT
Lu, R., Heung, K., Lashkari, A. H., & Ghorbani, A. A. (2017) · IEEE Access · doi:10.1109/access.2017.2677520 · Cited by 478
A survey on authentication schemes in VANETs for secured communication
Manvi, S. S., & Tangade, S. (2017) · Vehicular Communications · doi:10.1016/j.vehcom.2017.02.001 · Cited by 311
Metadata
- Authors
- Perrig, A., Canetti, R., Tygar, J. D., & Song, D.
- Venue
- Proceeding 2000 IEEE Symposium on Security and Privacy. S&P 2000
- Publisher
- IEEE Comput. Soc
- Published
- 2002-11-07
- Pages
- 56-73
- OpenAlex
- W2130459259
- Cited by
- 946
- References
- 2
- FWCI
- 49.48
- 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: Efficient authentication and signing of multicast streams over lossy channels. https://app.cochat.ai/papers/10.1109/secpri.2000.848446
- The paper
- Perrig, A., Canetti, R., Tygar, J. D., & Song, D. (2002). Efficient authentication and signing of multicast streams over lossy channels. Proceeding 2000 IEEE Symposium on Security and Privacy. S&P 2000. https://doi.org/10.1109/secpri.2000.848446
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.
