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...
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: | |
Online Access: | Get fulltext |
Similar Items
-
Private Constrained PRFs (and More) from LWE
by: Brakerski, Zvika, et al.
Published: (2021) -
Efficient Fully Homomorphic Encryption from (Standard) LWE
by: Brakerski, Zvika, et al.
Published: (2018) -
Circuit-ABE from LWE: Unbounded Attributes and Semi-adaptive Security
by: Brakerski, Zvika, et al.
Published: (2017) -
Predicate Encryption for Circuits from LWE
by: Gorbunov, Sergey, et al.
Published: (2017) -
Obfuscation of Probabilistic Circuits and Applications
by: Ananth, Prabhanjan, et al.
Published: (2021)