Welcome to the resource topic for 2021/1684
Title:
Cryptanalysis of Candidate Obfuscators for Affine Determinant Programs
Authors: Li Yao, 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.
ePrint: https://eprint.iacr.org/2021/1684
Talk: https://www.youtube.com/watch?v=QUr6Eu4sH48
Slides: https://iacr.org/submit/files/slides/2022/eurocrypt/eurocrypt2022/166/slides.pdf
See all topics related to this paper.
Feel free to post resources that are related to this paper below.
Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.
For more information, see the rules for Resource Topics .