The BiBa one-time signature and broadcast authentication protocol
By Adrian Perrig. Conference on Computer and Communications Security, 2001
359 citations recorded by the source corpus.
Subfields: Artificial Intelligence, Computer Networks and Communications
View Paper: https://www.semanticscholar.org/paper/e3f8af222409541805098dd9cd2c16ba4c76a28a
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Artificial Intelligence
- Yih-Chun Hu
- David B. Johnson
- Adrian Perrig
- Leonid Reyzin
- Natan Reyzin
- Michael J. Freedman
- David Mazières
- Maxwell N. Krohn
In Computer Networks and Communications
- Adrian Perrig
- Yih-Chun Hu
- David B. Johnson
- Jean-Pierre Hubaux
- Michael J. Freedman
- David Mazières
- Leonid Reyzin
- Natan Reyzin
Citations in the corpus
- Global Intrusion Detection in the DOMINO Overlay System (2004, neutral): “[35, 40]), including ellipticcurve based public-key systems [20].”
- On-the-fly verification of rateless erasure codes for efficient content distribution (2004, background): “The recent BiBa [34] protocol exploits the birthday paradox to generate one-time signatures from k-wise hash collisions.”
- Secure Signature-Based Authenticated Key Establishment Scheme for Future IoT Applications (2017, methodology): “• Signature based approach: Schemes similar to [25] and [26] pro vide fast generation and verification of signatures.”
- Multilevel μTESLA: Broadcast authentication for distributed sensor networks (2004, neutral): “Perrig introduced a verification efficie nt signature scheme named BiBa based on one-way hash functions without trapdoor s [23]; however, BiBa has high overhead in signature generation and public key distribution.”
- Rushing attacks and defense in wireless ad hoc network routing protocols (2003, methodology): “The BiBa One-Time Signature and Broadcast Authentication Protocol.”
- Better than BiBa: Short One-Time Signatures with Fast Signing and Verifying (2002, methodology): “Therefore, for a fair comparison, we have to make the same assumptions as [ Per01 ] makes: that Hash is a random oracle.”