Short signature scheme based on discrete logarithms

Authors:
Zuhua Shao
Affiliations:
Zhejiang University of Science and Technology, Hangzhou, Zhejiang, P. R. of China
Venue:
WAIM'05 Proceedings of the 6th international conference on Advances in Web-Age Information Management
Year:
2005

Citing 5
Cited 1

The Relationship Between Breaking the Diffie--Hellman Protocol and Computing Discrete Logarithms

SIAM Journal on Computing
Short Signatures from the Weil Pairing

ASIACRYPT '01 Proceedings of the 7th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Signing on a Postcard

FC '00 Proceedings of the 4th International Conference on Financial Cryptography
Security proofs for signature schemes

EUROCRYPT'96 Proceedings of the 15th annual international conference on Theory and application of cryptographic techniques
A signature scheme as secure as the Diffie-Hellman problem

EUROCRYPT'03 Proceedings of the 22nd international conference on Theory and applications of cryptographic techniques

A new provably secure certificateless short signature scheme

Computers & Mathematics with Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper proposes a short signature scheme, the security of which is based on the hardness of discrete logarithms. The main advantage of this signature scheme over DSA signature schemes is a one fourth reduction in the signature length, as well as in the verification computation. Moreover, we provide a close reductionist security proof for existential unforgeability under adaptive chosen-message attacks in random oracle model, offering better security guarantees than existing discrete-log based signatures. The new scheme is needed in low-bandwidth communication, low-storage and less computation environments, and is particularly suited for smart card, PDA and mobile phone.