Paper 2015/048

On Obfuscation with Random Oracles

Ran Canetti, 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].

Metadata
Available format(s)
PDF
Publication info
A minor revision of an IACR publication in TCC 2015
Contact author(s)
omer @ bu edu
History
2015-01-22: received
Short URL
https://ia.cr/2015/048
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2015/048,
      author = {Ran Canetti and Yael Tauman Kalai and Omer Paneth},
      title = {On Obfuscation with Random Oracles},
      howpublished = {Cryptology ePrint Archive, Paper 2015/048},
      year = {2015},
      note = {\url{https://eprint.iacr.org/2015/048}},
      url = {https://eprint.iacr.org/2015/048}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.