Computational Complexity and Knowledge Complexity

DOI10.1137/S0097539795280524zbMATH Open0907.68082MaRDI QIDQ4210087FDOQ4210087

Authors: Oded Goldreich, Rafail Ostrovsky, Erez Petrank 

Publication date: 20 September 1998

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

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

zbMATH Keywords

complexity classescryptographyzero knowledgerandomnessinteractive proofsknowledge complexity

Mathematics Subject Classification ID

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

Cited In (4)

• Perfect Non-interactive Zero Knowledge for NP
• Computational complexity and knowledge complexity (extended abstract)
• Title not available (Why is that?)
• On the knowledge complexity of \(\mathcal N\mathcal P\)

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)