Cryptology ePrint Archive: Report 2013/563

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

Zvika Brakerski and Guy N. Rothblum

Abstract: 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 {\em 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 {\em 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 the stronger notion of virtual black box security, which is our focus in this work.

Our construction is different from that of Garg et al., but is inspired by it, in particular by their use of permutation branching programs. We obtain our obfuscator by developing techniques used to obfuscate $d$-CNF formulas (ePrint 2013), and applying them to permutation branching programs. This yields an obfuscator for the complexity class $NC^1$. We then use homomorphic encryption to obtain an obfuscator for any polynomial-size circuit.

Category / Keywords: secret-key cryptography / Obfuscation

Date: received 4 Sep 2013, last revised 30 Sep 2013

Contact author: rothblum at alum mit edu

Available format(s): PDF | BibTeX Citation

Version: 20130930:144231 (All versions of this report)

Short URL: ia.cr/2013/563

Discussion forum: Show discussion | Start new discussion