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.
| Original language | English |
|---|---|
| Pages (from-to) | 533-550 |
| Number of pages | 18 |
| Journal | Journal of Cryptology |
| Volume | 28 |
| Issue number | 3 |
| DOIs | |
| State | Published - 12 Jul 2015 |
| Externally published | Yes |
Keywords
- Complete problems
- Cryptography
- Error shifting
- Non-interactive
- Perfect simulation
- Perfect zero-knowledge
ASJC Scopus subject areas
- Software
- Computer Science Applications
- Applied Mathematics
Fingerprint
Dive into the research topics of 'How to Achieve Perfect Simulation and a Complete Problem for Non-interactive Perfect Zero-Knowledge'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver