Which Languages Have 4-Round Zero-Knowledge Proofs?

DOI10.1007/978-3-540-78524-8_5MaRDI QIDQ5445499zbMATH OpenOpenAlexFDO

Authors Jonathan 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)

Recommendations

• Which languages have 4-round zero-knowledge proofs?
• On the existence of three round zero-knowledge proofs
• scientific article; zbMATH DE number 1107670
• Round-optimal zero-knowledge proofs of knowledge for NP
• Lower bounds for non-black-box zero knowledge

Cited in

(12)

• What security can we achieve within 4 rounds?
• Which languages have 4-round fully black-box zero-knowledge arguments from one-way functions?
• What Security Can We Achieve Within 4 Rounds?
• On zero-knowledge with strict polynomial-time simulation and extraction from differing-input obfuscation for circuits
• Three-round public-coin bounded-auxiliary-input zero-knowledge arguments of knowledge
• Round-optimal zero-knowledge proofs of knowledge for NP
• The Knowledge Complexity of Interactive Proof Systems
• Which languages have 4-round zero-knowledge proofs?
• Statistical security in two-party computation revisited
• Zero-knowledge systems from MPC-in-the-head and oblivious transfer
• The black-box simulation barrier persists in a fully quantum world
• Constant-round zero-knowledge proofs of knowledge with strict polynomial-time extractors for NP

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

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