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
An Effective Integrity Check Scheme for Secure Erasure Code-Based Storage Systems
TL;DR: An integrity check scheme for a secure erasure code-based storage system with multiple key servers to enhance data robustness against storage server corruption, which returns tampered ciphertexts is proposed.
Proceedings ArticleDOI
An Efficient Proof of Retrievability with Public Auditing in Cloud Computing
TL;DR: This work proposes a new cloud storage architecture with two independent cloud servers, that is, the cloud storage server and the cloud audit server, where the latter is assumed to be semi-honest, to ensure the integrity of data storage in Cloud Computing.
Journal ArticleDOI
Decentralized Privacy-Preserving Data Aggregation Scheme for Smart Grid Based on Blockchain.
TL;DR: A decentralized privacy-preserving data aggregation (DPPDA) scheme for smart grid based on blockchain that protects user privacy data while achieving decentralization, without relying on TTP or CA.
Book ChapterDOI
Radix-r non-adjacent form
TL;DR: In this paper, a non-adjacent form of radix-r representation (rNAF) and efficient algorithms for generating rNAF were proposed, which is a good alternative to gNAF.
Journal ArticleDOI
An efficient signcryption scheme with key privacy and its extension to ring signcryption
TL;DR: This paper proposes a modification of YWD scheme which resolves the security issues of the original scheme without sacrificing its high efficiency and simple design and shows that the scheme achieves confidentiality, existential unforgeability and anonymity with more precise reduction bounds.
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.