Paper 2015/383
Impossibility of VBB Obfuscation with Ideal Constant-Degree Graded Encodings
Rafael Pass and abhi shelat
Abstract
A celebrated result by Barak et al (JACM’12) 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 result also to the random oracle model (assuming trapdoor per- mutations). In contrast, Brakerski-Rothblum (TCC’15) and Barak et al (EuroCrypt’14) show that in idealized graded encoding models, general-purpose VBB obfuscation indeed is possible; these construction 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).
Metadata
- Available format(s)
-
PDF
- Category
- Foundations
- Publication info
- Preprint. MINOR revision.
- Keywords
- VBB obfuscationgraded encodings
- Contact author(s)
- rafael @ cs cornell edu
- History
- 2015-04-28: received
- Short URL
- https://ia.cr/2015/383
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2015/383,
author = {Rafael Pass and abhi shelat},
title = {Impossibility of {VBB} Obfuscation with Ideal Constant-Degree Graded Encodings},
howpublished = {Cryptology {ePrint} Archive, Paper 2015/383},
year = {2015},
url = {https://eprint.iacr.org/2015/383}
}
