Lower bounds for concurrent zero knowledge

DOI10.1007/s00493-005-0014-6zbMath1084.68052OpenAlexW2044603066MaRDI QIDQ812826

Joe Kilian, Erez Petrank, Charles W. Rackoff

Publication date: 26 January 2006

Published in: Combinatorica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00493-005-0014-6

zbMATH Keywords

zero knowledge interactive proofs

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items

On Constant-Round Concurrent Zero-Knowledge from a Knowledge Assumption ⋮ Finding Collisions in Interactive Protocols---Tight Lower Bounds on the Round and Communication Complexities of Statistically Hiding Commitments