Super-perfect zero-knowledge proofs

Oded Goldreich, Liav Teichner

Research output: Chapter in Book/Report/Conference proceedingChapter


We initiate a study of super-perfect zero-knowledge proof systems. Loosely speaking, these are proof systems for which the interaction can be perfectly simulated in strict probabilistic polynomial-time. In contrast, the standard definition of perfect zero-knowledge only requires that the interaction can be perfectly simulated by a strict probabilistic polynomial-time that is allowed to fail with probability at most one half. We show that two types of perfect zero-knowledge proof systems can be transformed into super-perfect ones. The first type includes the perfect zero-knowledge interactive proof system for Graph Isomorphism and other systems of the same form, including perfect zero-knowledge arguments for NP. The second type refers to perfect non-interactive zero-knowledge proof systems. We also present a super-perfect non-interactive zero-knowledge proof system for the set of Blum integers.

Original languageEnglish
Title of host publicationComputational Complexity and Property Testing
Subtitle of host publicationOn the Interplay Between Randomness and Computation
EditorsOded Goldreich
PublisherSpringer Japan
Number of pages22
ISBN (Electronic)978-3-030-43662-9
ISBN (Print)978-3-030-43661-2
StatePublished Online - 4 Apr 2020

Publication series

NameLecture Notes in Computer Science
Volume12050 LNCS
ISSN (Print)0302-9743

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • General Computer Science


Dive into the research topics of 'Super-perfect zero-knowledge proofs'. Together they form a unique fingerprint.

Cite this