On the existence of three round zero-knowledge proofs

DOI10.1007/978-3-319-78372-7_1MaRDI QIDQ1653072zbMATH OpenOpenAlexFDO

Authors Nils Fleischhacker, Vipul Goyal, Abhishek Jain

Publication date 17 July 2018

Full work available at URL https://doi.org/10.1007/978-3-319-78372-7_1

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Cryptography (94A60)

Recommendations

• scientific article; zbMATH DE number 1302862
• Existence of 3-round zero-knowledge proof systems for NP
• Advances in Cryptology – CRYPTO 2004
• Three-round public-coin bounded-auxiliary-input zero-knowledge arguments of knowledge
• A note on constant-round zero-knowledge proofs of knowledge
• Round-optimal zero-knowledge proofs of knowledge for NP
• Round-optimal perfect zero-knowledge proofs
• scientific article; zbMATH DE number 4191106
• On secure two-party computation in three rounds
• Theory of Cryptography

Cited in

(23)

• Round-optimal fully black-box zero-knowledge arguments from one-way permutations
• Which languages have 4-round fully black-box zero-knowledge arguments from one-way functions?
• A black-box approach to post-quantum zero-knowledge in constant rounds
• Existence of 3-round zero-knowledge proof systems for NP
• Lower bounds for non-black-box zero knowledge
• Crowd verifiable zero-knowledge and end-to-end verifiable multiparty computation
• Individual simulations
• Post-quantum resettably-sound zero knowledge
• On the implausibility of constant-round public-coin zero-knowledge proofs
• Point obfuscation and 3-round zero-knowledge
• Three-round public-coin bounded-auxiliary-input zero-knowledge arguments of knowledge
• On the round complexity of zero-knowledge proofs based on one-way permutations
• Round-optimal zero-knowledge proofs of knowledge for NP
• Which languages have 4-round zero-knowledge proofs?
• scientific article; zbMATH DE number 1302862 (Why is no real title available?)
• Weak Zero-Knowledge beyond the Black-Box Barrier
• Weak zero-knowledge beyond the black-box barrier
• Advances in Cryptology – CRYPTO 2004
• Which Languages Have 4-Round Zero-Knowledge Proofs?
• Post-quantum simulatable extraction with minimal assumptions: black-box and constant-round
• A new approach to efficient non-malleable zero-knowledge
• Zero-knowledge systems from MPC-in-the-head and oblivious transfer
• The uber-knowledge assumption: a bridge to the AGM

This page was built for publication: On the existence of three round zero-knowledge proofs

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