Divertible zero-knowledge proof of polynomial relations and blind group signature

Khanh Quoc Nguyen; Yi Mu; Vijay Varadharajan

doi:10.1007/3-540-48970-3_10

Divertible zero-knowledge proof of polynomial relations and blind group signature

Khanh Quoc Nguyen, Yi Mu, Vijay Varadharajan

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

5 Citations (Scopus)

Abstract

A divertible protocol is a protocol between three parties in which one party is able to divert another party’s proof of some facts to prove some other facts to the other party. This paper presents a divertible protocol to prove multi-variant polynomial relations. Its direct application to blind group signature is also shown.

Original language	English
Title of host publication	Information Security and Privacy
Subtitle of host publication	4th Australasian Conference, ACISP’99 Wollongong, NSW, Australia, April 7–9, 1999 Proceedings
Editors	Josef Pieprzyk, Rei Safavi-Naini, Jennifer Seberry
Place of Publication	Berlin
Publisher	Springer, Springer Nature
Pages	117-128
Number of pages	12
Volume	1587
ISBN (Electronic)	9783540489702
ISBN (Print)	9783540657569
DOIs	https://doi.org/10.1007/3-540-48970-3_10
Publication status	Published - 1999
Externally published	Yes
Event	4th Australasian Conference on Information Security and Privacy, ACISP - 1999 - Wollongong, Australia Duration: 7 Apr 1999 → 9 Apr 1999

Publication series

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

Other

Other	4th Australasian Conference on Information Security and Privacy, ACISP - 1999
Country/Territory	Australia
City	Wollongong
Period	7/04/99 → 9/04/99

Access to Document

10.1007/3-540-48970-3_10

Cite this

Nguyen, K. Q., Mu, Y., & Varadharajan, V. (1999). Divertible zero-knowledge proof of polynomial relations and blind group signature. In J. Pieprzyk, R. Safavi-Naini, & J. Seberry (Eds.), Information Security and Privacy: 4th Australasian Conference, ACISP’99 Wollongong, NSW, Australia, April 7–9, 1999 Proceedings (Vol. 1587, pp. 117-128). (Lecture Notes in Computer Science; Vol. 1587). Springer, Springer Nature. https://doi.org/10.1007/3-540-48970-3_10

Nguyen, Khanh Quoc ; Mu, Yi ; Varadharajan, Vijay. / Divertible zero-knowledge proof of polynomial relations and blind group signature. Information Security and Privacy: 4th Australasian Conference, ACISP’99 Wollongong, NSW, Australia, April 7–9, 1999 Proceedings. editor / Josef Pieprzyk ; Rei Safavi-Naini ; Jennifer Seberry. Vol. 1587 Berlin : Springer, Springer Nature, 1999. pp. 117-128 (Lecture Notes in Computer Science).

@inbook{15c240de3e434890b56a2f727c719421,

title = "Divertible zero-knowledge proof of polynomial relations and blind group signature",

abstract = "A divertible protocol is a protocol between three parties in which one party is able to divert another party{\textquoteright}s proof of some facts to prove some other facts to the other party. This paper presents a divertible protocol to prove multi-variant polynomial relations. Its direct application to blind group signature is also shown.",

author = "Nguyen, {Khanh Quoc} and Yi Mu and Vijay Varadharajan",

year = "1999",

doi = "10.1007/3-540-48970-3_10",

language = "English",

isbn = "9783540657569",

volume = "1587",

series = "Lecture Notes in Computer Science",

publisher = "Springer, Springer Nature",

pages = "117--128",

editor = "Josef Pieprzyk and Rei Safavi-Naini and Jennifer Seberry",

booktitle = "Information Security and Privacy",

address = "United States",

note = "4th Australasian Conference on Information Security and Privacy, ACISP - 1999 ; Conference date: 07-04-1999 Through 09-04-1999",

}

Nguyen, KQ, Mu, Y & Varadharajan, V 1999, Divertible zero-knowledge proof of polynomial relations and blind group signature. in J Pieprzyk, R Safavi-Naini & J Seberry (eds), Information Security and Privacy: 4th Australasian Conference, ACISP’99 Wollongong, NSW, Australia, April 7–9, 1999 Proceedings. vol. 1587, Lecture Notes in Computer Science, vol. 1587, Springer, Springer Nature, Berlin, pp. 117-128, 4th Australasian Conference on Information Security and Privacy, ACISP - 1999, Wollongong, New South Wales, Australia, 7/04/99. https://doi.org/10.1007/3-540-48970-3_10

Divertible zero-knowledge proof of polynomial relations and blind group signature. / Nguyen, Khanh Quoc; Mu, Yi; Varadharajan, Vijay.
Information Security and Privacy: 4th Australasian Conference, ACISP’99 Wollongong, NSW, Australia, April 7–9, 1999 Proceedings. ed. / Josef Pieprzyk; Rei Safavi-Naini; Jennifer Seberry. Vol. 1587 Berlin: Springer, Springer Nature, 1999. p. 117-128 (Lecture Notes in Computer Science; Vol. 1587).

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

TY - CHAP

T1 - Divertible zero-knowledge proof of polynomial relations and blind group signature

AU - Nguyen, Khanh Quoc

AU - Mu, Yi

AU - Varadharajan, Vijay

PY - 1999

Y1 - 1999

N2 - A divertible protocol is a protocol between three parties in which one party is able to divert another party’s proof of some facts to prove some other facts to the other party. This paper presents a divertible protocol to prove multi-variant polynomial relations. Its direct application to blind group signature is also shown.

AB - A divertible protocol is a protocol between three parties in which one party is able to divert another party’s proof of some facts to prove some other facts to the other party. This paper presents a divertible protocol to prove multi-variant polynomial relations. Its direct application to blind group signature is also shown.

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

U2 - 10.1007/3-540-48970-3_10

DO - 10.1007/3-540-48970-3_10

M3 - Chapter

AN - SCOPUS:84961373995

SN - 9783540657569

VL - 1587

T3 - Lecture Notes in Computer Science

SP - 117

EP - 128

BT - Information Security and Privacy

A2 - Pieprzyk, Josef

A2 - Safavi-Naini, Rei

A2 - Seberry, Jennifer

PB - Springer, Springer Nature

CY - Berlin

T2 - 4th Australasian Conference on Information Security and Privacy, ACISP - 1999

Y2 - 7 April 1999 through 9 April 1999

ER -

Nguyen KQ, Mu Y, Varadharajan V. Divertible zero-knowledge proof of polynomial relations and blind group signature. In Pieprzyk J, Safavi-Naini R, Seberry J, editors, Information Security and Privacy: 4th Australasian Conference, ACISP’99 Wollongong, NSW, Australia, April 7–9, 1999 Proceedings. Vol. 1587. Berlin: Springer, Springer Nature. 1999. p. 117-128. (Lecture Notes in Computer Science). doi: 10.1007/3-540-48970-3_10

Divertible zero-knowledge proof of polynomial relations and blind group signature

Abstract

Publication series

Other

Access to Document

Other files and links

Fingerprint

Cite this