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
Public Integrity Auditing for Dynamic Data Sharing With Multiuser Modification
Jiawei Yuan,Shucheng Yu +1 more
TL;DR: A novel integrity auditing scheme for cloud data sharing services characterized by multiuser modification, public auditing, high error detection probability, efficient user revocation as well as practical computational/communication auditing performance is proposed.
Journal ArticleDOI
Secure sharing and searching for real-time video data in mobile cloud
TL;DR: The proposed infrastructure takes the advantages of the cloud platform and 5G technology to achieve its goals, where mobile users can share their real-time video with their friends or families through the cloud while any other user without permission cannot get any information about the video.
Journal ArticleDOI
SCLPV: Secure Certificateless Public Verification for Cloud-Based Cyber-Physical-Social Systems Against Malicious Auditors
TL;DR: The SCLPV is the first work that simultaneously supports certificateless public verification and resistance against malicious auditors to verify the integrity of outsourced data in CPSS and a formal security proof proves the correctness and security of the scheme.
Book ChapterDOI
RKA security beyond the linear barrier: IBE, encryption and signatures
TL;DR: The first constructions of RKA-secure IBE schemes that are RKA secure for sets consisting of all affine functions and all polynomial functions of bounded degree are obtained.
Proceedings ArticleDOI
Endorsed E-Cash
TL;DR: The usefulness of endorsed e-cash is demonstrated by exhibiting simple and efficient solutions to two important problems: (1) optimistic and unlinkable fair exchange of e- cash for digital goods and services; and (2) onion routing with incentives and accountability for the routers.
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.