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
On the Application of Identity-Based Cryptography in Grid Security
TL;DR: This thesis discusses how this TLS-like identitybased secret public key protocol can be applied to securing interactions between users and credential storage systems, such as MyProxy, within grid environments and introduces new password-based protocols using identity- based secret public keys.
Proceedings ArticleDOI
A secure incentive scheme for delay tolerant networks
TL;DR: This work proposes a secure credit based incentive scheme to stimulate bundle forwarding cooperation among DTNs nodes and introduces several efficiency optimization techniques to improve the overall efficiency by exploiting the unique characteristics of DTNs.
Book ChapterDOI
Skew Frobenius Map and Efficient Scalar Multiplication for Pairing---Based Cryptography
TL;DR: According to the simulation result, a scalar multiplication by the proposed method with multi---exponentiation technique is about 40% faster than that by plain binary method.
Book ChapterDOI
Aggregating CL-Signatures Revisited: Extended Functionality and Better Efficiency
TL;DR: In this article, the authors proposed two aggregate signature schemes based on the Camenisch-Lysyanskaya (CL) signature scheme whose security is reduced to that of CL signature (i.e., secure under the LRSW assumption).
Patent
Use of isogenies for design of cryptosystems
David Jao,Ramarathnam Venkatesan +1 more
TL;DR: In this paper, isogenies of Abelian varieties (e.g., elliptic curves in one-dimensional cases) are utilized to provide public-key encryption systems, and solutions are disclosed for generating the Isogenies.
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.