2-round zero knowledge and proof auditors

DOI10.1145/509907.509958zbMATH Open1192.68291OpenAlexW2054019351MaRDI QIDQ3579205FDOQ3579205

Authors: Cynthia Dwork, Larry J. Stockmeyer 

Publication date: 5 August 2010

Published in: Proceedings of the thiry-fourth annual ACM symposium on Theory of computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/509907.509958

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Network protocols (68M12)

Cited In (3)

• A note on the Dwork-Naor timed deniable authentication
• The round complexity of quantum zero-knowledge
• Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems

This page was built for publication: 2-round zero knowledge and proof auditors

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