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
Book ChapterDOI
Practical Fully Secure Unrestricted Inner Product Functional Encryption Modulo p
TL;DR: Abdalla, Bourse, De Caro, and Pointcheval as discussed by the authors proposed adaptive functional encryption (FE) based on Decision Diffie-Hellman (DDH), Learning-with-Errors (LWE), and Paillier's Decision Composite Residuosity (DCR).
Proceedings ArticleDOI
Verifiable Timed Signatures Made Practical
Sri Aravinda Krishnan Thyagarajan,Adithya Bhat,Giulio Malavolta,Nico Döttling,Aniket Kate,Dominique Schröder +5 more
TL;DR: This work formalizes VTS, presents efficient constructions compatible with BLS, Schnorr, and ECDSA signatures, and experimentally demonstrates that these constructions can be employed in practice, and designs an efficient cut-and-choose protocol based on the homomorphic time-lock puzzles to prove the validity of a signature encapsulated in a time-locks.
Book ChapterDOI
History-Free sequential aggregate signatures
TL;DR: A construction based on the BLS signature scheme which satisfies the notion of history-free sequential aggregation for signatures where the new aggregate does not rely on the previous messages and public keys either, thus inhibiting the costly verifications in each aggregation step.
Journal ArticleDOI
PSRide: Privacy-Preserving Shared Ride Matching for Online Ride Hailing Systems
TL;DR: The privacy leakage of online ridesharing matching is studied, a more complex and economy ORH service that allows riders to share rides with others, and a privacy-preserving shared ride matching scheme, called PSRide, which is implemented and analyzed thoroughly.
Journal ArticleDOI
Designated-Verifier Provable Data Possession in Public Cloud Storage
TL;DR: This paper proposes designated verifier provable data possession (DV-PDP), a scheme that removed expensive bilinear computing from public clouds and is provable secure and high efficiency.
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.