TY - JOUR

T1 - On Virtual Grey Box Obfuscation for General Circuits

AU - Bitansky, Nir

AU - Canetti, Ran

AU - Kalai, Yael Tauman

AU - Paneth, Omer

N1 - Publisher Copyright:
© 2016, Springer Science+Business Media New York.

PY - 2017/12/1

Y1 - 2017/12/1

N2 - An obfuscator O is Virtual Grey Box (VGB) for a class C of circuits if, for any C∈ C and any predicate π, deducing π(C) given O(C) is tantamount to deducing π(C) given unbounded computational resources and polynomially many oracle queries to C. VGB obfuscation is often significantly more meaningful than indistinguishability obfuscation (IO). In fact, for some circuit families of interest VGB is equivalent to full-fledged Virtual Black Box obfuscation. We investigate the feasibility of obtaining VGB obfuscation for general circuits. We first formulate a natural strengthening of IO, called strong IO (SIO). Essentially, O is SIO for class C if O(C0) ≈ O(C1) whenever the pair (C0, C1) is taken from a distribution over C where, for all x, C0(x) ≠ C1(x) only with negligible probability. We then show that an obfuscator is VGB for a class C if and only if it is SIO for C. This result is unconditional and holds for any C. We also show that, for some circuit collections, SIO implies virtual black-box obfuscation. Finally, we formulate a slightly stronger variant of the semantic security property of graded encoding schemes [Pass-Seth-Telang Crypto 14], and show that existing obfuscators, such as the obfuscator of Barak et al. [Eurocrypt 14], are SIO for all circuits in NC1, assuming that the underlying graded encoding scheme satisfies our variant of semantic security. Put together, we obtain VGB obfuscation for allNC1circuits under assumptions that are almost the same as those used by Pass et al. to obtain IO forNC1circuits. We also observe that VGB obfuscation for all polynomial-size circuits implies the existence of semantically-secure graded encoding schemes with limited functionality known as jigsaw puzzles.

AB - An obfuscator O is Virtual Grey Box (VGB) for a class C of circuits if, for any C∈ C and any predicate π, deducing π(C) given O(C) is tantamount to deducing π(C) given unbounded computational resources and polynomially many oracle queries to C. VGB obfuscation is often significantly more meaningful than indistinguishability obfuscation (IO). In fact, for some circuit families of interest VGB is equivalent to full-fledged Virtual Black Box obfuscation. We investigate the feasibility of obtaining VGB obfuscation for general circuits. We first formulate a natural strengthening of IO, called strong IO (SIO). Essentially, O is SIO for class C if O(C0) ≈ O(C1) whenever the pair (C0, C1) is taken from a distribution over C where, for all x, C0(x) ≠ C1(x) only with negligible probability. We then show that an obfuscator is VGB for a class C if and only if it is SIO for C. This result is unconditional and holds for any C. We also show that, for some circuit collections, SIO implies virtual black-box obfuscation. Finally, we formulate a slightly stronger variant of the semantic security property of graded encoding schemes [Pass-Seth-Telang Crypto 14], and show that existing obfuscators, such as the obfuscator of Barak et al. [Eurocrypt 14], are SIO for all circuits in NC1, assuming that the underlying graded encoding scheme satisfies our variant of semantic security. Put together, we obtain VGB obfuscation for allNC1circuits under assumptions that are almost the same as those used by Pass et al. to obtain IO forNC1circuits. We also observe that VGB obfuscation for all polynomial-size circuits implies the existence of semantically-secure graded encoding schemes with limited functionality known as jigsaw puzzles.

KW - Cryptography

KW - Learning

KW - Obfuscation

KW - Simulation

UR - http://www.scopus.com/inward/record.url?scp=84988728260&partnerID=8YFLogxK

U2 - 10.1007/s00453-016-0218-8

DO - 10.1007/s00453-016-0218-8

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:84988728260

SN - 0178-4617

VL - 79

SP - 1014

EP - 1051

JO - Algorithmica

JF - Algorithmica

IS - 4

ER -