Undeniable and Unpretendable Signatures

Le Trieu PHONG  Kaoru KUROSAWA  Wakaha OGATA  

IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences   Vol.E95-A    No.1    pp.138-150
Publication Date: 2012/01/01
Online ISSN: 1745-1337
DOI: 10.1587/transfun.E95.A.138
Print ISSN: 0916-8508
Type of Manuscript: Special Section PAPER (Special Section on Cryptography and Information Security)
Category: Authentication
anonymity,  undeniable signatures,  selective/all conversion,  unpretendable signatures,  anonymous auction,  

Full Text: PDF(406.7KB)>>
Buy this Article

Undeniable signature, and unpretendable signature schemes have been studied independently. In this paper, efficient schemes which serve as both at the same time are presented. The schemes find their typical application in anonymous auction where the winner cannot deny her bid; nobody can pretend to be the winner; and the anonymity of all losers is preserved. The security of the schemes is proved in the common reference string model under discrete logarithm type assumptions.