Indistinguishability obfuscation
Summary: At least since the initial public proposal of public-key cryptography based on computational hardness conjectures [\textit{W. Diffie} and \textit{M. E. Hellman}, IEEE Trans. Inf. Theory 22, 644--654 (1976; Zbl 0435.94018)], cryptographers have contemplated the possibility of a ``one-way compiler that translates computer programs into ``incomprehensible but equivalent forms. And yet, the search for such a ``one-way compiler remained elusive for decades. We examine a formalization of this concept with the notion of indistinguishability obfuscation (\(i \mathcal{O}\)). Roughly speaking, \(i \mathcal{O}\) requires that the compiled versions of any two equivalent programs (with the same size and running time) be indistinguishable to any efficient adversary. Finally, we show how to construct \(i \mathcal{O}\) in such a way that we can prove the security of our \(i \mathcal{O}\) scheme based on well-studied computational hardness conjectures in cryptography. For the entire collection see [Zbl 07816360].
- A dichotomy for local small-bias generators
- Advances in Cryptology – CRYPTO 2004
- Algebraic attacks against random local functions and their countermeasures
- Annihilation Attacks for Multilinear Maps: Cryptanalysis of Indistinguishability Obfuscation over GGH13
- Arithmetic cryptography (extended abstract)
- Candidate Multilinear Maps from Ideal Lattices
- Cryptanalysis of the multilinear map over the integers
- Cryptography with constant computational overhead
- Does co-NP have short interactive proofs ?
- Efficient Non-interactive Proof Systems for Bilinear Groups
- Founding Cryptography on Oblivious Transfer – Efficiently
- From cryptomania to obfustopia through secret-key functional encryption
- Fully secure functional encryption with general relations from the decisional linear assumption
- Function-hiding inner product encryption
- Functional encryption for quadratic functions from k-lin, revisited
- Functional encryption: definitions and challenges
- Fuzzy Identity-Based Encryption
- Goldreich’s One-Way Function Candidate and Myopic Backtracking Algorithms
- Graded encoding schemes from obfuscation
- Hardness of SIS and LWE with small parameters
- How to leverage hardness of constant-degree expanding polynomials over \(\mathbb{R}\) to build \(i\mathcal{O}\)
- How to use indistinguishability obfuscation
- scientific article; zbMATH DE number 3133919 (Why is no real title available?)
- scientific article; zbMATH DE number 1024063 (Why is no real title available?)
- scientific article; zbMATH DE number 2086626 (Why is no real title available?)
- scientific article; zbMATH DE number 1834654 (Why is no real title available?)
- scientific article; zbMATH DE number 1842483 (Why is no real title available?)
- scientific article; zbMATH DE number 7650430 (Why is no real title available?)
- Indistinguishability obfuscation from compact functional encryption
- Indistinguishability obfuscation from constant-degree graded encoding schemes
- Indistinguishability obfuscation from semantically-secure multilinear encodings
- Indistinguishability obfuscation from simple-to-state hard problems: new assumptions, new techniques, and simplification
- Indistinguishability obfuscation from SXDH on 5-linear maps and locality-5 PRGs
- Indistinguishability obfuscation from trilinear maps and block-wise local PRGs
- Indistinguishability obfuscation from well-founded assumptions
- Indistinguishability obfuscation with non-trivial efficiency
- Indistinguishability obfuscation without maps: attacks and fixes for noisy linear FE
- 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
- Maliciously secure oblivious linear function evaluation with constant overhead
- Multi-party Key Exchange for Unbounded Parties from Indistinguishability Obfuscation
- Multilinear maps from obfuscation
- Multiparty key exchange, efficient traitor tracing, and more from indistinguishability obfuscation
- New directions in cryptography
- Obfuscation of probabilistic circuits and applications
- On lattices, learning with errors, random linear codes, and cryptography
- On the concrete security of Goldreich's pseudorandom generator
- On the security of Goldreich's one-way function
- Output-compressing randomized encodings and applications
- 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
- Pseudorandom generators with long stretch and low locality from random local one-way functions
- Pseudorandom knapsacks and the sample complexity of LWE search-to-decision reductions
- Public-key cryptography from different assumptions
- Secret-sharing for \(\mathbf {NP}\)
- Secure arithmetic computation with constant computational overhead
- Self-bilinear map on unknown order groups from indistinguishability obfuscation and its applications
- Sum of squares lower bounds for refuting any CSP
- Sum-of-squares meets program obfuscation, revisited
- The complexity of theorem-proving procedures
- Virtual Black-Box Obfuscation for All Circuits via Generic Graded Encoding
This page was built for publication: Indistinguishability obfuscation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6198645)
