Practical implementations of program obfuscators for point functions
Practical implementations of program obfuscators for point functions
复制标题
DOI：
10.1109/hpcsim.2016.7568371
复制
发表时间：
2016-07
期刊：
影响因子：
--
通讯作者：
G. D. Crescenzo;L. Bahler;B. Coan;Y. Polyakov;Kurt Rohloff;David Cousins
中科院分区：
文献类型：
--
作者：
G. D. Crescenzo;L. Bahler;B. Coan;Y. Polyakov;Kurt Rohloff;David Cousins
点函数混淆器最近被证明是在密码学中常用的硬度假设下可证明的程序混淆器的第一个例子。这是值得注意的，在这方面的早期结果，显示不可能的一个单一的混淆解决方案的所有程序。点函数可以看作是如果输入值等于程序中存储的秘密值则返回1，否则返回0的函数。在本文中，我们从文献中选择代表性的点函数混淆器，陈述其理论保证，并报告其（略）优化的实现。我们表明，实现点函数混淆，满足不同的混淆概念，可以使用实际的性能保证。由于我们的设计和编码优化，值得注意的实现结果是：（a）基于群论的非常快速的混淆器，以及（B）基于格理论的混淆器，运行时间<; 8秒，使用廉价的计算资源。
Point function obfuscators have recently been shown to be the first examples of program obfuscators provable under hardness assumptions commonly used in cryptography. This is remarkable, in light of early results in this area, showing impossibility of a single obfuscation solution for all programs. Point functions can be seen as functions that return 1 if the input value is equal to a secret value stored in the program, and 0 otherwise. In this paper, we select representative point function obfuscators from the literature, state their theoretical guarantees, and report on their (slightly) optimized implementations. We show that implementations of point function obfuscators, satisfying different obfuscation notions, can be used with practical performance guarantees. Notable implementation results due to our design and coding optimizations are: (a) very fast obfuscators based on group theory, and (b) obfuscators based on lattice theory with running time <; 8s, using inexpensive computing resources.