Paper 2021/1684
Cryptanalysis of Candidate Obfuscators for Affine Determinant Programs
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.
Metadata
- Available format(s)
-
PDF
- Category
- Foundations
- Publication info
- A minor revision of an IACR publication in EUROCRYPT 2022
- Keywords
- obfuscation cryptanalysis
- Contact author(s)
-
pegasustianma @ gmail com
chenyilei ra @ gmail com
yuyuathk @ gmail com - History
- 2022-06-08: revised
- 2021-12-22: received
- See all versions
- Short URL
- https://ia.cr/2021/1684
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2021/1684,
author = {Li Yao and Yilei Chen and Yu Yu},
title = {Cryptanalysis of Candidate Obfuscators for Affine Determinant Programs},
howpublished = {Cryptology ePrint Archive, Paper 2021/1684},
year = {2021},
note = {\url{https://eprint.iacr.org/2021/1684}},
url = {https://eprint.iacr.org/2021/1684}
}
