Sciweavers

Share
TCC
2014
Springer

Virtual Black-Box Obfuscation for All Circuits via Generic Graded Encoding

5 years 3 months ago
Virtual Black-Box Obfuscation for All Circuits via Generic Graded Encoding
We present a new general-purpose obfuscator for all polynomial-size circuits. The obfuscator uses graded encoding schemes, a generalization of multilinear maps. We prove that the obfuscator exposes no more information than the program’s black-box functionality, and achieves virtual black-box security, in the generic graded encoded scheme model. This proof is under the Bounded Speedup Hypothesis (BSH, a plausible worst-case complexity-theoretic assumption related to the Exponential Time Hypothesis), in addition to standard cryptographic assumptions. We also show that the weaker notion of indistinguishability obfuscation can be achieved without BSH. Very recently, Garg et al. (FOCS 2013) used graded encoding schemes to present a candidate obfuscator for indistinguishability obfuscation. They posed the problem of constructing a provably secure indistinguishability obfuscator in the generic graded encoding scheme model. Our obfuscator resolves this problem. Indeed, under BSH it achieves...
Zvika Brakerski, Guy N. Rothblum
Added 27 Apr 2014
Updated 27 Apr 2014
Type Journal
Year 2014
Where TCC
Authors Zvika Brakerski, Guy N. Rothblum
Comments (0)
books