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
Proceedings ArticleDOI
An improved dynamic provable data possession model
Feifei Liu,Dawu Gu,Haining Lu +2 more
TL;DR: An improved dynamic provable data possession model is proposed which reduces the computational and communication complexity from logn to constant and although client needs to store some secret values which may create some additional storage expense, it only takes up about 0.02% of the original file size.
Journal IssueDOI
Adaptive secure multicast in wireless networks
Yiliang Han,Xiaolin Gui +1 more
TL;DR: Analysis shows that MGSC-GDH is a semantic secure multi-recipient generalized signcryption scheme and more efficient than other similar schemes in computational and communicational aspects.
Journal ArticleDOI
Multiauthority Access Control With Anonymous Authentication for Personal Health Record
Leyou Zhang,Yadi Ye,Yi Mu +2 more
TL;DR: A patient-centric PHR sharing framework is proposed, in which all PHRs are protected with multiauthority attribute-based encryption before outsourcing, which solves the key hosting problem and achieves fine-grained access control to PHRs.
Journal ArticleDOI
Secure and Privacy-Preserving Body Sensor Data Collection and Query Scheme.
Hui Zhu,Gao Lijuan,Hui Li +2 more
TL;DR: This paper focuses on the threats from telemetry interface and presents a secure and privacy-preserving body sensor data collection and query scheme, named SPCQ, for outsourced computing, and proposes a special weighted Euclidean distance contrast algorithm (WEDC) for multi-dimension vectors over encrypted data.
Book ChapterDOI
Multisignatures as Secure as the Diffie-Hellman Problem in the Plain Public-Key Model
TL;DR: This paper presents two new multisignature schemes that have efficient signature verification, they are provably secure in the plain public-key model, and their security is tightly related to the computation and decisional Diffie-Hellman problems in the random oracle model.
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.