How to Achieve Perfect Simulation and a Complete Problem for Non-interactive Perfect Zero-Knowledge
Author:
- 21 November 2013
- journal article
- research article
- Published by Springer Nature in Journal of Cryptology
- Vol. 28 (3) , 533-550
Abstract
No abstract availableKeywords
This publication has 21 references indexed in Scilit:
- A complete problem for statistical zero knowledgeJournal of the ACM, 2003
- On Relationships between Statistical Zero-Knowledge ProofsJournal of Computer and System Sciences, 2000
- Image density is complete for non-interactive-SZK1998
- The knowledge complexity of quadratic residuosity languagesTheoretical Computer Science, 1994
- Noninteractive Zero-KnowledgeSIAM Journal on Computing, 1991
- Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systemsJournal of the ACM, 1991
- Statistical zero-knowledge languages can be recognized in two roundsJournal of Computer and System Sciences, 1991
- The Knowledge Complexity of Interactive Proof SystemsSIAM Journal on Computing, 1989
- Arthur-Merlin games: A randomized proof system, and a hierarchy of complexity classesJournal of Computer and System Sciences, 1988
- The complexity of promise problems with applications to public-key cryptographyInformation and Control, 1984