Indistinguishability obfuscation from well-founded assumptions
Indistinguishability obfuscation from well-founded assumptions
复制标题
DOI：
10.1145/3611095
复制
发表时间：
2020-08
影响因子：
22.7
通讯作者：
Aayush Jain;Huijia Lin;A. Sahai
中科院分区：
文献类型：
--
作者：
Aayush Jain;Huijia Lin;A. Sahai
至少自从基于计算难度猜想的公钥密码学的最初公开提议以来，密码学家们一直在考虑一种将计算机程序翻译成“难以理解的”但等价的形式的“单向编译器”的可能性。然而，几十年来，寻找这样的“单向编译器”仍然难以捉摸。我们用不可区分混淆(IO)的概念来检验这一概念的形式化。粗略地说，IO要求任何两个等价程序的编译版本(具有相同的大小和运行时间)与任何有效的对手没有区别。最后，我们展示了如何基于密码学中广泛研究的计算难度猜想来构造IO，从而证明我们的IO方案是安全的。
At least since the initial public proposal of public-key cryptography based on computational hardness conjectures, cryptographers have contemplated the possibility of a "one-way compiler" that translates computer programs into "incomprehensible" but equivalent forms. And yet, the search for such a "one-way compiler" remained elusive for decades. We examine a formalization of this concept with the notion of indistinguishability obfuscation (iO). Roughly speaking, iO requires that the compiled versions of any two equivalent programs (with the same size and running time) be indistinguishable from any efficient adversary. Finally, we show how to construct iO in such a way that we can prove the security of our iO scheme based on well-studied computational hardness conjectures in cryptography.