Black-Box Concurrent Zero-Knowledge Requires (Almost) Logarithmically Many Rounds
From MaRDI portal
Publication:4785630
DOI10.1137/S0097539701392949zbMath1037.94004OpenAlexW2028554387MaRDI QIDQ4785630
Alon Rosen, Ran Canetti, Erez Petrank, Joe Kilian
Publication date: 5 January 2003
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/s0097539701392949
Analysis of algorithms and problem complexity (68Q25) Cryptography (94A60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Related Items
Concurrent knowledge extraction in public-key models ⋮ Statistical Concurrent Non-malleable Zero-Knowledge from One-Way Functions ⋮ Statistical concurrent non-malleable zero-knowledge from one-way functions ⋮ Non-black-box simulation in the fully concurrent setting, revisited ⋮ The ERA Theorem for Safe Memory Reclamation ⋮ Parallel and Concurrent Security of the HB and HB + Protocols ⋮ The Round-Complexity of Black-Box Zero-Knowledge: A Combinatorial Characterization ⋮ Parallel and concurrent security of the HB and \(HB^{+}\) protocols ⋮ General composition and universal composability in secure multiparty computation ⋮ Finding Collisions in Interactive Protocols---Tight Lower Bounds on the Round and Communication Complexities of Statistically Hiding Commitments
