Adrian Perrig. The BiBa One-Time Signature and Broadcast Authentication Protocol. In Proceedings of the Eighth ACM Conference on Computer and Communications Security (CCS-8), pages 28--37, November 2001. Home/Search Document Details and Download
Summary ACM TOC Related Articles Check |
This paper is cited in the following contexts:
First 50 documents
Efficient Pebbling for List Traversal Synopses - Matias, Porat (2002) (Correct)
....any 2 k lg n. A hash chain is obtained by repeatedly applying a one way hash function, starting with a secret seed. There are a number cryptographic applications, including password authentication [10] micropayments [13] forward secure signatures [7, 9] and broadcast authentication protocol [11]. Our results enable e ective implementation with arbitrary memory size. 3 The list pebbling algorithm extends to directed trees and general directed graphs. Applications include the e ective implementation of the parent function ( for XML trees, and e ective graph traversals with ....
....the worst case. As a particular case, by keeping lg n hash values, the time to obtain a preceding hash value is O(lg n) The cryptographic applications of hash chain include password authentication [10] micro payments [13] forward secure signatures [7, 9] and broadcast authentication protocol [11]. Such applications and others can bene t from ecient hash chain processing, especially in memory challenged platforms such as smart cards. 7 Traversals of Trees and other graphs We discuss implementations for other linked structures. For every structure (tree, dag, graph) a (forward) ....
A. Perrig. The biba one-time signature and broadcast authentication protocol. In ACM Conference on Computer and Communications Security, pages 28-37, 2001.
A Case for Infectious Virtual Programs in Sensor Networks - Levis, Culler (Correct)
....must be computationally inexpensive to verify. Second, it must be short and not require large payloads. Third, it must not depend on secrets stored on motes. BiBa is an example of a mechanism that shows promise, although it still has limitations (a finite number of messages can be signed safely) [11]. 11. THE QUICK We choose to go to the moon in this decade and do the other things, not because they are easy but because they are hard. John F. Kennedy, 1962 By making smart environments possible, sensor networks will fundamentally change the way we live. Biogeochemistry networks will help ....
A. Perrig. The BiBa One-time Signature and Broadcast Authentication Protocol. In ACM Conference on Computer and Communications Security, pages 28--37, 2001.
Bounds on the Efficiency of Encryption and Digital Signatures - Gennaro, Gertner, Katz (2002) (Correct)
....(in which case the proof of security no longer holds) An interesting feature of our lower bound for signature schemes is that it bounds the e#ciency of the verification algorithm. There are several practical applications that call for signature schemes with e#cient verification algorithms (e.g. [19]) especially when the client who is verifying signatures is less e#cient that the server who generates them. Our result indicates that there is little hope of improving current schemes based simply on one way permutations. 4 1.3 Open Problems Our lower bound for encryption matches the ....
A. Perrig. The BiBa One-Time Signature and Broadcast Authentication Protocol. ACM CCCS '01.
Efficient Security Mechanisms for Routing Protocols - Yih-Chun Hu Yihchun (2003) (8 citations) Self-citation (Perrig) (Correct)
No context found.
Adrian Perrig. The BiBa One-Time Signature and Broadcast Authentication Protocol. In Proceedings of the Eighth ACM Conference on Computer and Communications Security (CCS-8), pages 28--37, November 2001.
Rushing Attacks and Defense in Wireless Ad Hoc Network - Routing Protocols Yih-Chun Self-citation (Perrig) (Correct)
No context found.
Adrian Perrig. The BiBa One-Time Signature and Broadcast Authentication Protocol. In Proceedings of the Eighth ACM Conference on Computer and Communications Security (CCS-8), pages 28--37, Philadelphia PA, USA, November 2001.
Rushing Attacks and Defense in Wireless Ad Hoc Network - Routing Protocols Yih-Chun Self-citation (Perrig) (Correct)
No context found.
Adrian Perrig. The BiBa One-Time Signature and Broadcast Authentication Protocol. In Proceedings of the Eighth ACM Conference on Computer and Communications Security (CCS-8), pages 28--37, Philadelphia PA, USA, November 2001.
Efficient Security Mechanisms for Routing Protocols - Yih-Chun Hu Yihchun (2003) (8 citations) Self-citation (Perrig) (Correct)
No context found.
Adrian Perrig. The BiBa One-Time Signature and Broadcast Authentication Protocol. In Proceedings of the Eighth ACM Conference on Computer and Communications Security (CCS-8), pages 28--37, November 2001.
Distillation Codes and Applications to DoS Resistant .. - Karlof, Sastry, Li, .. (2004) (3 citations) Self-citation (Perrig) (Correct)
No context found.
A. Perrig. The BiBa one-time signature and broadcast authentication protocol. In Proceedings of the Eighth ACM Conference on Computer and Communications Security (CCS-8), pages 28--37, Philadelphia PA, USA, Nov. 2001.
Distillation Codes and Applications to DoS Resistant .. - Karlof, Sastry, Li, .. (2004) (3 citations) Self-citation (Perrig) (Correct)
No context found.
A. Perrig. The BiBa one-time signature and broadcast authentication protocol. In Proceedings of the Eighth ACM Conference on Computer and Communications Security (CCS-8), pages 28--37, Philadelphia PA, USA, Nov. 2001.
Distillation Codes and Applications to DoS Resistant .. - Karlof, Sastry, Li, .. (2004) (3 citations) Self-citation (Perrig) (Correct)
No context found.
A. Perrig. The BiBa one-time signature and broadcast authentication protocol. In Proceedings of the Eighth ACM Conference on Computer and Communications Security (CCS-8), pages 28--37, Philadelphia PA, USA, Nov. 2001.
Efficient Security Mechanisms for Routing Protocols - Yih-Chun Hu Yihchun (2003) (8 citations) Self-citation (Perrig) (Correct)
No context found.
Adrian Perrig. The BiBa One-Time Signature and Broadcast Authentication Protocol. In Proceedings of the Eighth ACM Conference on Computer and Communications Security (CCS-8), pages 28--37, November 2001.
Rushing Attacks and Defense in Wireless Ad Hoc Network.. - Hu, Perrig, Johnson (2003) (7 citations) Self-citation (Perrig) (Correct)
No context found.
Adrian Perrig. The BiBa One-Time Signature and Broadcast Authentication Protocol. In Proceedings of the Eighth ACM Conference on Computer and Communications Security (CCS-8), pages 28--37, Philadelphia PA, USA, November 2001.
Efficient Security Mechanisms for Routing Protocols - Hu, Perrig, Johnson (2003) (8 citations) Self-citation (Perrig) (Correct)
No context found.
Adrian Perrig. The BiBa One-Time Signature and Broadcast Authentication Protocol. In Proceedings of the Eighth ACM Conference on Computer and Communications Security (CCS-8), pages 28--37, November 2001.
Rushing Attacks and Defense in Wireless Ad Hoc Network.. - Hu, Perrig, Johnson (2003) (7 citations) Self-citation (Perrig) (Correct)
No context found.
Adrian Perrig. The BiBa One-Time Signature and Broadcast Authentication Protocol. In Proceedings of the Eighth ACM Conference on Computer and Communications Security (CCS-8), pages 28--37, Philadelphia PA, USA, November 2001.
Bounds and Improvements for BiBa Signature Schemes - Mitzenmacher, Perrig (2002) (2 citations) Self-citation (Perrig) (Correct)
.... and Adrian Perrig TR 02 02 Computer Science Group Harvard University Cambridge, Massachusetts Bounds and Improvements for BiBa Signature Schemes Michael Mitzenmacher and Adrian Perrig Abstract This paper analyzes and improves the recently proposed bins and balls signature (BiBa [23]) a new approach for designing signatures from one way functions without trapdoors. We rst construct a general framework for signature schemes based on the balls and bins paradigm and propose several new related signature algorithms. The framework also allows us to obtain upper bounds on the ....
....1 signatures, and can only sign a xed number of messages per public key. We review the merits and drawbacks of one time signature schemes in Section 7. The recently proposed bins and balls (BiBa) signature is a promising new approach to mitigate some of the drawbacks of one time signatures [23]. We review BiBa in Section 2. In Section 3 we present an abstract framework for these types of signatures, which allows us to present new approaches in Section 4 that are more secure. Our framework also allows us to analyze the security of these signature schemes (see Section 5) we nd that the ....
[Article contains additional citation context not shown here]
A. Perrig. The BiBa one-time signature and broadcast authentication protocol. In Proceedings of the Eighth ACM Conference on Computer and Communications Security (CCS-8), Philadelphia PA, USA, Nov. 2001.
Bridging the Gap: Programming Sensor Networks with.. - Levis, Gay, Culler (2004) (1 citation) (Correct)
No context found.
A. Perrig. The biba one-time signature and broadcast authentication protocol. In ACM Conference on Computer and Communications Security, pages 28--37, 2001.
A Taxonomy of Multicast Data Origin Authentication.. - Challal, Bettahar.. (2004) (Correct)
No context found.
A. Perrig, "The BiBa One-time Signature and Broadcast Authentication Protocol," 8th ACM Conf. Comp. and Commun. Security, Nov. 2001.
On-the-Fly Verification of Rateless Erasure Codes for.. - Krohn, Freedman.. (2004) (2 citations) (Correct)
No context found.
A. Perrig, "The BiBa one-time signature and broadcast authentication protocol," in Proc. 8th ACM Conference on Computer and Communication Security (CCS), Philadelphia, PA, Nov. 2001.
On-the-Fly Verification of Rateless Erasure Codes for.. - Krohn, Freedman.. (2004) (2 citations) (Correct)
No context found.
A. Perrig, "The BiBa one-time signature and broadcast authentication protocol," in Proc. 8th ACM Conference on Computer and Communication Security (CCS), Philadelphia, PA, Nov. 2001.
Bridging the Gap: Programming Sensor Networks with.. - Levis, Gay, Culler (2004) (1 citation) (Correct)
No context found.
A. Perrig. The biba one-time signature and broadcast authentication protocol. In ACM Conference on Computer and Communications Security, pages 28--37, 2001.
Verifying Data Integrity in Peer-to-Peer Media Streaming - Habib, Xu, Atallah.. (2005) (Correct)
No context found.
A. Perrig. The BiBa one-time signature and broadcast authentication protocol. In proc. ACM Conference on Computer and Communications Security (CCS '01), pages 28--37, Philadelphia, PA, Nov 2001.
On-the-Fly Verification of Rateless Erasure Codes for.. - Krohn, Freedman.. (2004) (2 citations) (Correct)
No context found.
A. Perrig, "The BiBa one-time signature and broadcast authentication protocol," in Proc. 8th ACM Conference on Computer and Communication Security (CCS), Philadelphia, PA, Nov. 2001.
Global Intrusion Detection in the DOMINO Overlay System - Yegneswaran, Barford, Jha (2004) (9 citations) (Correct)
No context found.
A. Perrig. The BiBA one-time signature and broadcast authentication protocol. In Proceedings of the 8th ACM Conference November 5-8 2001.
DoS Protection for Reliably Authenticated Broadcast - Gunter, Khanna, Tan, Venkatesh (2003) (Correct)
No context found.
Adrian Perrig. The biba one-time signature and broadcast authentication protocol. In ACM Conference on Computer and Communications Security, pages 28--37, 2001.
Multimedia Security in Group Communications: Recent Progress in .. - Eskicioglu (2003) (4 citations) (Correct)
No context found.
Perrig A (2001) The BiBa One-Time Signature and Broadcast Authentication Protocol. Proceedings of the 8 ACM Conference on Computer and Communications Security, Philadelphia, PA, November 5-8, 2001.
First 50 documents
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC