On the round complexity of zero-knowledge proofs based on one-way permutations

DOI10.1007/978-3-642-14712-8_12MaRDI QIDQ3584983zbMATH OpenOpenAlexFDO

Authors S. Dov Gordon, Hoeteck Wee, David Xiao, Arkady Yerukhimovich

Publication date 31 August 2010

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-14712-8_12

zbMATH Keywords

black-box separationsconstant-round zero-knowledge proofs

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Round-optimal fully black-box zero-knowledge arguments from one-way permutations
• Round-optimal zero-knowledge proofs of knowledge for NP
• On the existence of three round zero-knowledge proofs
• How to construct constant-round zero-knowledge proof systems for NP
• Lower bounds for non-black-box zero knowledge

Cited in

(10)

• Private coins versus public coins in zero-knowledge proof systems
• On the possibility of basing cryptography on \(\mathsf{EXP}\ne \mathsf{BPP} \)
• Round-optimal fully black-box zero-knowledge arguments from one-way permutations
• Finding collisions in interactive protocols -- tight lower bounds on the round and communication complexities of statistically hiding commitments
• Round-optimal zero-knowledge proofs of knowledge for NP
• The Round-Complexity of Black-Box Zero-Knowledge: A Combinatorial Characterization
• Theory of Cryptography
• Which languages have 4-round zero-knowledge proofs?
• Full round zero-sum distinguishers on \textsf{TinyJAMBU}-128 and \textsf{TinyJAMBU}-192 keyed-permutation in the known-key setting
• On the implausibility of constant-round public-coin zero-knowledge proofs

This page was built for publication: On the round complexity of zero-knowledge proofs based on one-way permutations

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