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 proceedingChapterpeer-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 languageEnglish
Title of host publicationInformation Security and Privacy
Subtitle of host publication4th Australasian Conference, ACISP’99 Wollongong, NSW, Australia, April 7–9, 1999 Proceedings
EditorsJosef Pieprzyk, Rei Safavi-Naini, Jennifer Seberry
Place of PublicationBerlin
PublisherSpringer, Springer Nature
Pages117-128
Number of pages12
Volume1587
ISBN (Electronic)9783540489702
ISBN (Print)9783540657569
DOIs
Publication statusPublished - 1999
Externally publishedYes
Event4th Australasian Conference on Information Security and Privacy, ACISP - 1999 - Wollongong, Australia
Duration: 7 Apr 19999 Apr 1999

Publication series

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

Other

Other4th Australasian Conference on Information Security and Privacy, ACISP - 1999
CountryAustralia
CityWollongong
Period7/04/999/04/99

Fingerprint Dive into the research topics of 'Divertible zero-knowledge proof of polynomial relations and blind group signature'. Together they form a unique fingerprint.

Cite this