Abstract
We construct an indistinguishability obfuscation (IO) scheme for all polynomial-size circuits from constant-degree graded encoding schemes, assuming the existence of a subexponentially secure pseudo-random generator computable by constant-degree arithmetic circuits, and the subexponential hardness of the Learning With Errors (LWE) problems. Previously, all candidate general purpose IO schemes rely on polynomial-degree graded encoding schemes.
Cite
CITATION STYLE
Lin, H. (2016). Indistinguishability obfuscation from constant-degree graded encoding schemes. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9665, pp. 28–57). Springer Verlag. https://doi.org/10.1007/978-3-662-49890-3_2
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
