The DOI matches its Crossref record; 20 of the 20 references it cites were found in a registry or an index.
The BiBa one-time signature and broadcast authentication protocol
Abstract
We introduce the BiBa signature scheme, a new signature construction that uses one-way functions without trapdoors. BiBa features a low verification overhead and a relatively small signature size. In comparison to other one-way function based signature schemes, BiBa has smaller signatures and is at least twice as fast to verify (which probably makes it one of the fastest signature scheme to date for verification). On the downside, the BiBa public key is large, and the signature generation overhead is higher than previous schemes based on one-way functions without trapdoors (although it can be trivially parallelized).One of the main challenges of securing broadcast communication is source authentication, which allows all receivers to verify the origin of the data. An ideal broadcast authentication protocol should be efficient for the sender and the receiver, have a small communication overhead, allow the receiver to authenticate each individual packet, provide perfect robustness to packet loss, scale to large numbers of receivers, and provide instant authentication (no buffering of data at the sender or receiver side). We are not aware of any previous protocol that satisfies all these properties. We present the BiBa broadcast authentication protocol, a new construction based on the BiBa signature, that achieves all our desired properties, with the tradeoff that it requires a moderate computation overhead for the sender to generate the authentication information, and that it requires loose time synchronization between the sender and receivers.
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
A method for obtaining digital signatures and public-key cryptosystems
Rivest, R. L., Shamir, A., & Adleman, L. (1983) · Communications of the ACM · doi:10.1145/357980.358017 · Cited by 13,012
The MD5 Message-Digest Algorithm
Rivest (1992) · Medical Entomology and Zoology · Cited by 2,853
Password authentication with insecure communication
Lamport, L. (1981) · Communications of the ACM · doi:10.1145/358790.358797 · Cited by 2,789
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
A Digital Signature Based on a Conventional Encryption Function
Merkle, R. C. (1988) · Lecture Notes in Computer Science · doi:10.1007/3-540-48184-2_32 · Cited by 1,998
Merkle, R. C. (2007) · Lecture Notes in Computer Science · doi:10.1007/0-387-34805-0_21 · Cited by 1,691
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
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
Self-citationRivest, R. L. (1995) · Lecture Notes in Computer Science · doi:10.1007/3-540-60590-8_7 · Cited by 892
Cited by
Rushing attacks and defense in wireless ad hoc network routing protocols
Hu, Y.-C., Perrig, A., & Johnson, D. B. (2003) · Proceedings of the 2nd ACM workshop on Wireless security · doi:10.1145/941311.941317 · Cited by 638
Self-citationSecure 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
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
Blockchained Post-Quantum Signatures
Chalkias, K., Brown, J., Hearn, M., Lillehagen, T., Nitto, I., & Schroeter, T. (2018) · 2018 IEEE International Conference on Internet of Things (iThings) and IEEE Green Computing and Communications (GreenCom) and IEEE Cyber, Physical and Social Computing (CPSCom) and IEEE Smart Data (SmartData) · doi:10.1109/cybermatics_2018.2018.00213 · Cited by 69
Metadata
- Authors
- Perrig, A.
- Venue
- Proceedings of the 8th ACM conference on Computer and Communications Security
- Publisher
- ACM
- Published
- 2001-11-05
- Pages
- 28-37
- ISSN
- 1543-7221 (ISSN-L)
- OpenAlex
- W1974303722
- Cited by
- 304
- References
- 20
- FWCI
- 10.72
- 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: The BiBa one-time signature and broadcast authentication protocol. https://app.cochat.ai/papers/10.1145/501983.501988
- The paper
- Perrig, A. (2001). The BiBa one-time signature and broadcast authentication protocol. Proceedings of the 8th ACM conference on Computer and Communications Security. https://doi.org/10.1145/501983.501988
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.