Black-box concurrent zero-knowledge requires \tilde {Ω} (log n ) rounds
From MaRDI portal
Publication:5176015
DOI10.1145/380752.380852zbMath1317.68064MaRDI QIDQ5176015
Joe Kilian, Ran Canetti, Alon Rosen, Erez Petrank
Publication date: 27 February 2015
Published in: Proceedings of the thirty-third annual ACM symposium on Theory of computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/380752.380852
Related Items
Minimal Assumptions and Round Complexity for Concurrent Zero-Knowledge in the Bare Public-Key Model, Possibility and impossibility results for selective decommitments, Hybrid commitments and their applications to zero-knowledge proof systems, Polynomial runtime and composability, Lower bounds and impossibility results for concurrent self composition, Concurrent zero knowledge, revisited, Novel \(\Omega\)-protocols for NP, Lower bounds for non-black-box zero knowledge, Non-Black-Box Simulation from One-Way Functions and Applications to Resettable Security, Two-Message, Oblivious Evaluation of Cryptographic Functionalities, On Constant-Round Concurrent Zero-Knowledge from a Knowledge Assumption, Concurrently Non-malleable Black-Box Zero Knowledge in the Bare Public-Key Model, Eye for an Eye: Efficient Concurrent Zero-Knowledge in the Timing Model, Possibility and Impossibility Results for Encryption and Commitment Secure under Selective Opening
Cites Work
