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
Seven Years of Software Vulnerabilities: The Ebb and Flow
TL;DR: A seven-year study using National Vulnerability Database records determined which software vulnerabilities were the most common and most severe but also which ones should be prevented first to gain maximum benefit.
Posted Content
Computing (l, l)-isogenies in polynomial time on Jacobians of genus 2 curves.
Romain Cosset,Damien Robert +1 more
TL;DR: This paper compute l-isogenies between abelian varieties over a field of characteristic different from 2 in polynomial time in l, when l is an odd prime which is coprime to the characteristic.
Posted Content
Group Testing and Batch Verification.
TL;DR: In this paper, the authors present and compare new sequential and parallel algorithms for finding invalid signatures based on group testing algorithms and show improved performance for many parameter choices, and the performance gains are especially notable when multiple processors are available.
Posted Content
On the Minimal Embedding Field.
TL;DR: In this article, the authors discuss the underlying mathematics that causes the embedding degree of a curve of any genus to not necessarily correspond to the minimal embedding field, and hence why it may fail to capture the security of a pairing-based cryptosystem.
Book
New Paradigms in Signature Schemes
Dan Boneh,Hovav Shacham +1 more
TL;DR: This work considers variants and extensions of the BBS group signature scheme, including a group signature with a novel revocation mechanism that is called verifier-local revocation (VLR), which has signatures even shorter than in BBS.
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.