How to Achieve Perfect Simulation and a Complete Problem for Non-interactive Perfect Zero-Knowledge
How to Achieve Perfect Simulation and a Complete Problem for Non-interactive Perfect Zero-Knowledge
复制标题
如何实现非交互式完美零知识的完美模拟和完整问题
作者：
Lior Malka
本文研究完美零知识证明。这样的证明不允许任何模拟错误，因此来自统计零知识（允许小错误）研究的技术不适用于它们。我们介绍了一种新的错误转移技术，用于构建完美的模拟器。使用这种技术，我们给出了第一个完整的问题，允许非交互式完美零知识（NIPZK）证明，一个困难的问题，允许公共硬币PZK证明，和其他应用程序的问题类。
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.