Black-box concurrent zero-knowledge requires \tilde {Ω} (log n ) rounds
From MaRDI portal
Publication:5176015
DOI10.1145/380752.380852zbMath1317.68064OpenAlexW2064545345MaRDI QIDQ5176015
Alon Rosen, Ran Canetti, Erez Petrank, Joe Kilian
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
Polynomial runtime and composability ⋮ Minimal Assumptions and Round Complexity for Concurrent Zero-Knowledge in the Bare Public-Key Model ⋮ On Constant-Round Concurrent Zero-Knowledge from a Knowledge Assumption ⋮ Round-optimal honest-majority MPC in Minicrypt and with everlasting security (extended abstract) ⋮ Lower bounds and impossibility results for concurrent self composition ⋮ The power of undirected rewindings for adaptive security ⋮ The hunting of the SNARK ⋮ Individual simulations ⋮ Possibility and impossibility results for selective decommitments ⋮ Concurrent zero knowledge, revisited ⋮ Cryptography and cryptographic protocols ⋮ Random walks and concurrent zero-knowledge ⋮ Novel \(\Omega\)-protocols for NP ⋮ Magic Adversaries Versus Individual Reduction: Science Wins Either Way ⋮ Lower bounds for non-black-box zero knowledge ⋮ Round-preserving parallel composition of probabilistic-termination cryptographic protocols ⋮ Non-Black-Box Simulation from One-Way Functions and Applications to Resettable Security ⋮ Possibility and Impossibility Results for Encryption and Commitment Secure under Selective Opening ⋮ Hybrid commitments and their applications to zero-knowledge proof systems ⋮ Concurrently Non-malleable Black-Box Zero Knowledge in the Bare Public-Key Model ⋮ Two-Message, Oblivious Evaluation of Cryptographic Functionalities ⋮ Eye for an Eye: Efficient Concurrent Zero-Knowledge in the Timing Model
Cites Work
