Resolving the Simultaneous Resettability Conjecture and a New Non-Black-Box Simulation Strategy

DOI10.1109/FOCS.2009.59zbMath1292.94054MaRDI QIDQ5171209

Vipul Goyal, Amit Sahai, Yi Deng

Publication date: 25 July 2014

Published in: 2009 50th Annual IEEE Symposium on Foundations of Computer Science (Search for Journal in Brave)

Mathematics Subject Classification ID

Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Network protocols (68M12)

Related Items (13)

On the security loss of unique signatures ⋮ On Non-Black-Box Simulation and the Impossibility of Approximate Obfuscation ⋮ Survey of information security ⋮ Non-black-box simulation in the fully concurrent setting, revisited ⋮ Non-interactive universal arguments ⋮ The hunting of the SNARK ⋮ Individual simulations ⋮ Post-quantum resettably-sound zero knowledge ⋮ Magic Adversaries Versus Individual Reduction: Science Wins Either Way ⋮ Non-Black-Box Simulation from One-Way Functions and Applications to Resettable Security ⋮ Statistical Zaps and new oblivious transfer protocols ⋮ Adaptive Hardness and Composable Security in the Plain Model from Standard Assumptions ⋮ Weak Zero-Knowledge beyond the Black-Box Barrier

This page was built for publication: Resolving the Simultaneous Resettability Conjecture and a New Non-Black-Box Simulation Strategy