Non-black-box simulation in the fully concurrent setting

DOI10.1145/2488608.2488637zbMath1293.94068OpenAlexW1971291564MaRDI QIDQ5495792

Vipul Goyal

Publication date: 7 August 2014

Published in: Proceedings of the forty-fifth annual ACM symposium on Theory of Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/2488608.2488637

zbMATH Keywords

simulationcryptographyzero-knowledge proofs

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (5)

On Non-Black-Box Simulation and the Impossibility of Approximate Obfuscation ⋮ Non-black-box simulation in the fully concurrent setting, revisited ⋮ Post-quantum resettably-sound zero knowledge ⋮ Magic Adversaries Versus Individual Reduction: Science Wins Either Way ⋮ Weak Zero-Knowledge beyond the Black-Box Barrier

This page was built for publication: Non-black-box simulation in the fully concurrent setting