@inproceedings{313f0b6cb8744e8c86c13963502f3169,
title = "Impossibility of VBB obfuscation with ideal constant-degree graded encodings",
abstract = "A celebrated result by Barak et al. (Crypto{\textquoteright}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{\textquoteright}15) extends this impossibility result to the random oracle model (assuming trapdoor permutations). In contrast, Brakerski-Rothblum (TCC{\textquoteright}14) and Barak et al. (Euro- Crypt{\textquoteright}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).",
author = "Rafael Pass and Abhi Shelat",
note = "Publisher Copyright: {\textcopyright} International Association for Cryptologic Research 2016.; 13th International Conference on Theory of Cryptography, TCC 2016 ; Conference date: 10-01-2016 Through 13-01-2016",
year = "2016",
doi = "10.1007/978-3-662-49096-9_1",
language = "الإنجليزيّة",
isbn = "9783662490952",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "3--17",
editor = "Eyal Kushilevitz and Tal Malkin",
booktitle = "Theory of Cryptography - 13th International Conference, TCC 2016-A, Proceedings",
address = "ألمانيا",
}