Concurrent and resettable zero-knowledge in poly-loalgorithm rounds

DOI10.1145/380752.380851zbMath1317.68076OpenAlexW2075906644MaRDI QIDQ5176014

Joe Kilian, 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.380851

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Cryptography (94A60)

Related Items

Concurrent knowledge extraction in public-key models ⋮ On Non-Black-Box Simulation and the Impossibility of Approximate Obfuscation ⋮ Non-black-box simulation in the fully concurrent setting, revisited ⋮ Individual simulations ⋮ Public-coin parallel zero-knowledge for NP ⋮ Post-quantum resettably-sound zero knowledge ⋮ On expected polynomial runtime in cryptography ⋮ Possibility and impossibility results for selective decommitments ⋮ Concurrent zero knowledge, revisited ⋮ Random walks and concurrent zero-knowledge ⋮ Magic Adversaries Versus Individual Reduction: Science Wins Either Way ⋮ Lower bounds for non-black-box zero knowledge ⋮ Improved Zero-Knowledge Identification with Lattices ⋮ The Round-Complexity of Black-Box Zero-Knowledge: A Combinatorial Characterization ⋮ Possibility and Impossibility Results for Encryption and Commitment Secure under Selective Opening ⋮ Resettably Secure Computation ⋮ Adaptive Hardness and Composable Security in the Plain Model from Standard Assumptions ⋮ Hybrid commitments and their applications to zero-knowledge proof systems ⋮ Two-Message, Oblivious Evaluation of Cryptographic Functionalities ⋮ Eye for an Eye: Efficient Concurrent Zero-Knowledge in the Timing Model ⋮ Private Coins versus Public Coins in Zero-Knowledge Proof Systems

Cites Work

• A constant-factor approximation algorithm for the k -median problem (extended abstract)