One-Way Functions and (Im)perfect Obfuscation
From MaRDI portal
Publication:5885583
DOI10.1137/15M1048549OpenAlexW2949347209MaRDI QIDQ5885583
Alon Rosen, Ilan Komargodski, Eylon Yogev, Tal Moran, Moni Naor, Rafael Pass
Publication date: 4 April 2023
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/15m1048549
Cryptography (94A60) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)
Related Items
The Journey from NP to TFNP Hardness, Limits on the Power of Indistinguishability Obfuscation and Functional Encryption, Secret-sharing for NP, From minicrypt to obfustopia via private-key functional encryption, Multiparty key exchange, efficient traitor tracing, and more from indistinguishability obfuscation, Multi-input functional encryption in the private-key setting: stronger security from weaker assumptions, Indistinguishability obfuscation without maps: attacks and fixes for noisy linear FE, On the Existence of Extractable One-Way Functions
Cites Work
- Unnamed Item
- Unnamed Item
- On best-possible obfuscation
- A note on computational indistinguishability
- The MMap strikes back: obfuscation and new multilinear maps immune to CLT13 zeroizing attacks
- Return of GGH15: provable security against zeroizing attacks
- Limits on low-degree pseudorandom generators (or: sum-of-squares meets program obfuscation)
- An efficiency-preserving transformation from honest-verifier statistical zero-knowledge to statistical zero-knowledge
- Indistinguishability obfuscation from SXDH on 5-linear maps and locality-5 PRGs
- Indistinguishability obfuscation from trilinear maps and block-wise local PRGs
- Limits on the locality of pseudorandom generators and applications to indistinguishability obfuscation
- Multi-input functional encryption in the private-key setting: stronger security from weaker assumptions
- Candidate iO from homomorphic encryption schemes
- From cryptomania to obfustopia through secret-key functional encryption
- From minicrypt to obfustopia via private-key functional encryption
- Cryptanalysis of CLT13 multilinear maps with independent slots
- Indistinguishability obfuscation without multilinear maps: new methods for bootstrapping and instantiation
- Sum-of-squares meets program obfuscation, revisited
- Indistinguishability obfuscation without multilinear maps: new paradigms via low degree weak pseudorandomness and security amplification
- Secret-sharing for NP
- On constructing one-way permutations from indistinguishability obfuscation
- Indistinguishability Obfuscation with Non-trivial Efficiency
- Candidate Indistinguishability Obfuscation and Functional Encryption for All Circuits
- Indistinguishability Obfuscation from Constant-Degree Graded Encoding Schemes
- Universal Constructions and Robust Combiners for Indistinguishability Obfuscation and Witness Encryption
- On Statistically Secure Obfuscation with Approximate Correctness
- Cryptanalysis of GGH15 Multilinear Maps
- Annihilation Attacks for Multilinear Maps: Cryptanalysis of Indistinguishability Obfuscation over GGH13
- Practical Multilinear Maps over the Integers
- Multiparty Key Exchange, Efficient Traitor Tracing, and More from Indistinguishability Obfuscation
- Indistinguishability Obfuscation from Semantically-Secure Multilinear Encodings
- On the randomness complexity of efficient sampling
- Limits on the Power of Indistinguishability Obfuscation and Functional Encryption
- Secure Obfuscation in a Weak Multilinear Map Model
- Zeroizing Without Low-Level Zeroes: New MMAP Attacks and their Limitations
- New Multilinear Maps Over the Integers
- Indistinguishability Obfuscation from Compact Functional Encryption
- On Approximation Algorithms for # P
- A Pseudorandom Generator from any One-way Function
- Foundations of Cryptography
- Indistinguishability Obfuscation from Functional Encryption
- Structure Versus Hardness Through the Obfuscation Lens
- How to use indistinguishability obfuscation
- Obfuscation-Based Non-black-box Simulation and Four Message Concurrent Zero Knowledge for NP
- Breaking the Sub-Exponential Barrier in Obfustopia
- On the (im)possibility of obfuscating programs
- Protecting Obfuscation against Algebraic Attacks
- Zero Knowledge and Soundness Are Symmetric
- An Equivalence Between Zero Knowledge and Commitments
- Witness encryption and its applications
- Zeroizing Attacks on Indistinguishability Obfuscation over CLT13
- Projective Arithmetic Functional Encryption and Indistinguishability Obfuscation from Degree-5 Multilinear Maps
- Post-zeroizing Obfuscation: New Mathematical Tools, and the Case of Evasive Circuits
- Virtual Black-Box Obfuscation for All Circuits via Generic Graded Encoding
- On Extractability Obfuscation
- Two-Round Secure MPC from Indistinguishability Obfuscation
- Computational Complexity
- Obfustopia built on secret-key functional encryption
