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
BookDOI
Security in RFID and Sensor Networks
Yan Zhang,Paris Kitsos +1 more
TL;DR: The book begins with a discussion of current security issues that threaten the effective use of RFID technology, then shifts the focus to WSNs, beginning with a background in sensor network security before moving on to survey intrusion detection, malicious node detection, jamming, and other issues of concern to W SNs and their myriad of applications.
Journal ArticleDOI
An ID-based aggregate signature scheme with constant pairing computations
TL;DR: This paper proposes an efficient ID-based aggregate signature scheme with constant pairing computations and gives its security proof in the random oracle model under the Computational Diffie-Hellman assumption.
Proceedings ArticleDOI
Practical forward secure sequential aggregate signatures
TL;DR: Two more practical FssAgg1 signature schemes are proposed, derived from existing forward secure signature schemes, that have constant-size public and private keys, constant- size signatures as well as constant-time key update and signature generation complexity.
Journal ArticleDOI
Remote Data Checking With a Designated Verifier in Cloud Storage
Hao Yan,Jiguo Li,Yichen Zhang +2 more
TL;DR: A new RDPC scheme with the designated verifier, in which the data owner specifies a unique verifier to check the data integrity, which has less communication, storage, and computation overhead while achieving high error detection probability.
Journal ArticleDOI
A novel multi-server remote user authentication scheme using self-certified public keys for mobile clients
Yi-Pin Liao,Chih-Ming Hsiao +1 more
TL;DR: It is shown that Tseng et al.'s scheme cannot withstand an insider attack, offline dictionary attack and malicious server attack, and security analysis shows that the proposed scheme can withstand various possible attacks resulting from the multi-server environment.
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.