Indistinguishability obfuscation
From MaRDI portal
Publication:6198645
DOI10.4171/icm2022/86OpenAlexW4389774917MaRDI QIDQ6198645
Amit Sahai, Huijia Lin, Aayush Jain
Publication date: 20 March 2024
Published in: International Congress of Mathematicians (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.4171/icm2022/86
pseudorandom generatorslearning parity with noiselearning with errorsindistinguishability obfuscationpairing groupswell-studied assumptions
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60) Theory of compilers and interpreters (68N20) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Geometry of numbers (11H99)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the security of Goldreich's one-way function
- Does co-NP have short interactive proofs ?
- Limits on low-degree pseudorandom generators (or: sum-of-squares meets program obfuscation)
- Secure arithmetic computation with constant computational overhead
- 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
- On the concrete security of Goldreich's pseudorandom generator
- Graded encoding schemes from obfuscation
- Indistinguishability obfuscation without maps: attacks and fixes for noisy linear FE
- Functional encryption for quadratic functions from \(k\)-lin, revisited
- Indistinguishability obfuscation from simple-to-state hard problems: new assumptions, new techniques, and simplification
- Indistinguishability obfuscation without multilinear maps: new methods for bootstrapping and instantiation
- Sum-of-squares meets program obfuscation, revisited
- How to leverage hardness of constant-degree expanding polynomials over \(\mathbb{R}\) to build \(i\mathcal{O}\)
- Indistinguishability obfuscation without multilinear maps: new paradigms via low degree weak pseudorandomness and security amplification
- Maliciously secure oblivious linear function evaluation with constant overhead
- Output-Compressing Randomized Encodings and Applications
- Multilinear Maps from Obfuscation
- Indistinguishability Obfuscation with Non-trivial Efficiency
- Multi-party Key Exchange for Unbounded Parties from Indistinguishability Obfuscation
- Function-Hiding Inner Product Encryption
- Indistinguishability Obfuscation from Constant-Degree Graded Encoding Schemes
- Annihilation Attacks for Multilinear Maps: Cryptanalysis of Indistinguishability Obfuscation over GGH13
- Hardness of SIS and LWE with Small Parameters
- Practical Multilinear Maps over the Integers
- Multiparty Key Exchange, Efficient Traitor Tracing, and More from Indistinguishability Obfuscation
- Indistinguishability Obfuscation from Semantically-Secure Multilinear Encodings
- Self-bilinear Map on Unknown Order Groups from Indistinguishability Obfuscation and Its Applications
- Public-key cryptography from different assumptions
- A Dichotomy for Local Small-Bias Generators
- Secret-Sharing for NP
- Cryptanalysis of the Multilinear Map over the Integers
- Arithmetic Cryptography
- Functional Encryption: Definitions and Challenges
- From Cryptomania to Obfustopia Through Secret-Key Functional Encryption
- Indistinguishability Obfuscation from Compact Functional Encryption
- Fully Secure Functional Encryption with General Relations from the Decisional Linear Assumption
- Founding Cryptography on Oblivious Transfer – Efficiently
- Goldreich’s One-Way Function Candidate and Myopic Backtracking Algorithms
- New directions in cryptography
- Candidate Multilinear Maps from Ideal Lattices
- Sum of squares lower bounds for refuting any CSP
- Pseudorandom Knapsacks and the Sample Complexity of LWE Search-to-Decision Reductions
- How to use indistinguishability obfuscation
- Obfuscation of Probabilistic Circuits and Applications
- Advances in Cryptology – CRYPTO 2004
- Algebraic attacks against random local functions and their countermeasures
- Fuzzy Identity-Based Encryption
- Pseudorandom Generators with Long Stretch and Low Locality from Random Local One-Way Functions
- Protecting Obfuscation against Algebraic Attacks
- Efficient Non-interactive Proof Systems for Bilinear Groups
- The complexity of theorem-proving procedures
- 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 lattices, learning with errors, random linear codes, and cryptography
- Indistinguishability obfuscation from well-founded assumptions
This page was built for publication: Indistinguishability obfuscation
