One-Way Functions and (Im)perfect Obfuscation
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 7650430 (Why is no real title available?)
- scientific article; zbMATH DE number 7759462 (Why is no real title available?)
- A Pseudorandom Generator from any One-way Function
- A note on computational indistinguishability
- An Equivalence Between Zero Knowledge and Commitments
- An efficiency-preserving transformation from honest-verifier statistical zero-knowledge to statistical zero-knowledge
- Annihilation Attacks for Multilinear Maps: Cryptanalysis of Indistinguishability Obfuscation over GGH13
- Breaking the sub-exponential barrier in obfustopia
- Candidate iO from homomorphic encryption schemes
- Candidate indistinguishability obfuscation and functional encryption for all circuits
- Computational Complexity
- Cryptanalysis of CLT13 multilinear maps with independent slots
- Cryptanalysis of GGH15 multilinear maps
- Foundations of Cryptography
- From cryptomania to obfustopia through secret-key functional encryption
- From minicrypt to obfustopia via private-key functional encryption
- How to use indistinguishability obfuscation
- Indistinguishability obfuscation from SXDH on 5-linear maps and locality-5 PRGs
- Indistinguishability obfuscation from compact functional encryption
- Indistinguishability obfuscation from constant-degree graded encoding schemes
- Indistinguishability obfuscation from functional encryption
- Indistinguishability obfuscation from semantically-secure multilinear encodings
- Indistinguishability obfuscation from trilinear maps and block-wise local PRGs
- Indistinguishability obfuscation with non-trivial efficiency
- Indistinguishability obfuscation without multilinear maps: new methods for bootstrapping and instantiation
- Indistinguishability obfuscation without multilinear maps: new paradigms via low degree weak pseudorandomness and security amplification
- Limits on low-degree pseudorandom generators (or: sum-of-squares meets program obfuscation)
- Limits on the locality of pseudorandom generators and applications to indistinguishability obfuscation
- Limits on the power of indistinguishability obfuscation and functional encryption
- Multi-input functional encryption in the private-key setting: stronger security from weaker assumptions
- Multiparty key exchange, efficient traitor tracing, and more from indistinguishability obfuscation
- New Multilinear Maps Over the Integers
- Obfuscation-based non-black-box simulation and four message concurrent zero knowledge for NP
- Obfustopia built on secret-key functional encryption
- On Approximation Algorithms for # P
- On best-possible obfuscation
- On constructing one-way permutations from indistinguishability obfuscation
- On extractability obfuscation
- On statistically secure obfuscation with approximate correctness
- On the (im)possibility of obfuscating programs
- On the randomness complexity of efficient sampling
- Post-zeroizing obfuscation: new mathematical tools, and the case of evasive circuits
- Practical multilinear maps over the integers
- Projective arithmetic functional encryption and indistinguishability obfuscation from degree-5 multilinear maps
- Protecting obfuscation against algebraic attacks
- Return of GGH15: provable security against zeroizing attacks
- Secret-sharing for NP
- Secure Obfuscation in a Weak Multilinear Map Model
- Structure versus hardness through the obfuscation lens
- Sum-of-squares meets program obfuscation, revisited
- The MMap strikes back: obfuscation and new multilinear maps immune to CLT13 zeroizing attacks
- Two-round secure MPC from indistinguishability obfuscation
- Universal Constructions and Robust Combiners for Indistinguishability Obfuscation and Witness Encryption
- Virtual Black-Box Obfuscation for All Circuits via Generic Graded Encoding
- Witness encryption and its applications
- Zero Knowledge and Soundness Are Symmetric
- Zeroizing Attacks on Indistinguishability Obfuscation over CLT13
- Zeroizing Without Low-Level Zeroes: New MMAP Attacks and their Limitations
Cited in
(26)- On constructing one-way permutations from indistinguishability obfuscation
- Point-function obfuscation: a framework and generic constructions
- A simple construction of iO for Turing machines
- Multi-input functional encryption in the private-key setting: stronger security from weaker assumptions
- scientific article; zbMATH DE number 709841 (Why is no real title available?)
- Perfect structure on the edge of chaos. Trapdoor permutations from indistinguishability obfuscation
- Limits on the power of indistinguishability obfuscation and functional encryption
- From minicrypt to obfustopia via private-key functional encryption
- On constructing one-way permutations from indistinguishability obfuscation
- On the complexity of compressing obfuscation
- On the complexity of compressing obfuscation
- Secret-sharing for NP
- The journey from NP to TFNP hardness
- Security-preserving hardness-amplification for any regular one-way function
- On statistically secure obfuscation with approximate correctness
- Indistinguishability obfuscation
- Poly-Many Hardcore Bits for Any One-Way Function and a Framework for Differing-Inputs Obfuscation
- Structure versus hardness through the obfuscation lens
- Indistinguishability obfuscation without maps: attacks and fixes for noisy linear FE
- Multiparty key exchange, efficient traitor tracing, and more from indistinguishability obfuscation
- Indistinguishability obfuscation, range avoidance, and bounded arithmetic
- NP-hardness of approximating meta-complexity: a cryptographic approach
- Algebraic (trapdoor) one-way functions: constructions and applications
- On the existence of extractable one-way functions
- Non-interactive secure computation from one-way functions
- Secrecy without one-way functions
This page was built for publication: One-Way Functions and (Im)perfect Obfuscation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5885583)
