Cryptology ePrint Archive: Report 2021/1684

Cryptanalysis of Candidate Obfuscators for Affine Determinant Programs

Li Yao and Yilei Chen and Yu Yu

Abstract: At ITCS 2020, Bartusek et al. proposed a candidate indistinguishability obfuscator (iO) for affine determinant programs (ADPs). The candidate is special since it directly applies specific randomization techniques to the underlying ADP, without relying on the hardness of traditional cryptographic assumptions like discrete-log or learning with errors. It is relatively efficient compared to the rest of the iO candidates. However, the obfuscation scheme requires further cryptanalysis since it was not known to be based on any well-formed mathematical assumptions.

In this paper, we show cryptanalytic attacks on the iO candidate provided by Bartusek et al. Our attack exploits the weakness of one of the randomization steps in the candidate. The attack applies to a fairly general class of programs. At the end of the paper we discuss plausible countermeasures to defend against our attacks.

Category / Keywords: foundations / obfuscation, cryptanalysis

Date: received 22 Dec 2021

Contact author: pegasustianma at gmail com, chenyilei ra at gmail com, yuyuathk at gmail com

Available format(s): PDF | BibTeX Citation

Version: 20211222:174714 (All versions of this report)

Short URL: ia.cr/2021/1684


[ Cryptology ePrint archive ]