Abstract
We introduce a new concept called convertible undeniable signature schemes. In these schemes, release of a single bit string by the signer turns all of his signatures, which were originally undeniable signatures, into ordinary digital signatures. We prove that the existence of such schemes is implied by the existence of digital signature schemes. Then, looking at the problem more practically, we present a very efficient convertible undeniable signature scheme. This scheme has the added benefit that signatures can also be selectively converted.
Supported in part by the ESPRIT II Basic Research Actions Program of the EC under contract No. 3075 (Project ALCOM).
Chapter PDF
References
Gilles Brassard, David Chaum, and Claude Crépeau. Minimum disclosure proofs of knowledge. Journal of Computer and System Sciences, 37:156–189, 1988.
Jørgen Brandt, Ivan Damgård, Peter Landrock, and Torben Pedersen. Zero-knowledge authentication scheme with secret key exchange. Submitted to Journal of Cryptology, 1989.
David Chaum, Jan-Hendrik Evertse, and Jeroen van de Graaf. An improved protocol for demonstrating possession of discrete logarithms and some generalizations. In Advances in Cryptology — proceedings of EURO-CRYPT 87, Lecture Notes in Computer Science. Springer-Verlag, 1988.
David Chaum. Zero-knowledge undeniable signatures. To appear in the proceedings of EUROCRYPT’90, 1990.
David Chaum and Hans van Antwerpen. Undeniable signatures. In Advances in Cryptology-proceedings of CRYPTO 89, Lecture Notes in Computer Science. Springer Verlag, 1990.
Taher El Gamal. A public key cryptosystem and a signatures scheme based on discrete logarithms. In Advances in Cryptology-proceedings of CRYPTO 84, Lecture Notes in Computer Science. Springer-Verlag, 1985.
Oded Goldreich, Shafi Goldwasser, and Silvio Micali. How to construct random functions. In Proceedings of the 25th IEEE Symposium on the Foundations of Computer Science, 1984.
Oded Goldreich and Leonid A. Levin. A hard-core predicate for all one-way functions. In Proceedings of the 21st Annual ACM Symposium on the Theory of Computing, 1989.
S. Goldwasser, S. Micali, and R. L. Rivest. A digital signature scheme secure against adaptive chosen message attack. SIAM Journal on Computing, 17(2):281–308, April 1988.
Oded Goldreich, Silvio Micali, and Avi Wigderson. Proofs that yield nothing but their validity and a methodology of cryptographic protocol design. In Proceedings of the 27th IEEE Symposium on the Foundations of Computer Science, pages 174–187, 1986.
Russel Impagliazzo and Michael Luby. One-way functions are essential for complexity based cryptography. In Proceedings of the 28th IEEE Symposium on the Foundations of Computer Science, 1989.
Russell Impagliazzo, Leonid A. Levin, and Michael Luby. Pseudo-random generation from one-way functions. In Proceedings of the 21st Annual ACM Symposium on the Theory of Computing, 1989.
Russel Impagliazzo and Moti Yung. Direct minimum-knowledge computations. In Advances in Cryptology — proceedings of CRYPTO 87, Lecture Notes in Computer Science, pages 40–51. Springer-Verlag, 1988.
S. Micali, August 1990. Personal communication.
Moni Naor. Bit commitment using randomness. In Advances in Cryptology — proceedings of CRYPTO 89, Lecture Notes in Computer Science, pages 128–136, 1990.
John Rompel. One-way functions are necessary and sufficient for secure signatures. In Proceedings of the 22nd Annual ACM Symposium on the Theory of Computing, 1990.
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
Boyar, J., Chaum, D., Damgård, I., Pedersen, T. (1991). Convertible Undeniable Signatures. In: Menezes, A.J., Vanstone, S.A. (eds) Advances in Cryptology-CRYPTO’ 90. CRYPTO 1990. Lecture Notes in Computer Science, vol 537. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-38424-3_14
Download citation
DOI: https://doi.org/10.1007/3-540-38424-3_14
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-54508-8
Online ISBN: 978-3-540-38424-3
eBook Packages: Springer Book Archive