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
Book ChapterDOI
A secure signature scheme from bilinear maps
TL;DR: In this article, the authors suggest that anonymity is the most relevant security property for undeniable and confirmer signatures and give a precise definition of anonymity for the multi-user setting and show that anonymity can be achieved even when the parties use completely different cryptographic primitives.
Journal ArticleDOI
On computable isomorphisms in efficient asymmetric pairing-based systems
TL;DR: A new model for the elliptic curve groups used in asymmetric pairings is presented, which allows both an efficient pairing and an efficiently computable isomorphism.
Journal Article
FPGA Implementations of Pairing using Residue Number System and Lazy Reduction
Ray C. C. Cheung,Sylvain Duquesne,Junfeng Fan,Nicolas Guillermin,Ingrid Verbauwhede,Gavin Xiaoxu Yao +5 more
TL;DR: This paper presents two FPGA-based high speed pairing designs using the Residue Number System and lazy reduction, and shows that by combining RNS, which is naturally suitable for parallel architectures, and lazy Reduction, the speed of pairing computation in hardware can be largely increased.
Book ChapterDOI
Identity-based proxy signature from pairings
TL;DR: This paper redefines the security models of identity based proxy signature to capture the most stringent attacks against adaptively chosen message and chosen identity attacker and proposes a new provably secure identity basad proxy signature scheme whose security is based on the hardness of Computational Diffie-Hellman problem in the random oracle model.
Journal ArticleDOI
Survey on securing data storage in the cloud
TL;DR: An in-depth survey on recent research activities of cloud storage security in association with cloud computing, focusing on the key security requirement triad, i.e., data integrity, data confidentiality, and availability.
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.