Summary
Undeniable signature protocols were introduced at Crypto’ 89 [CA]. The present article contains new undeniable signature protocols, and these are the first that are zero-knowledge.
Chapter PDF
Similar content being viewed by others
References
Brassard, G., D. Chaum, and C. Crépeau, “Minimum disclosure proofs of knowledge,” Journal of Computer and System Sciences, vol. 37, 1988, pp. 156–189.
Boyar, J., D. Chaum, I. Damgård, and T. Pedersen, “Convertible undeniable signatures,” to be presented at CRYPTO’ 90.
Chaum, D. and H. van Antwerpen, “Undeniable signatures,” Advances in Cryptology—CRYPTO’ 89, Springer-Verlag, 1990, pp. 212–216.
Diffie, W. and M.E. Hellman, “New directions in cryptography,” IEEE Transactions on Information Theory, Vol. IT-22, 1976, pp. 644–654.
Goldwasser, S., S. Micali, and C. Rackoff, “The knowledge complexity of interactive proof-systems,” Proceedings, 17th Annual ACM Symposium on the Theory of Computing, May 1985,” pp. 291–304.
Pohlig, S. and M.E. Hellman, “An improved algorithm for computing logarithms over GF(p) and its cryptographic significance,” IEEE Transactions on Information Theory, vol. IT-24, 1978, pp. 106–110.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1991 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chaum, D. (1991). Zero-Knowledge Undeniable Signatures (extended abstract). In: Damgård, I.B. (eds) Advances in Cryptology — EUROCRYPT ’90. EUROCRYPT 1990. Lecture Notes in Computer Science, vol 473. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46877-3_41
Download citation
DOI: https://doi.org/10.1007/3-540-46877-3_41
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-53587-4
Online ISBN: 978-3-540-46877-6
eBook Packages: Springer Book Archive