Cryptology ePrint Archive: Report 2015/048

On Obfuscation with Random Oracles

Ran Canetti and Yael Tauman Kalai and Omer Paneth

Abstract: Assuming trapdoor permutations, we show that there exist function families that cannot be VBB-obfuscated even if both the obfuscator and the obfuscated program have access to a random oracle. Specifically, these families are the robust unobfuscatable families of [Bitansky-Paneth, STOC 13].

Our result stands in contrast to the general VBB obfuscation algorithms in more structured idealized models where the oracle preserves certain algebraic homomorphisms [Canetti-Vaikuntanathan, ePrint 13; Brakerski-Rothblum, TCC 14; Barak et al., Eurocrypt 14].

Category / Keywords:

Original Publication (with minor differences): IACR-TCC-2015

Date: received 20 Jan 2015

Contact author: omer at bu edu

Available format(s): PDF | BibTeX Citation

Version: 20150122:170959 (All versions of this report)

Short URL:

Discussion forum: Show discussion | Start new discussion

[ Cryptology ePrint archive ]