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

DOI10.1109/FOCS.2009.59MaRDI QIDQ5171209zbMATH OpenFDO

Authors Yi Deng, Vipul Goyal, Amit Sahai

Publication date 25 July 2014

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

Full work available at URL https://doi.org/10.1109/FOCS.2009.59

Mathematics Subject Classification ID

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

Cited in

(16)

• Non-interactive universal arguments
• On the security loss of unique signatures
• Survey of information security
• New limits for homomorphic encryption
• Adaptive hardness and composable security in the plain model from standard assumptions
• Non-black-box simulation from one-way functions and applications to resettable security
• Statistical Zaps and new oblivious transfer protocols
• Magic adversaries versus individual reduction: science wins either way
• New limits of provable security and applications to ElGamal encryption
• Weak Zero-Knowledge beyond the Black-Box Barrier
• On non-black-box simulation and the impossibility of approximate obfuscation
• Resettable statistical zero-knowledge for NP
• The hunting of the SNARK
• Individual simulations
• Post-quantum resettably-sound zero knowledge
• Non-black-box simulation in the fully concurrent setting, revisited

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5171209)