Open AccessConvertible Undeniable Signatures
Author(s) -
Joan Boyar,
David Chaum,
Ivan Damgård,
Torben Pedersen
Publication year - 1990
Publication title -
daimi pb
Language(s) - English
Resource type - Journals
eISSN - 2245-9316
pISSN - 0105-8517
DOI - 10.7146/dpb.v19i330.6719
Subject(s) - convertible , digital signature , signature (topology) , computer science , scheme (mathematics) , computer security , mathematics , theoretical computer science , algorithm , physics , hash function , mathematical analysis , geometry , thermodynamics
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.