Which Languages Have 4-Round Zero-Knowledge Proofs?

DOI10.1007/978-3-540-78524-8_5zbMath1162.94372OpenAlexW1551611048MaRDI QIDQ5445499

Jonathan N. Katz

Publication date: 5 March 2008

Published in: Theory of Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-78524-8_5

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (6)

Three-Round Public-Coin Bounded-Auxiliary-Input Zero-Knowledge Arguments of Knowledge ⋮ Round-optimal zero-knowledge proofs of knowledge for NP ⋮ On Zero-Knowledge with Strict Polynomial-Time Simulation and Extraction from Differing-Input Obfuscation for Circuits ⋮ Constant-round zero-knowledge proofs of knowledge with strict polynomial-time extractors for NP ⋮ Statistical security in two-party computation revisited ⋮ The Knowledge Complexity of Interactive Proof Systems

This page was built for publication: Which Languages Have 4-Round Zero-Knowledge Proofs?