Cryptology ePrint Archive: Report 2017/844

Implementing Conjunction Obfuscation under Entropic Ring LWE

David Bruce Cousins and Giovanni Di Crescenzo and Kamil Doruk Gür and Kevin King and Yuriy Polyakov and Kurt Rohloff and Gerard W. Ryan and Erkay Savaş

Abstract: We address the practicality challenges of secure program obfuscation by implementing, optimizing, and experimentally assessing an approach to securely obfuscate conjunction programs proposed in [1]. Conjunction programs evaluate functions $f\left(x_1,\ldots,x_L\right) = \bigwedge_{i \in I} y_i$, where $y_i$ is either $x_i$ or $\lnot x_i$ and $I \subseteq \left[L\right]$, and can be used as classifiers. Our obfuscation approach satisfies distributional Virtual Black Box (VBB) security based on reasonable hardness assumptions, namely an entropic variant of the Ring Learning with Errors (Ring-LWE) assumption. Prior implementations of secure program obfuscation techniques support either trivial programs like point functions, or support the obfuscation of more general but less efficient branching programs to satisfy Indistinguishability Obfuscation (IO), a weaker security model. Further, the more general implemented techniques, rather than relying on standard assumptions, base their security on conjectures that have been shown to be theoretically vulnerable.

Our work is the first implementation of non-trivial program obfuscation based on polynomial rings. Our contributions include multiple design and implementation advances resulting in reduced program size, obfuscation runtime, and evaluation runtime by many orders of magnitude. We implement our design in software and experimentally assess performance in a commercially available multi-core computing environment. Our implementation achieves runtimes of 6.7 hours to securely obfuscate a 64-bit conjunction program and 2.5 seconds to evaluate this program over an arbitrary input. We are also able to obfuscate a 32-bit conjunction program with 53 bits of security in 7 minutes and evaluate the obfuscated program in 43 milliseconds on a commodity desktop computer, which implies that 32-bit conjunction obfuscation is already practical. Our graph-induced (directed) encoding implementation runs up to 25 levels, which is higher than previously reported in the literature for this encoding. Our design and implementation advances are applicable to obfuscating more general compute-and-compare programs and can also be used for many cryptographic schemes based on lattice trapdoors.

Category / Keywords: implementation / lattice techniques, program obfuscation, conjunction

Original Publication (in the same form): To appear in the Proceedings of the IEEE Symposium on Security & Privacy, May 2018

Date: received 1 Sep 2017, last revised 8 Dec 2017

Contact author: polyakov at njit edu

Available format(s): PDF | BibTeX Citation

Version: 20171208:215420 (All versions of this report)

Short URL: ia.cr/2017/844

Discussion forum: Show discussion | Start new discussion


[ Cryptology ePrint archive ]