Cryptology ePrint Archive: Report 2019/1254

Cryptanalysis of FRS Obfuscation based on the CLT13 Multilinear Map

Jiseung Kim and Changmin Lee

Abstract: We present classical polynomial time attacks against the FRS branching program obfuscator of Fernando-Rasmussen-Sahai (Asiacrypt’17) (with one zerotest parameter), which is robust against all known classical cryptanalyses on obfuscators, when instantiated with the CLT13 multilinear map.

First of all, we (heuristically) reproduce a new zerotest parameter from the original one. The new zerotest parameter mitigates parameter constraints of the message space recovering algorithm proposed by Coron and Notarnicola (Asiacrypt'19), so it enables us to directly apply the algorithm to the FRS obfuscation.

Then, we propose two cryptanalyses of the FRS obfuscation based on the recovered message space. One analysis enables to obtain all secret elements of CLT13, but it requires extra parameter constraints. On the other hand, the other analysis shows that there exist two functionally equivalent programs such that their obfuscated programs are computationally distinguishable. Thus, the FRS scheme does not satisfy the desired security without any additional constraints.

Category / Keywords: CLT13 multilinear map, FRS obfuscation, indistinguishable obfuscation, input partitionability, zeroizing attack.

Date: received 27 Oct 2019

Contact author: changmin lee at ens-lyon fr,tory154@snu ac kr

Available format(s): PDF | BibTeX Citation

Version: 20191028:082739 (All versions of this report)

Short URL: ia.cr/2019/1254


[ Cryptology ePrint archive ]