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
A Privacy-Preserving Remote Data Integrity Checking Protocol with Data Dynamics and Public Verifiability
Zhuo Hao,Sheng Zhong,Nenghai Yu +2 more
TL;DR: This paper adapts Sebé et al.'s protocol to support public verifiability and shows the correctness and security of the protocol, and demonstrates that the proposed protocol has a good performance.
Book ChapterDOI
The Weil and Tate Pairings as Building Blocks for Public Key Cryptosystems
TL;DR: Elliptic curves were first proposed as a tool for cryptography by V. Miller in 1985 and nicely fit as a replacement for more traditional groups in discrete logarithm based systems such as Diffie-Hellman or ElGamal.
Journal ArticleDOI
Panda: Public Auditing for Shared Data with Efficient User Revocation in the Cloud
Boyang Wang,Baochun Li,Hui Li +2 more
TL;DR: A novel public auditing mechanism for the integrity of shared data with efficient user revocation in mind is proposed, which allows the cloud to re-sign blocks on behalf of existing users during user revocation, so that existing users do not need to download and re-signed blocks by themselves.
Journal ArticleDOI
Verifiable Computation over Large Database with Incremental Updates
TL;DR: A general Inc-VDB framework is proposed by incorporating the primitive of vector commitment and the encrypt-then-incremental MAC mode of encryption and it is proved that the construction can achieve the desired security properties.
Posted Content
Pairing-Based Cryptography at High Security Levels.
Neal Koblitz,Alfred Menezes +1 more
TL;DR: This paper examines the implications of heightened security needs for pairing-based cryptosystems and describes three different reasons why high-security users might have concerns about the long-term viability of these systems.
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.