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
Cryptography in radio frequency identification and fair exchange protocols
TL;DR: This PhD thesis focuses on fair exchange protocols and radio frequency identification protocols, and proposes two approaches to overcome this problem by attaching to each person, a guardian angel, that is, a security module conceived by a trustworthy authority and whose behavior cannot deviate from the established rules.
Book ChapterDOI
ID-Based proxy signature using bilinear pairings
TL;DR: In this paper, the authors formalize a notion of security for ID-based proxy signature schemes and propose a scheme based on the bilinear pairings, which is tightly related to the computational Diffie-Hellman assumption in the random oracle model.
Journal ArticleDOI
Programmable Hash Functions and Their Applications
Dennis Hofheinz,Eike Kiltz +1 more
TL;DR: This work introduces a new combinatorial primitive called programmable hash functions (PHFs), which can be used to program the output of a hash function such that it contains solved or unsolved discrete logarithm instances with a certain probability.
Proceedings ArticleDOI
A Privacy-Preserving Scheme for Online Social Networks with Efficient Revocation
TL;DR: A privacy-preserving scheme for data sharing in OSNs, with efficient revocation for deterring a contact's access right to the private data once the contact is removed from the social group is proposed.
Book ChapterDOI
Hardware Implementation of Finite Fields of Characteristic Three
Daniel Page,Nigel P. Smart +1 more
TL;DR: A hardware oriented representation of the field elements is examined, comparing the resulting algorithms for field addition and multiplication operations, and it is shown that characteristic three arithmetic need not significantly under-perform comparable characteristic two alternatives.
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.