Statistical zero-knowledge languages can be recognized in two rounds
From MaRDI portal
Publication:808692
DOI10.1016/0022-0000(91)90006-QzbMath0732.68038WikidataQ56959192 ScholiaQ56959192MaRDI QIDQ808692
William Aiello, Johan T. Håstad
Publication date: 1991
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
interactive proofzero-knowledge proofclass IPhierarchy of probabilistic complexity classesinteractive prover-verifier pair
Data encryption (aspects in computer science) (68P25) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)
Related Items
The graph clustering problem has a perfect zero-knowledge interactive proof, New Limits to Classical and Quantum Instance Compression, Spatial Isolation Implies Zero Knowledge Even in a Quantum World, Zero knowledge and circuit minimization, Statistical difference beyond the polarizing regime, Practical proofs of knowledge without relying on theoretical proofs of membership on languages, Which languages have 4-round zero-knowledge proofs?, On the Power of Statistical Zero Knowledge, On relationships between statistical zero-knowledge proofs, Structure Versus Hardness Through the Obfuscation Lens, A framework for non-interactive instance-dependent commitment schemes (NIC), A language-dependent cryptographic primitive, Perfect Non-interactive Zero Knowledge for NP, Complexity classes of equivalence problems revisited, How to Achieve Perfect Simulation and A Complete Problem for Non-interactive Perfect Zero-Knowledge, General Properties of Quantum Zero-Knowledge Proofs, An Equivalence Between Zero Knowledge and Commitments, On the relationship between statistical zero-knowledge and statistical randomized encodings, How to achieve perfect simulation and a complete problem for non-interactive perfect zero-knowledge, The Complexity of Zero Knowledge, On best-possible obfuscation, A perfect zero-knowledge proof system for a problem equivalent to the discrete logarithm, On the Complexity of Computational Problems Regarding Distributions, Public-coin statistical zero-knowledge batch verification against malicious verifiers, On the Relationship Between Statistical Zero-Knowledge and Statistical Randomized Encodings, Interactive and probabilistic proof-checking, Uniform generation of NP-witnesses using an NP-oracle, Weak Zero-Knowledge beyond the Black-Box Barrier, Definitions and properties of zero-knowledge proof systems
Cites Work
