Provably Secure Convertible Undeniable Signatures with Unambiguity.
Le Trieu Phong, Kaoru Kurosawa, Wakaha Ogata · 2009
Abstract. This paper shows some efficient and provably-secure convert-ible undeniable signature schemes (with both selective conversion and all conversion), in the standard model and discrete logarithm setting. They further satisfy unambiguity, which is traditionally required for anony-mous signatures. Briefly, unambiguity means that it is hard to generate a (message, signature) pair which is valid for two different public-keys. In other words, our schemes can be viewed as anonymous signature schemes as well as convertible undeniable signature schemes. Besides other appli-cations, we show that such schemes are very suitable for anonymous auction.