Convertible Undeniable Signatures

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.

[1]  Moti Yung,et al.  Direct Minimum-Knowledge Computations , 1987, CRYPTO.

[2]  S. Micali,et al.  How To Construct Randolli Functions , 1984, FOCS 1984.

[3]  David Chaum,et al.  Undeniable Signatures , 1989, CRYPTO.

[4]  Russell Impagliazzo,et al.  One-way functions are essential for complexity based cryptography , 1989, 30th Annual Symposium on Foundations of Computer Science.

[5]  Silvio Micali,et al.  A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks , 1988, SIAM J. Comput..

[6]  John Rompel,et al.  One-way functions are necessary and sufficient for secure signatures , 1990, STOC '90.

[7]  David Chaum,et al.  An Improved Protocol for Demonstrating Possession of Discrete Logarithms and Some Generalizations , 1987, EUROCRYPT.

[8]  Leonid A. Levin,et al.  Pseudo-random generation from one-way functions , 1989, STOC '89.

[9]  Moni Naor,et al.  Bit Commitment Using Pseudo-Randomness , 1989, CRYPTO.

[10]  T. Elgamal.  A public key cryptosystem and a signature scheme based on discrete logarithms , 1984, CRYPTO 1984.

[11]  Taher ElGamal,et al.  A public key cyryptosystem and signature scheme based on discrete logarithms , 1985 .

[12]  Leonid A. Levin,et al.  A hard-core predicate for all one-way functions , 1989, STOC '89.

[13]  David Chaum,et al.  Minimum Disclosure Proofs of Knowledge , 1988, J. Comput. Syst. Sci..

[14]  Silvio Micali,et al.  Proofs that yield nothing but their validity and a methodology of cryptographic protocol design , 1986, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).

[15]  Silvio Micali,et al.  How to construct random functions , 1986, JACM.

[16]  David Chaum,et al.  Zero-Knowledge Undeniable Signatures , 1991, EUROCRYPT.