Implementing Conjunction Obfuscation under Entropic Ring LWE

Explore a groundbreaking implementation of secure program obfuscation for conjunction programs based on the entropic Ring Learning with Errors (Ring-LWE) assumption. Delve into the first practical realization of non-trivial program obfuscation using polynomial rings, presented at the 2018 IEEE Symposium on Security & Privacy. Discover the design and implementation advances that significantly reduce program size, obfuscation runtime, and evaluation runtime. Learn about the achieved performance metrics, including the ability to obfuscate a 64-bit conjunction program in 6.7 hours and evaluate it in 2.5 seconds. Examine the practical implications of obfuscating a 32-bit conjunction program with 53 bits of security in just 7 minutes. Gain insights into the graph-induced encoding implementation that runs up to 25 levels, surpassing previous literature. Understand how these advancements can be applied to obfuscating more general compute-and-compare programs and various cryptographic schemes based on lattice trapdoors.