Short signature scheme based on discrete logarithms

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. © Springer-Verlag Berlin Heidelberg 2005.