International Association for Cryptologic Research

International Association
for Cryptologic Research

CryptoDB

Polynomial-Time Cryptanalysis of the Subspace Flooding Assumption for Post-Quantum iO

Authors:
Aayush Jain , CMU
Huijia Lin , University of Washington, Seattle
Paul Lou , UCLA
Amit Sahai , UCLA
Download:
DOI: 10.1007/978-3-031-30545-0_8 (login may be required)
Search ePrint
Search Google
Presentation: Slides
Conference: EUROCRYPT 2023
Abstract: Indistinguishability Obfuscation (iO) is a highly versatile primitive implying a myriad advanced cryptographic applications. Up until recently, the state of feasibility of iO was unclear, which changed with works (Jain-Lin-Sahai STOC 2021, Jain-Lin-Sahai Eurocrypt 2022) showing that iO can be finally based upon well-studied hardness assumptions. Unfortunately, one of these assumptions is broken in quantum polynomial time. Luckily, the line work of Brakerski et al. Eurocrypt 2020, Gay-Pass STOC 2021, Wichs-Wee Eurocrypt 2021, Brakerski et al. ePrint 2021, Devadas et al. TCC 2021 simultaneously created new pathways to construct iO with plausible post-quantum security from new assumptions, namely a new form of circular security of LWE in the presence of leakages. At the same time, effective cryptanalysis of this line of work has also begun to emerge (Hopkins et al. Crypto 2021). It is important to identify the simplest possible conjectures that yield post-quantum iO and can be understood through known cryptanalytic tools. In that spirit, and in light of the cryptanalysis of Hopkins et al., recently Devadas et al. gave an elegant construction of iO from a fully-specified and simple-to-state assumption along with a thorough initial cryptanalysis. Our work gives a polynomial-time distinguisher on their "final assumption" for their scheme. Our algorithm is extremely simple to describe: Solve a carefully designed linear system arising out of the assumption. The argument of correctness of our algorithm, however, is nontrivial. We also analyze the "T-sum" version of the same assumption described by Devadas et. al. and under a reasonable conjecture rule out the assumption for any value of T that implies iO.
BibTeX
@inproceedings{eurocrypt-2023-32923,
  title={Polynomial-Time Cryptanalysis of the Subspace Flooding Assumption for Post-Quantum iO},
  publisher={Springer-Verlag},
  doi={10.1007/978-3-031-30545-0_8},
  author={Aayush Jain and Huijia Lin and Paul Lou  and Amit Sahai },
  year=2023
}