TY - GEN
T1 - Practical implementations of program obfuscators for point functions
AU - Di Crescenzo, Giovanni
AU - Bahler, Lisa
AU - Coan, Brian
AU - Polyakov, Yuriy
AU - Rohloff, Kurt
AU - Cousins, David B.
N1 - Publisher Copyright:
© 2016 IEEE.
PY - 2016/9/13
Y1 - 2016/9/13
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=84991734870&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84991734870&partnerID=8YFLogxK
U2 - 10.1109/HPCSim.2016.7568371
DO - 10.1109/HPCSim.2016.7568371
M3 - Conference contribution
AN - SCOPUS:84991734870
T3 - 2016 International Conference on High Performance Computing and Simulation, HPCS 2016
SP - 460
EP - 467
BT - 2016 International Conference on High Performance Computing and Simulation, HPCS 2016
A2 - Zeljkovic, Vesna
A2 - Smari, Waleed W.
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 14th International Conference on High Performance Computing and Simulation, HPCS 2016
Y2 - 18 July 2016 through 22 July 2016
ER -