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
Towards Secure Data Distribution Systems in Mobile Cloud Computing
TL;DR: This paper uses several cryptographic primitives such as a new type-based proxy re-encryption to design a secure and efficient data distribution system in MCC, which provides data privacy, data integrity, data authentication, and flexible data distribution with access control.
Book ChapterDOI
Sequential Aggregate Signatures with Short Public Keys: Design, Analysis and Implementation Studies
TL;DR: The first sequential aggregate signature scheme with short public keys with a constant number of group elements in prime order (asymmetric) bilinear groups which is secure under static assumptions in the standard model is proposed.
Journal ArticleDOI
Secure bidirectional proxy re-encryption for cryptographic cloud storage
TL;DR: This paper proposes a new bidirectional proxy re-encryption scheme that holds the following properties: (1) constant ciphertext size no matter how many times the transformation is performed; (2) master secret security in the random oracle model, i.e., Alice (resp. Bob) colluding with the proxy cannot obtain Bob's private key; (3) replayable chosen ciphertext (RCCA) security inThe random oracles model.
Book ChapterDOI
Construction of universal designated-verifier signatures and identity-based signatures from standard signatures
TL;DR: A generic construction for universal designated-verifier signature schemes from a large class, C, of signature schemes, which are efficient and have two important properties: provably DV-unforgeable, non-transferable and also non-delegatable.
Journal Article
Publicly Verifiable Secret Sharing Schemes Using Bilinear Pairings.
TL;DR: A distributive publicly veriflable secret sharing (DPVSS) is proposed, which also reduces the overhead of communication and is more secure and efiective than others, and it can be more applicable in special situation.
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.