Quantifying knowledge complexity

DOI10.1007/S000370050019MaRDI QIDQ1300608zbMATH OpenOpenAlexFDO

Authors Oded Goldreich, Erez Petrank

Publication date 1 September 1999

Published in Computational Complexity (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s000370050019

zbMATH Keywords

knowledge complexity

Mathematics Subject Classification ID

Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Recommendations

• The Complexity of Zero Knowledge
• Computational Complexity and Knowledge Complexity
• The Knowledge Complexity of Interactive Proof Systems
• Computational complexity and knowledge complexity (extended abstract)
• On the knowledge complexity of \(\mathcal N\mathcal P\)

Cited in

(6)

• On relationships between statistical zero-knowledge proofs
• Security against covert adversaries: Efficient protocols for realistic adversaries
• The graph clustering problem has a perfect zero-knowledge interactive proof
• scientific article; zbMATH DE number 910359 (Why is no real title available?)
• Zero-knowledge proofs of proximity
• NIZK amplification via leakage-resilient secure computation

This page was built for publication: Quantifying knowledge complexity

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1300608)