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.
Mendeley helps you to discover research relevant for your work.
CITATION STYLE
Boyar, J., Chaum, D., Damgård, I., & Pedersen, T. (1991). Convertible undeniable signatures. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 537 LNCS, pp. 189–205). Springer Verlag. https://doi.org/10.1007/3-540-38424-3_14