Cryptology ePrint Archive: Report 2009/394

Provably Secure Convertible Undeniable Signatures with Unambiguity

Le Trieu Phong and Kaoru Kurosawa and Wakaha Ogata

Abstract: This paper shows some efficient and provably-secure convertible 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 anonymous signatures. Briefly, unambiguity means that it is hard to generate a (message, signature) pair which is valid for two {\em different} public-keys. In other words, our schemes can be viewed as anonymous signature schemes as well as convertible undeniable signature schemes. Besides other applications, we show that such schemes are very suitable for anonymous auction.

Category / Keywords: public-key cryptography / Undeniable signature, selective/all conversion, discrete logarithm, standard model.

Publication Info: Full version of a paper accepted to SCN 2010

Date: received 12 Aug 2009, last revised 13 Jun 2010

Contact author: letrieu letrieuphong at gmail com

Available format(s): PDF | BibTeX Citation

Version: 20100614:053845 (All versions of this report)

Discussion forum: Show discussion | Start new discussion


[ Cryptology ePrint archive ]