Undeniable confirmer signature

Khanh Nguyen; Yi Mu; Vijay Varadharajan

doi:10.1007/3-540-47790-X_20

Undeniable confirmer signature

Khanh Nguyen, Yi Mu, Vijay Varadharajan

Research output: Chapter in Book/Report/Conference proceeding › Chapter › peer-review

8 Citations (Scopus)

Abstract

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 language	English
Title of host publication	Information Security
Subtitle of host publication	Second International Workshop, ISW’99 Kuala Lumpur, Malaysia, November 6-7, 1999 Proceedings
Editors	Masahiro Mambo, Yuliang Zheng
Place of Publication	Berlin
Publisher	Springer, Springer Nature
Pages	235-246
Number of pages	12
ISBN (Electronic)	9783540477907
ISBN (Print)	9783540666950
DOIs	https://doi.org/10.1007/3-540-47790-X_20
Publication status	Published - 1999
Externally published	Yes
Event	2nd International Information Security Workshop, ISW 1999 - Kuala Lumpur, Malaysia Duration: 6 Nov 1999 → 7 Nov 1999

Publication series

Name	Lecture Notes in Computer Science
Publisher	Springer Berlin Heidelberg
Volume	1729
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Other

Other	2nd International Information Security Workshop, ISW 1999
Country/Territory	Malaysia
City	Kuala Lumpur
Period	6/11/99 → 7/11/99

Access to Document

10.1007/3-540-47790-X_20

Cite this

@inbook{9242cb5350c44af8a23339212d05cef8,

title = "Undeniable confirmer signature",

abstract = "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.",

author = "Khanh Nguyen and Yi Mu and Vijay Varadharajan",

year = "1999",

doi = "10.1007/3-540-47790-X_20",

language = "English",

isbn = "9783540666950",

series = "Lecture Notes in Computer Science",

publisher = "Springer, Springer Nature",

pages = "235--246",

editor = "Masahiro Mambo and Yuliang Zheng",

booktitle = "Information Security",

address = "United States",

note = "2nd International Information Security Workshop, ISW 1999 ; Conference date: 06-11-1999 Through 07-11-1999",

}

Nguyen, K, Mu, Y & Varadharajan, V 1999, Undeniable confirmer signature. in M Mambo & Y Zheng (eds), Information Security: Second International Workshop, ISW’99 Kuala Lumpur, Malaysia, November 6-7, 1999 Proceedings. Lecture Notes in Computer Science, vol. 1729, Springer, Springer Nature, Berlin, pp. 235-246, 2nd International Information Security Workshop, ISW 1999, Kuala Lumpur, Malaysia, 6/11/99. https://doi.org/10.1007/3-540-47790-X_20

Undeniable confirmer signature. / Nguyen, Khanh; Mu, Yi; Varadharajan, Vijay.
Information Security: Second International Workshop, ISW’99 Kuala Lumpur, Malaysia, November 6-7, 1999 Proceedings. ed. / Masahiro Mambo; Yuliang Zheng. Berlin: Springer, Springer Nature, 1999. p. 235-246 (Lecture Notes in Computer Science; Vol. 1729).

Research output: Chapter in Book/Report/Conference proceeding › Chapter › peer-review

TY - CHAP

T1 - Undeniable confirmer signature

AU - Nguyen, Khanh

AU - Mu, Yi

AU - Varadharajan, Vijay

PY - 1999

Y1 - 1999

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=84948130279&partnerID=8YFLogxK

U2 - 10.1007/3-540-47790-X_20

DO - 10.1007/3-540-47790-X_20

M3 - Chapter

AN - SCOPUS:84948130279

SN - 9783540666950

T3 - Lecture Notes in Computer Science

SP - 235

EP - 246

BT - Information Security

A2 - Mambo, Masahiro

A2 - Zheng, Yuliang

PB - Springer, Springer Nature

CY - Berlin

T2 - 2nd International Information Security Workshop, ISW 1999

Y2 - 6 November 1999 through 7 November 1999

ER -

Undeniable confirmer signature

Abstract

Publication series

Other

Access to Document

Other files and links

Fingerprint

Cite this