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
Blockchain-assisted Public-key Encryption with Keyword Search against Keyword Guessing Attacks for Cloud Storage
TL;DR: This paper presents a secure PEKS scheme called SEPSE, where users encrypt keywords with the aid of dedicated key servers via a threshold and oblivious way, and provides a stronger security guarantee compared with existing schemes, at the expense of acceptable computational costs.
Book ChapterDOI
On the Selection of Pairing-Friendly Groups
TL;DR: In this article, a simple algorithm to select group generators suitable for pairing-based cryptosystems was proposed, and the selected parameters are shown to favor implementations of the Tate pairing that are at once conceptually simple and efficient.
Journal ArticleDOI
Identity-based data outsourcing with comprehensive auditing in clouds
TL;DR: Security analysis and experimental evaluation indicate that the proposed identity-based data outsourcing (IBDO) scheme provides strong security with desirable efficiency in securing outsourced data.
Book ChapterDOI
Identity Based Undeniable Signatures
TL;DR: In this article, the authors give an identity based undeniable signature using pairings over elliptic curves, which they extend to the identity based setting the security model for the notions of invisibility and anonymity given by Galbraith and Mao in 2003 and prove that their scheme is existentially unforgeable under the Bilinear Diffie-Hellman assumption in the random oracle model.
Journal ArticleDOI
A comparison of MNT curves and supersingular curves
TL;DR: This paper compares both the security and performance issues related to the choice of MNT curves against supersingular curves in characteristic three, for pairing based systems using the BLS signature scheme and the Boneh–Franklin encryption scheme.
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.