Abstract
In this paper, we will propose an new transitive digital signature scheme, which is generalized realization based on discreted logarithm problem. We also show that our new scheme is proven transitively unforgeable under adaptive chosen-message attack assuming discreted logarithm problem is hard.
Project Supported National Natural Science Foundation of China(No.90104032).
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
S. Micali, R. Rivest, Transitive signature schemes, Topics in Cryptology-CT-RSA’02, Lecture Notes in Computer Scinece Vol. 2271, B. Preneel ed., Springer-Verlag, 2002.
R. Johnson, D. Molnar, D. Song, D. Wagner, Homomorphic signature schemes, Topics in Cryptology-CT-RSA’02, Lecture Notes in Computer Scinece Vol. 2271, B. Preneel ed., Springer-Verlag, 2002.
M. Bellare, G. Neven, Transitive signatures based on factoring and RSA, Advances in Cryptology, Aisacypto’02, Leture Notes in Computer Science Vol.2501, 2002
S. Goldwasser, S. Micali, R. Rivest, A digital signature scheme scure against adaptive chosen-message attacks, SIAM Journal of Computing, Vol.17, No.2, April 1988
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
Li, Z., Zhang, J., Zheng, D. (2004). New Transitive Signature Scheme Based on Discreted 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_15
Download citation
DOI: https://doi.org/10.1007/1-4020-7987-7_15
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4020-7986-3
Online ISBN: 978-1-4020-7987-0
eBook Packages: Springer Book Archive