@inbook{3b27e5b363a24d6d89ab9929025b6f3e,
title = "Super-perfect zero-knowledge proofs",
abstract = "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.",
author = "Oded Goldreich and Liav Teichner",
note = "We are grateful to Alon Rosen and Amit Sahai for useful discussions. This research was partially supported by the Minerva Foundation with funds from the Federal German Ministry for Education and Research.",
year = "2020",
month = apr,
day = "4",
doi = "https://doi.org/10.1007/978-3-030-43662-9_8",
language = "الإنجليزيّة",
isbn = "978-3-030-43661-2",
series = "Lecture Notes in Computer Science",
publisher = "Springer Japan",
pages = "119--140",
editor = "Oded Goldreich",
booktitle = "Computational Complexity and Property Testing",
address = "اليابان",
}