Advertisement
Published in:
2014 | OriginalPaper | Chapter
Bootstrapping Obfuscators via Fast Pseudorandom Functions
Author : Benny Applebaum
Published in: Advances in Cryptology – ASIACRYPT 2014
Publisher: Springer Berlin Heidelberg
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
We show that it is possible to upgrade an obfuscator for a weak complexity class
WEAK
into an obfuscator for arbitrary polynomial size circuits, assuming that the class
WEAK
can compute pseudorandom functions. Specifically, under standard intractability assumptions (e.g., hardness of factoring, Decisional Diffie-Hellman, or Learning with Errors), the existence of obfuscators for
NC
1
or even
TC
0
implies the existence of general-purpose obfuscators for
P
. Previously, such a bootstrapping procedure was known to exist under the assumption that there exists a fully-homomorphic encryption whose decryption algorithm can be computed in
WEAK
. Our reduction works with respect to virtual black-box obfuscators and relativizes to ideal models..