MarriageTheoremのこと

_ IACR ePrint 2016/208まで確認済み、ECCC 2003年分まで確認済み

_ 気になった論文：To Save the Wilting Multilinear Maps, Yilei Chen, http://eprint.iacr.org/2016/200

In this paper, we initiate the study of ``homomorphic obfuscation", and show how to homomorphically obfuscate the kernel-test and affine subspace-test functionalities of high dimensional matrices. Namely, the evaluator is able to perform additions and multiplications over the obfuscated matrices, and test subspace memberships on the resulting code. The homomorphic operations are constrained by the prescribed data structure, e.g. a tree or a graph, where the matrices are stored. The security properties of all the constructions are based on the hardness of Learning with errors problem (LWE). The technical heart is to ``control" the ``chain reactions'' over a sequence of LWE instances.

Viewing the homomorphic obfuscation scheme from a different angle, it coincides with the graph-induced multilinear maps proposed by Gentry, Gorbunov and Halevi (GGH15). Our proof technique recognizes several ``safe modes" of GGH15 that are not known before, including a simple special case: if the graph is acyclic and the matrices are sampled independently from binary or error distributions, then the encodings of the matrices are pseudorandom. We further discuss the implication of our work for the landscape of cryptographic multilinear maps and program obfuscators.