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] ⊆ ¬...

Full description

Bibliographic Details
Main Authors: Brakerski, Zvika, Vaikuntanathan, Vinod, Wee, Hoeteck, Wichs, Daniel
Other Authors: Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Format: Article
Language:en_US
Published: Association for Computing Machinery 2017
Online Access:http://hdl.handle.net/1721.1/112985
https://orcid.org/0000-0002-2666-0045

Internet

http://hdl.handle.net/1721.1/112985
https://orcid.org/0000-0002-2666-0045

Similar Items