A compact and fast hybrid signature scheme for multicast packet authentication
Open accessThe DOI matches its Crossref record.
Abstract
This paper proposes a compact and fast hybrid signature scheme that can be used to solve the problem of packet source authentication for multicast. This scheme can be viewed as an improvement to off-line/on-line signature schemes, in that the signature size overhead is much smaller. Since this is a generic technique, it should have applications to several other practical problems as well.
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
Cited by
SPINS: security protocols for sensor networks
Perrig, A., Szewczyk, R., Wen, V., Culler, D., & Tygar, J. D. (2001) · Proceedings of the 7th annual international conference on Mobile computing and networking · doi:10.1145/381677.381696 · Cited by 2,532
SPINS: Security Protocols for Sensor Networks
Perrig, A., Szewczyk, R., Tygar, J. D., Wen, V., & Culler, D. E. (2002) · Wireless Networks · doi:10.1023/a:1016598314198 · Cited by 2,264
Ariadne: a secure on-demand routing protocol for ad hoc networks
Hu, Y.-C., Perrig, A., & Johnson, D. B. (2002) · Proceedings of the 8th annual international conference on Mobile computing and networking · doi:10.1145/570645.570648 · Cited by 1,298
Ariadne: A Secure On-Demand Routing Protocol for Ad Hoc Networks
Hu, Y.-C., Perrig, A., & Johnson, D. B. (2005) · Wireless Networks · doi:10.1007/s11276-004-4744-y · Cited by 1,033
Efficient authentication and signing of multicast streams over lossy channels
Perrig, A., Canetti, R., Tygar, J. D., & Song, D. (2002) · Proceeding 2000 IEEE Symposium on Security and Privacy. S&P 2000 · doi:10.1109/secpri.2000.848446 · Cited by 946
The TESLA Broadcast Authentication Protocol
Perrig, A., Canetti, R., Tygar, J. D., & Song, D. X. (2018) · Figshare · doi:10.1184/r1/6073610 · Cited by 842
Distributed Detection of Node Replication Attacks in Sensor Networks
Parno, B., Perrig, A., & Gligor, V. (2005) · 2005 IEEE Symposium on Security and Privacy (S&P'05) · doi:10.1109/sp.2005.8 · Cited by 675
Secure Signature-Based Authenticated Key Establishment Scheme for Future IoT Applications
Challa, S., Wazid, M., Das, A. K., Kumar, N., Goutham Reddy, A., Yoon, E.-J., & Yoo, K.-Y. (2017) · IEEE Access · doi:10.1109/access.2017.2676119 · Cited by 450
Multilevel μTESLA: Broadcast authentication for distributed sensor networks
Liu, D., & Ning, P. (2004) · ACM Transactions on Embedded Computing Systems · doi:10.1145/1027794.1027800 · Cited by 342
The BiBa one-time signature and broadcast authentication protocol
Perrig, A. (2001) · Proceedings of the 8th ACM conference on Computer and Communications Security · doi:10.1145/501983.501988 · Cited by 304
Better than BiBa: Short One-Time Signatures with Fast Signing and Verifying
Reyzin, L., & Reyzin, N. (2002) · Lecture Notes in Computer Science · doi:10.1007/3-540-45450-0_11 · Cited by 295
Authenticating health activity data using distributed ledger technologies
Brogan, J., Baskaran, I., & Ramachandran, N. (2018) · Computational and Structural Biotechnology Journal · doi:10.1016/j.csbj.2018.06.004 · Cited by 167
Metadata
- Authors
- Rohatgi, P.
- Venue
- Proceedings of the 6th ACM conference on Computer and communications security
- Publisher
- ACM
- Published
- 1999-11
- Pages
- 93-100
- ISSN
- 1543-7221 (ISSN-L)
- OpenAlex
- W1968359844
- Cited by
- 178
- References
- 0
- FWCI
- 7.36
- 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.