Statistical zero-knowledge languages can be recognized in two rounds
DOI10.1016/0022-0000(91)90006-QzbMATH Open0732.68038DBLPjournals/jcss/AielloH91WikidataQ56959192 ScholiaQ56959192MaRDI QIDQ808692FDOQ808692
Authors: William Aiello, Johan Hastad 
Publication date: 1991
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Recommendations
- On the power of statistical zero knowledge
- On round optimal statistical zero knowledge arguments
- scientific article
- A complete problem for statistical zero knowledge
- On the relationship between statistical zero-knowledge and statistical randomized encodings
- On the relationship between statistical zero-knowledge and statistical randomized encodings
- Resettable statistical zero knowledge
- On relationships between statistical zero-knowledge proofs
- scientific article; zbMATH DE number 1256785
- Statistical concurrent non-malleable zero knowledge
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)
Cites Work
- Universal classes of hash functions
- Title not available (Why is that?)
- The knowledge complexity of interactive proof-systems
- Arthur-Merlin games: A randomized proof system, and a hierarchy of complexity classes
- Does co-NP have short interactive proofs ?
- The Knowledge Complexity of Interactive Proof Systems
Cited In (31)
- New Limits to Classical and Quantum Instance Compression
- Zero knowledge and circuit minimization
- Interactive and probabilistic proof-checking
- On relationships between statistical zero-knowledge proofs
- Spatial Isolation Implies Zero Knowledge Even in a Quantum World
- An Equivalence Between Zero Knowledge and Commitments
- Practical proofs of knowledge without relying on theoretical proofs of membership on languages
- On the relationship between statistical zero-knowledge and statistical randomized encodings
- Complexity classes of equivalence problems revisited
- Perfect Non-interactive Zero Knowledge for NP
- Title not available (Why is that?)
- Structure Versus Hardness Through the Obfuscation Lens
- The graph clustering problem has a perfect zero-knowledge interactive proof
- The Complexity of Zero Knowledge
- 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
- On best-possible obfuscation
- Does co-NP have short interactive proofs ?
- A perfect zero-knowledge proof system for a problem equivalent to the discrete logarithm
- Definitions and properties of zero-knowledge proof systems
- Public-coin statistical zero-knowledge batch verification against malicious verifiers
- Uniform generation of NP-witnesses using an NP-oracle
- Statistical difference beyond the polarizing regime
- Weak Zero-Knowledge beyond the Black-Box Barrier
- On the Power of Statistical Zero Knowledge
- How to Achieve Perfect Simulation and A Complete Problem for Non-interactive Perfect Zero-Knowledge
- A framework for non-interactive instance-dependent commitment schemes (NIC)
- A language-dependent cryptographic primitive
- General Properties of Quantum Zero-Knowledge Proofs
- Which languages have 4-round zero-knowledge proofs?
- On the Complexity of Computational Problems Regarding Distributions
This page was built for publication: Statistical zero-knowledge languages can be recognized in two rounds
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q808692)
