Paper 2009/394
Provably Secure Convertible Undeniable Signatures with Unambiguity
Le Trieu Phong, 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.
Metadata
- Available format(s)
-
PDF
- Category
- Public-key cryptography
- Publication info
- Published elsewhere. Full version of a paper accepted to SCN 2010
- Keywords
- Undeniable signatureselectiveall conversiondiscrete logarithmstandard model.
- Contact author(s)
- letrieu letrieuphong @ gmail com
- History
- 2010-06-14: last of 2 revisions
- 2009-08-15: received
- See all versions
- Short URL
- https://ia.cr/2009/394
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2009/394,
author = {Le Trieu Phong and Kaoru Kurosawa and Wakaha Ogata},
title = {Provably Secure Convertible Undeniable Signatures with Unambiguity},
howpublished = {Cryptology {ePrint} Archive, Paper 2009/394},
year = {2009},
url = {https://eprint.iacr.org/2009/394}
}