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
CanDID: Can-Do Decentralized Identity with Legacy Compatibility, Sybil-Resistance, and Accountability.
Deepak Maram,Harjasleen Malvai,Fan Zhang,Nerla Jean-Louis,Alexander Frolov,Tyler Kell,Tyrone Lobban,Christine Moy,Ari Juels,Andrew Miller +9 more
TL;DR: CanDID provides strong confidentiality for user’s keys, real-world identities, and data, yet prevents users from spawning multiple identities and allows identification (and blacklisting) of sanctioned users.
Posted Content
Indifferentiable Deterministic Hashing to Elliptic and Hyperelliptic Curves.
Reza Rezaeian Farashahi,Pierre-Alain Fouque,Igor E. Shparlinski,Mehdi Tibouchi,José Felipe Voloch +4 more
TL;DR: Brier et al. as mentioned in this paper presented a new technique based on bounds of character sums to prove the indifferentiability of similar hash function constructions based on essentially any deterministic encoding to elliptic curves or curves of higher genus.
Proceedings ArticleDOI
An efficient identity-based signature scheme with batch verifications
Shi Cui,Pu Duan,Choong Wah Chan +2 more
TL;DR: A new identity-based signature (IBS) scheme without MapToPoint function which speeds up extracting secret key and verifying the signatures and shows that batch verifications on the proposed IBS scheme is much faster than other IBS schemes.
Proceedings ArticleDOI
A dynamic Proof of Retrievability (PoR) scheme with O(logn) complexity
Zhen Mo,Yian Zhou,Shigang Chen +2 more
TL;DR: A new version of authenticated data structure based on a B+ tree and a merkle hash tree is developed and a dynamic version of PoR scheme is proposed, which can be extended to dynamic scenario and its worst case communication complexity is O(logn) instead of O(n).
Posted Content
On Software Parallel Implementation of Cryptographic Pairings.
TL;DR: In this article, the authors focus on parallelism within one pairing evaluation (intra-pairing) and parallelism between different pairing evaluations (inter-) and show that it is possible to accelerate pairing evaluation by a significant factor in comparison to a naive approach.
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.