Result-indistinguishable zero-knowledge proofs: Increased power and constant-round protocols

Giovanni Di Crescenzo, Kouichi Sakurai, Moti Yung

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

We investigate result-indistinguishable perfect zero-knowledge proof systems [8] for "transferring the decision of whether the membership of an input in a language is true or not". Previously only a single number-theoretic language was known to have such a proof system and possible extensions were left as an open question. We show that all known random self-reducible languages (e.g., graph isomorphism, quadratic residuosity, discrete log) and compositions over them have such systems. We also consider techniques for constant-round protocols for these languages in this model, and obtain a 5 round protocol scheme.

Original languageEnglish
Title of host publicationSTACS 98 - 15th Annual Symposium on Theoretical Aspects of Computer Science, Proceedings
Pages511-521
Number of pages11
DOIs
Publication statusPublished - Dec 1 1998
Event15th Annual Symposium on Theoretical Aspects of Computer Science, STACS 98 - Paris, France
Duration: Feb 25 1998Feb 27 1998

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume1373 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other15th Annual Symposium on Theoretical Aspects of Computer Science, STACS 98
CountryFrance
CityParis
Period2/25/982/27/98

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'Result-indistinguishable zero-knowledge proofs: Increased power and constant-round protocols'. Together they form a unique fingerprint.

  • Cite this

    Di Crescenzo, G., Sakurai, K., & Yung, M. (1998). Result-indistinguishable zero-knowledge proofs: Increased power and constant-round protocols. In STACS 98 - 15th Annual Symposium on Theoretical Aspects of Computer Science, Proceedings (pp. 511-521). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1373 LNCS). https://doi.org/10.1007/BFb0028586