Indistinguishability Obfuscation Without Maps: Attacks and Fixes for Noisy Linear FE
Shweta Agrawal, Alice Pellet-Mary
Abstract
Candidates of Indistinguishability Obfuscation (iO) can be categorized as direct'' or bootstrapping based''. Direct constructions rely on high degree multilinear maps [GGH13,GGHRSW13] and provide heuristic guarantees, while bootstrapping based constructions [LV16,Lin17,LT17,AJLMS19,Agr19,JLMS19] rely, in the best case, on bilinear maps as well as new variants of the Learning With Errors (LWE) assumption and pseudorandom generators. Recent times have seen exciting progress in the construction of indistinguishability obfuscation (iO) from bilinear maps (along with other assumptions) [LT17,AJLMS19,JLMS19,Agr19].
As a notable exception, a recent work by Agrawal [Agr19] provided a construction for iO without using any maps. This work identified a new primitive, called Noisy Linear Functional Encryption (NLinFE) that provably suffices for iO and gave a direct construction of NLinFE from new assumptions on lattices. While a preliminary cryptanalysis for the new assumptions was provided in the original work, the author admitted the necessity of performing significantly more cryptanalysis before faith could be placed in the security of the scheme. Moreover, the author did not suggest concrete parameters for the construction.
In this work, we fill this gap by undertaking the task of thorough cryptanalytic study of NLinFE. We design two attacks that let the adversary completely break the security of the scheme. To achieve this, we develop new cryptanalytic techniques which (we hope) will inform future designs of the primitive of NLinFE.
From the knowledge gained by our cryptanalytic study, we suggest modifications to the scheme. We provide a new scheme which overcomes the vulnerabilities identified before. We also provide a thorough analysis of all the security aspects of this scheme and argue why plausible attacks do not work. We additionally provide concrete parameters with which the scheme may be instantiated. We believe the security of NLinFE stands on significantly firmer footing as a result of this work.
Ask about this paper
Ask your agent about it.
Lune has read the top-tier papers around this one, so every answer names the papers it rests on.
Your agent calls
Lunesearch_papers
Free to start. No credit card required.
Terminal
Install the CLIlune papers get c4a66d39-8d92-4411-b965-e1dffe4f8c85Cited by top-tier papers9
- Indistinguishability obfuscation from well-founded assumptionsAayush Jain, Huijia Lin, Amit SahaiSTOC 2021 · 223 citations
- Candidate Obfuscation via Oblivious LWE SamplingHoeteck Wee, Daniel WichsEUROCRYPT 2021 · 78 citations
- Classical vs Quantum Random OraclesTakashi Yamakawa, Mark ZhandryEUROCRYPT 2021 · 43 citations
- Counterexamples to New Circular Security Assumptions Underlying iOSamuel B. Hopkins, Aayush Jain, Huijia LinCRYPTO 2021 · 28 citations
- Indistinguishability Obfuscation via Mathematical Proofs of EquivalenceAbhishek Jain, Zhengzhong JinFOCS 2022 · 21 citations
Related papers
- Indistinguishability Obfuscation from LPN over , DLIN, and PRGs in NC0Aayush Jain, Huijia Lin, Amit SahaiEUROCRYPT 2022 · 102 citations
- Indistinguishability Obfuscation from Simple-to-State Hard Problems: New Assumptions, New Techniques, and SimplificationRomain Gay, Aayush Jain, Huijia Lin, Amit SahaiEUROCRYPT 2021 · 46 citations
- Lattice-Based Obfuscation from NTRU and Equivocal LWEValerio Cini, Russell W. F. Lai, Ivy K. Y. WooCRYPTO 2025 · 3 citations
- Candidate iO from Homomorphic Encryption SchemesZvika Brakerski, Nico Döttling, Sanjam Garg, Giulio MalavoltaEUROCRYPT 2020 · 60 citations
- Quasi-Linear Indistinguishability Obfuscation via Mathematical Proofs of Equivalence and ApplicationsYaohua Ma, Chenxin Dai, Elaine ShiEUROCRYPT 2025 · 5 citations
