Undeniable confirmer signature

Khanh Nguyen, Yi Mu, Vijay Varadharajan

Research output: Chapter in Book/Report/Conference proceedingChapterpeer-review

8 Citations (Scopus)


In undeniable signature, a signature can only be verified with cooperation of the signer. If the signer refuses to cooperate, it is infea-sible to check the validity of a signature. This problem is eliminated in confirmer signature schemes where the verification capacity is given to a confirmer rather than the signer. In this paper, we present a variation of confirmer signature, called undeniable confirmer signature in that both the signer and a confirmer can verify the validity of a signature. The scheme provides a better flexibility for the signer and the user as well as reduces the involvement of designated confirmers, who are usually trusted in practice. Furthermore, we show that our scheme is divertible, i.e., our signature can be blindly issued. This is essential in some applications such as subscription payment system, which is also shown.

Original languageEnglish
Title of host publicationInformation Security
Subtitle of host publicationSecond International Workshop, ISW’99 Kuala Lumpur, Malaysia, November 6-7, 1999 Proceedings
EditorsMasahiro Mambo, Yuliang Zheng
Place of PublicationBerlin
PublisherSpringer, Springer Nature
Number of pages12
ISBN (Electronic)9783540477907
ISBN (Print)9783540666950
Publication statusPublished - 1999
Externally publishedYes
Event2nd International Information Security Workshop, ISW 1999 - Kuala Lumpur, Malaysia
Duration: 6 Nov 19997 Nov 1999

Publication series

NameLecture Notes in Computer Science
PublisherSpringer Berlin Heidelberg
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Other2nd International Information Security Workshop, ISW 1999
CityKuala Lumpur


Dive into the research topics of 'Undeniable confirmer signature'. Together they form a unique fingerprint.

Cite this