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
Posted Content
Efficient Implementation of Tate Pairing on a Mobile Phone using Java.
TL;DR: In this paper, the authors presented an efficient implementation for computing Tate pairing on a mobile phone using Java and compared it with other Java programs of the standard cryptosystems, i.e., RSA and ECC on the same platform.
Proceedings ArticleDOI
DATE: A Decentralized, Anonymous, and Transparent E-voting System
TL;DR: An effective e-voting system is proposed for voters to minimize their trust in the authority or government and ensure the transparency of election by putting all messages on the Ethereum blockchain and the privacy of individual voter is protected via an effective ring signature mechanism.
Journal ArticleDOI
An efficient linkable group signature for payer tracing in anonymous cryptocurrencies
TL;DR: It is proved that the proposed linkable group signature scheme achieves full-anonymity, full-traceability and linkability in the random oracle model and thus, can be adopted in anonymous cryptocurrencies in reality.
Journal ArticleDOI
ID-based threshold decryption secure against adaptive chosen-ciphertext attack
Yu Long,Kefei Chen,Shengli Liu +2 more
TL;DR: An identity-based threshold decryption scheme IB-ThDec is proposed and its security is reduced to the Bilinear Diffie-Hellman problem and the formal proof of security of this scheme is provided in the random oracle model.
Book ChapterDOI
Efficient provably secure restrictive partially blind signatures from bilinear pairings
TL;DR: This paper proposes a new restrictive partially blind signature scheme from bilinear pairings and presents a formal proof of security in the random oracle model and uses the proposed signature scheme to build an untraceable off-line electronic cash system followed Brand's construction.
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.