Computational Complexity and Knowledge Complexity

DOI10.1137/S0097539795280524MaRDI QIDQ4210087zbMATH OpenFDO

Authors Oded Goldreich, Rafail Ostrovsky, Erez Petrank

Publication date 20 September 1998

Published in SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/S0097539795280524

zbMATH Keywords

complexity classescryptographyinteractive proofsknowledge complexityrandomnesszero knowledge

Mathematics Subject Classification ID

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

Recommendations

• Computational complexity and knowledge complexity (extended abstract)
• On the knowledge complexity of \(\mathcal N\mathcal P\)
• The knowledge complexity of interactive proof-systems
• Statistical zero-knowledge languages can be recognized in two rounds

Cited in

(6)

• Quantifying knowledge complexity
• On the knowledge complexity of \(\mathcal N\mathcal P\)
• Computational complexity and knowledge complexity (extended abstract)
• Perfect Non-interactive Zero Knowledge for NP
• scientific article; zbMATH DE number 1263223 (Why is no real title available?)
• scientific article; zbMATH DE number 910359 (Why is no real title available?)

This page was built for publication: Computational Complexity and Knowledge Complexity

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