Relativized perfect zero knowledge is not BPP

DOI10.1016/0890-5401(91)90024-VzbMath0734.68043WikidataQ56959184 ScholiaQ56959184MaRDI QIDQ811120

William Aiello, Johan T. Håstad

Publication date: 1991

Published in: Information and Computation (Search for Journal in Brave)

zbMATH Keywords

complexity of zero-knowledge interactive proofs

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Data encryption (aspects in computer science) (68P25)

Related Items

Statistical Randomized Encodings: A Complexity Theoretic View, On the Power of Statistical Zero Knowledge, Definitions and properties of zero-knowledge proof systems

Cites Work

• Does co-NP have short interactive proofs ?
• The Knowledge Complexity of Interactive Proof Systems
• The knowledge complexity of interactive proof-systems
• Unnamed Item