Short Signatures from the Weil Pairing
Dan Boneh,Ben Lynn,Hovav Shacham +2 more
- pp 514-532
TLDR
A short signature scheme based on the Computational Diffie-Hellman assumption on certain elliptic and hyperelliptic curves is introduced, designed for systems where signatures are typed in by a human or signatures are sent over a low-bandwidth channel.Abstract:
We introduce a short signature scheme based on the Computational Diffie-Hellman assumption on certain elliptic and hyperelliptic curves. The signature length is half the size of a DSA signature for a similar level of security. Our short signature scheme is designed for systems where signatures are typed in by a human or signatures are sent over a low-bandwidth channel.read more
Citations
More filters
Journal ArticleDOI
SPECS: Secure and privacy enhancing communications schemes for VANETs
TL;DR: This paper provides a software-based solution which makes use of only two shared secrets to satisfy the privacy requirement and gives lower message overhead and at least 45% higher successful rate than previous solutions in the message verification phase using the bloom filter and the binary search techniques.
Journal ArticleDOI
Pi: A practical incentive protocol for delay tolerant networks
TL;DR: The proposed Pi protocol is a practical incentive protocol, called Pi, such that when a source node sends a bundle message, it also attaches some incentive on the bundle, which is not only attractive but also fair to all participating DTN nodes.
Journal Article
Certificateless public-key signature : Security model and efficient construction
TL;DR: This paper first presents a security model for certificateless public-key signature schemes, and then proposes an efficient construction based on bilinear pairings that can be proved to be equivalent to the computational Diffie-Hellman problem in the random oracle model with a tight reduction.
Proceedings Article
CONIKS: bringing key transparency to end users
TL;DR: CONIKS builds on transparency log proposals for web server certificates but solves several new challenges specific to key verification for end users, and obviates the need for global third-party monitors and enables users to efficiently monitor their own key bindings for consistency.
Proceedings ArticleDOI
Keeping Authorities "Honest or Bust" with Decentralized Witness Cosigning
Ewa Syta,Iulia Tamas,Dylan Visher,David Isaac Wolinsky,Philipp Jovanovic,Linus Gasser,Nicolas Gailly,Ismail Khoffi,Bryan Ford +8 more
TL;DR: CoSi, a scalable witness cosigning protocol ensuring that every authoritative statement is validated and publicly logged by a diverse group of witnesses before any client will accept it, is introduced, offering the first transparency mechanism effective against persistent man-in-the-middle attackers.
References
More filters
Book
Handbook of Applied Cryptography
TL;DR: A valuable reference for the novice as well as for the expert who needs a wider scope of coverage within the area of cryptography, this book provides easy and rapid access of information and includes more than 200 algorithms and protocols.
Proceedings ArticleDOI
Random oracles are practical: a paradigm for designing efficient protocols
Mihir Bellare,Phillip Rogaway +1 more
TL;DR: It is argued that the random oracles model—where all parties have access to a public random oracle—provides a bridge between cryptographic theory and cryptographic practice, and yields protocols much more efficient than standard ones while retaining many of the advantages of provable security.
Journal ArticleDOI
Identity-Based Encryption from the Weil Pairing
Dan Boneh,Matthew K. Franklin +1 more
TL;DR: This work proposes a fully functional identity-based encryption (IBE) scheme based on bilinear maps between groups and gives precise definitions for secure IBE schemes and gives several applications for such systems.
Book
The Arithmetic of Elliptic Curves
TL;DR: It is shown here how Elliptic Curves over Finite Fields, Local Fields, and Global Fields affect the geometry of the elliptic curves.
Journal ArticleDOI
A digital signature scheme secure against adaptive chosen-message attacks
TL;DR: A digital signature scheme based on the computational difficulty of integer factorization possesses the novel property of being robust against an adaptive chosen-message attack: an adversary who receives signatures for messages of his choice cannot later forge the signature of even a single additional message.