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
Efficient Generic On-Line/Off-Line Signatures Without Key Exposure
TL;DR: This paper introduces a special double-trapdoor hash family based on the discrete logarithm assumption and applies the "hash-sign-switch" paradigm to propose a much more efficient generic on-line/off-line signature scheme.
Journal ArticleDOI
NECPPA: A novel and efficient conditional privacy-preserving authentication scheme for VANET
TL;DR: A new authentication scheme which provides secure communications in VANET is proposed which is a combination of Road Side Unit Based (RSUB) and Tamper Proof Device Based (TPDB) schemes and is much more cost efficient compare to other on-line RSUB schemes.
Journal ArticleDOI
Secure Dynamic Access Control Scheme of PHR in Cloud Computing
TL;DR: A new PHR access control scheme under Cloud computing environments is proposed with Lagrange interpolation polynomial to establish a secure and effective PHR information access scheme, which allows to accurately access to PHR with security and is suitable for enormous multi-users.
Journal ArticleDOI
A blockchain-based certificateless public key signature scheme for vehicle-to-infrastructure communication in VANETs
TL;DR: An efficient Certificateless Public Key Signature (CL-PKS) scheme using bilinear pairing to provide conditional privacy-preserving authentication for Vehicle-To-Infrastructure (V2I) communication in VANETs and includes blockchain to implement revocation transparency of pseudo-identities efficiently before verifying the signatures.
Proceedings ArticleDOI
Towards Multi-user Private Keyword Search for Cloud Computing
TL;DR: This work is motivated to propose a practical multi-user searchable encryption scheme, which has a number of advantages over the known approaches, and to extend the scheme in several ways so as to achieve different search capabilities.
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.