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
Comments on “Public Integrity Auditing for Dynamic Data Sharing With Multiuser Modification”
TL;DR: A novel integrity auditing scheme for cloud data sharing services characterized by multiuser modification, public auditing, high error detection probability, efficient user revocation as well as practical computational/communication auditing performance is proposed.
Posted Content
Identity-Based Encryption Secure against Selective Opening Attack.
TL;DR: In this article, Boyen-Waters anonymous IBE and Waters' dual-system approach were shown to be secure against selective-opening attacks, and they also proposed a 1-sided public openability (1SPO) property for IBE.
Book ChapterDOI
Separation results on the one-more computational problems
TL;DR: It is very unlikely, that one will ever be able to prove the unforgeability of Chaum's RSA-based blind signature scheme under the sole RSA assumption, and this paper provides separation results for the computational hierarchy of a large class of algebraic "one-more" computational problems.
Journal ArticleDOI
Building Redactable Consortium Blockchain for Industrial Internet-of-Things
Ke Huang,Xiaosong Zhang,Yi Mu,Xiaofen Wang,Guomin Yang,Xiaojiang Du,Fatemeh Rezaeibagha,Qi Xia,Mohsen Guizani +8 more
TL;DR: A redactable consortium blockchain which is efficient for IIoT devices to operate and allows a group of authorized sensors to write and rewrite blockchain without causing any hard forks is built.
Journal ArticleDOI
Refinements of Miller's algorithm for computing the Weil/Tate pairing
TL;DR: Three refinements to Miller's algorithm are given, one of which is especially efficient when the underlying elliptic curve is over a finite field of characteristic three, which is a case of particular cryptographic interest.
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.