A celebrated result by Barak et al. (Crypto’01) shows the impossibility of general-purpose virtual black-box (VBB) obfuscation in the plain model. A recent work by Canetti, Kalai, and Paneth (TCC’15) extends this impossibility result to the random oracle model (assuming trapdoor permutations). In contrast, Brakerski-Rothblum (TCC’14) and Barak et al. (Euro- Crypt’14) show that in idealized graded encoding models, general-purpose VBB obfuscation indeed is possible; these constructions require graded encoding schemes that enable evaluating high-degree (polynomial in the size of the circuit to be obfuscated) polynomials on encodings. We show a complementary impossibility of general-purpose VBB obfuscation in idealized graded encoding models that enable only evaluation of constant-degree polynomials (assuming trapdoor permutations).
CITATION STYLE
Pass, R., & Shelat, A. (2016). Impossibility of VBB obfuscation with ideal constant-degree graded encodings. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9562, pp. 3–17). Springer Verlag. https://doi.org/10.1007/978-3-662-49096-9_1
Mendeley helps you to discover research relevant for your work.