Obfuscating Conjunctions under Entropic Ring LWE

Obfuscating Conjunctions under Entropic Ring LWE

We show how to securely obfuscate conjunctions, which are functions f(x[subscript 1], . . . , x[subscript n]) = ∧[subscript i∈I] y[superscript i] where I ⊆ [n] and each literal y[subscript i] is either just x[subscript i] or ¬x[subscript i] e.g., f(x[subscript 1], . . . , x_n) = x[subscript 1] ⊆ ¬ x...

Full description

Bibliographic Details
Main Authors: Brakerski, Zvika (Author), Vaikuntanathan, Vinod (Contributor), Wee, Hoeteck (Author), Wichs, Daniel (Author)
Other Authors: Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science (Contributor)
Format: Article
Language:English
Published: Association for Computing Machinery, 2017-12-29T19:18:44Z.
Subjects:
Article
Online Access:Get fulltext

Internet

Get fulltext

Similar Items