On relationships between statistical zero-knowledge proofs

DOI10.1006/jcss.1999.1664zbMath0956.68020OpenAlexW1976527161MaRDI QIDQ1975967

Tatsuaki Okamoto

Publication date: 27 July 2000

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jcss.1999.1664

zbMATH Keywords

statistical zero-knowledge interactive proofs

Mathematics Subject Classification ID

Theory of programming languages (68N15)

Related Items (19)

The Untold Story of $$\mathsf {SBP}$$ ⋮ A Surprisingly Simple Way of Reversing Trace Distance via Entanglement ⋮ New Limits to Classical and Quantum Instance Compression ⋮ Computational complexity studies of synchronous Boolean finite dynamical systems on directed graphs ⋮ Proofs of Work from worst-case assumptions ⋮ The minimum oracle circuit size problem ⋮ Knottedness is in NP, modulo GRH ⋮ A framework for non-interactive instance-dependent commitment schemes (NIC) ⋮ On the complexity of compressing obfuscation ⋮ 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 ⋮ Unnamed Item ⋮ Public-coin statistical zero-knowledge batch verification against malicious verifiers ⋮ On the Relationship Between Statistical Zero-Knowledge and Statistical Randomized Encodings

Cites Work

• Statistical zero-knowledge languages can be recognized in two rounds
• Does co-NP have short interactive proofs ?
• Minimum disclosure proofs of knowledge
• Quantifying knowledge complexity
• Computational complexity and knowledge complexity (extended abstract)
• The Knowledge Complexity of Interactive Proof Systems
• Algebraic methods for interactive proof systems
• IP = PSPACE
• Probability Inequalities for Sums of Bounded Random Variables
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On relationships between statistical zero-knowledge proofs