On the Round Complexity of Zero-Knowledge Proofs Based on One-Way Permutations

DOI10.1007/978-3-642-14712-8_12zbMath1285.94064OpenAlexW51461370MaRDI QIDQ3584983

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

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)

Related Items (4)

On the possibility of basing cryptography on \(\mathsf{EXP}\ne \mathsf{BPP} \) ⋮ Which languages have 4-round zero-knowledge proofs? ⋮ Private Coins versus Public Coins in Zero-Knowledge Proof Systems ⋮ Finding Collisions in Interactive Protocols---Tight Lower Bounds on the Round and Communication Complexities of Statistically Hiding Commitments

This page was built for publication: On the Round Complexity of Zero-Knowledge Proofs Based on One-Way Permutations