On obfuscation with random oracles

Ran Canetti, Yael Tauman Kalai, Omer Paneth

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

International Association for Cryptologic Research 2015.

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].

Original languageEnglish
Title of host publicationTheory of Cryptography - 12th Theory of Cryptography Conference, TCC 2015, Proceedings
EditorsYevgeniy Dodis, Jesper Buus Nielsen
PublisherSpringer Verlag
Pages456-467
Number of pages12
ISBN (Electronic)9783662464960
DOIs
StatePublished - 2015
Event12th Theory of Cryptography Conference, TCC 2015 - Warsaw, Poland
Duration: 23 Mar 201525 Mar 2015

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume9015
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference12th Theory of Cryptography Conference, TCC 2015
Country/TerritoryPoland
CityWarsaw
Period23/03/1525/03/15

Fingerprint

Dive into the research topics of 'On obfuscation with random oracles'. Together they form a unique fingerprint.

Cite this