Abstract
Both the Schnorr digital signature scheme and the Okamoto digital scheme are important digital signature schemes, they are constructed based on the discrete logarithm problems. On the bases of these two digital signature schemes, two new digital signature schemes are constructed in this paper. For the second digital signature scheme, its blind digital signature scheme is given also.
This work was supported by NSFC under grant #90104005 and #60273049
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
C. P. Schnorr, Efficient signature generation by smart cards, Journal of Cryptology, 1991, Vol.4, No.3, pp.161–174.
T. Okamoto, Provably secure and practical identification schemes and corresponding signatures schemes, Advances in Cryptology-Crypto’92, Lecture notes in computer science, Vol.740, Springer-Verlag, 1993, pp.31–53.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Kluwer Academic Publishers
About this chapter
Cite this chapter
Du, WZ., Chen, K. (2004). Construction of Digital Signature Schemes Based on Discrete Logarithm Problem. In: Chen, K. (eds) Progress on Cryptography. The International Series in Engineering and Computer Science, vol 769. Springer, Boston, MA. https://doi.org/10.1007/1-4020-7987-7_9
Download citation
DOI: https://doi.org/10.1007/1-4020-7987-7_9
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4020-7986-3
Online ISBN: 978-1-4020-7987-0
eBook Packages: Springer Book Archive