How to Achieve Perfect Simulation and a Complete Problem for Non-interactive Perfect Zero-Knowledge.

Saved in:
Bibliographic Details
Title: How to Achieve Perfect Simulation and a Complete Problem for Non-interactive Perfect Zero-Knowledge.
Authors: Malka, Lior1 lior34@gmail.com
Source: Journal of Cryptology. Summer2015, Vol. 28 Issue 3, p533-550. 18p.
Subjects: Computer simulation, Zero-knowledge proofs, Application software, Error analysis in mathematics, Cryptography
Abstract: This paper studies perfect zero-knowledge proofs. Such proofs do not allow any simulation errors, and therefore techniques from the study of statistical zero-knowledge (where a small error is allowed) do not apply to them. We introduce a new error shifting technique for building perfect simulators. Using this technique we give the first complete problem for the class of problems admitting non-interactive perfect zero-knowledge ( NIPZK) proofs, a hard problem for the class of problems admitting public-coin PZK proofs, and other applications. [ABSTRACT FROM AUTHOR]
Copyright of Journal of Cryptology is the property of Springer Nature and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
Database: Engineering Source
Description
Abstract:This paper studies perfect zero-knowledge proofs. Such proofs do not allow any simulation errors, and therefore techniques from the study of statistical zero-knowledge (where a small error is allowed) do not apply to them. We introduce a new error shifting technique for building perfect simulators. Using this technique we give the first complete problem for the class of problems admitting non-interactive perfect zero-knowledge ( NIPZK) proofs, a hard problem for the class of problems admitting public-coin PZK proofs, and other applications. [ABSTRACT FROM AUTHOR]
ISSN:09332790
DOI:10.1007/s00145-013-9165-6