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
Posted Content
Efficient Algorithms for Pairing-Based Cryptosystems.
TL;DR: In this paper, fast new algorithms for scalar multiplication in characteristic 3 and square root extraction over Fpm were proposed, with the latter technique being also useful in contexts other than pairing-based cryptography.
Journal ArticleDOI
Recent Advances and Challenges in Security and Privacy for V2X Communications
TL;DR: A comprehensive survey on the state-of-the-art solutions concerning security and privacy for V2X communications and compares general solutions in preserving identity privacy and location privacy is presented.
Dissertation
Efficient implementations of attribute-based credentials on smart cards
TL;DR: The goal of the research presented in this thesis has been to develop efficient smart card implementations of attribute- based credentials and compare various cryptographic systems for attribute-based credentials.
DissertationDOI
Resilient In-Network Aggregation for Vehicular Networks
TL;DR: A generic mechanism combination and adaptation framework is proposed, which uses each mechanism in the situations for which it is most suitable, avoiding drawbacks of individual mechanisms in other traffic situations.
Proceedings ArticleDOI
Certificate-based sequential aggregate signature
TL;DR: This paper provides a concrete construction of this new notion called Certificate-Based Sequential Aggregate Signature and proves its security in the random oracle model.
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.