Indistinguishability obfuscation from well-founded assumptions
Open accessThe DOI matches its Crossref record; 59 of the 59 references it cites were found in a registry or an index.
Abstract
Indistinguishability obfuscation, introduced by [Barak et. al. Crypto 2001], aims to compile programs into unintelligible ones while preserving functionality. It is a fascinating and powerful object that has been shown to enable a host of new cryptographic goals and beyond. However, constructions of indistinguishability obfuscation have remained elusive, with all other proposals relying on heuristics or newly conjectured hardness assumptions. In this work, we show how to construct indistinguishability obfuscation from subexponential hardness of four well-founded assumptions. We prove:
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Trapdoors for hard lattices and new cryptographic constructions
Gentry, C., Peikert, C., & Vaikuntanathan, V. (2008) · Proceedings of the fortieth annual ACM symposium on Theory of computing · doi:10.1145/1374376.1374407 · Cited by 2,435 · cited 1×
“The work of [38] proved the security of a similar construction based on a new variant of the 2-circular SRL security assumption proposed by [69], with respect to GSW and a packed variant of the dual-Regev encryption scheme [70], which requires SRL security to hold in the presence of a length-2 chain of circular encryp…”
On lattices, learning with errors, random linear codes, and cryptography
Regev, O. (2005) · Proceedings of the thirty-seventh annual ACM symposium on Theory of computing · doi:10.1145/1060590.1060603 · Cited by 2,313 · cited 1×
“This assumption was first stated in the work of [110].”
Boneh, D., Boyen, X., & Shacham, H. (2004) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-28628-8_3 · Cited by 2,089 · cited 2×
“Then, the DLIN assumption requires that the following computational indistinguishability holds: {( 𝑔𝑥 , 𝑔𝑦, 𝑔𝑥𝑟 , 𝑔𝑦𝑠 , 𝑔𝑟+𝑠 ) | 𝑥,𝑦, 𝑟, 𝑠 ← Z𝑝 } ≈𝑐 {( 𝑔𝑥 , 𝑔𝑦, 𝑔𝑥𝑟 , 𝑔𝑦𝑠 , 𝑔𝑧 ) | 𝑥,𝑦, 𝑟, 𝑠, 𝑧 ← Z𝑝 } This assumption was first introduced in the 2004 work of Boneh, Boyen, and Shacham [30].”
(Leveled) fully homomorphic encryption without bootstrapping
Brakerski, Z., Gentry, C., & Vaikuntanathan, V. (2012) · Proceedings of the 3rd Innovations in Theoretical Computer Science Conference · doi:10.1145/2090236.2090262 · Cited by 1,782
Gentry, C., Sahai, A., & Waters, B. (2013) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-40041-4_5 · Cited by 1,492 · cited 3×
“LWE has been used extensively to construct applications such as Leveled Fully Homomorphic Encryption [41, 43, 71], Lockable Obfuscation [80, 114], Attribute Based Encryption [32, 78, 79] and Universal Thresholdizers [31].”
Self-citationEfficient Fully Homomorphic Encryption from (Standard) LWE
Brakerski, Z., & Vaikuntanathan, V. (2011) · 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science · doi:10.1109/focs.2011.12 · Cited by 1,449 · cited 2×
“LWE has been used extensively to construct applications such as Leveled Fully Homomorphic Encryption [41, 43, 71], Lockable Obfuscation [80, 114], Attribute Based Encryption [32, 78, 79] and Universal Thresholdizers [31].”
On the (Im)possibility of Obfuscating Programs
Barak, B., Goldreich, O., Impagliazzo, R., Rudich, S., Sahai, A., Vadhan, S., & Yang, K. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-44647-8_1 · Cited by 1,286
Self-citationCandidate Indistinguishability Obfuscation and Functional Encryption for all Circuits
Garg, S., Gentry, C., Halevi, S., Raykova, M., Sahai, A., & Waters, B. R. (2013) · Annual Symposium on Foundations of Computer Science · doi:10.1109/focs.2013.13 · Cited by 1,277 · cited 1×
“In this work, we study the notion of indistinguishability obfuscation (iO) for general polynomial-size circuits [19, 66, 77].”
Self-citationEfficient Non-interactive Proof Systems for Bilinear Groups
Groth, J., & Sahai, A. (2008) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-78967-3_24 · Cited by 1,076
Self-citationHow to use indistinguishability obfuscation: deniable encryption, and more
Sahai, A., & Waters, B. (2014) · Proceedings of the forty-sixth annual ACM symposium on Theory of computing · doi:10.1145/2591796.2591825 · Cited by 624
Self-citation
Cited by
Planting Undetectable Backdoors in Machine Learning Models : [Extended Abstract]
Goldwasser, S., Kim, M. P., Vaikuntanathan, V., & Zamir, O. (2022) · 2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS) · doi:10.1109/focs54457.2022.00092 · Cited by 41
Metadata
- Authors
- Jain, A., Lin, H., & Sahai, A.
- Venue
- Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing
- Publisher
- ACM
- Published
- 2021-06-15
- Pages
- 60-73
- OpenAlex
- W3082860856
- Cited by
- 237
- References
- 59
- FWCI
- 19.13
- Type
- conference paper
- Language
- en
- Open access
- bronze
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Indistinguishability obfuscation from well-founded assumptions. https://app.cochat.ai/papers/10.1145/3406325.3451093
- The paper
- Jain, A., Lin, H., & Sahai, A. (2021). Indistinguishability obfuscation from well-founded assumptions. Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing. https://doi.org/10.1145/3406325.3451093
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.