On obfuscation with random oracles

Ran Canetti; Yael Tauman Kalai; Omer Paneth

doi:10.1007/978-3-662-46497-7_18

On obfuscation with random oracles

Ran Canetti, Yael Tauman Kalai, Omer Paneth

School of Computer Science

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

18 Scopus citations

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 language	English
Title of host publication	Theory of Cryptography - 12th Theory of Cryptography Conference, TCC 2015, Proceedings
Editors	Yevgeniy Dodis, Jesper Buus Nielsen
Publisher	Springer Verlag
Pages	456-467
Number of pages	12
ISBN (Electronic)	9783662464960
DOIs	https://doi.org/10.1007/978-3-662-46497-7_18
State	Published - 2015
Event	12th Theory of Cryptography Conference, TCC 2015 - Warsaw, Poland Duration: 23 Mar 2015 → 25 Mar 2015

Publication series

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

Conference

Conference	12th Theory of Cryptography Conference, TCC 2015
Country/Territory	Poland
City	Warsaw
Period	23/03/15 → 25/03/15

Funding

Funders	Funder number
Israel Science Foundation	1523/14
National Science Foundation	1218461

Access to Document

10.1007/978-3-662-46497-7_18

Cite this

Canetti, R., Kalai, Y. T., & Paneth, O. (2015). On obfuscation with random oracles. In Y. Dodis, & J. B. Nielsen (Eds.), Theory of Cryptography - 12th Theory of Cryptography Conference, TCC 2015, Proceedings (pp. 456-467). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 9015). Springer Verlag. https://doi.org/10.1007/978-3-662-46497-7_18

Canetti, Ran ; Kalai, Yael Tauman ; Paneth, Omer. / On obfuscation with random oracles. Theory of Cryptography - 12th Theory of Cryptography Conference, TCC 2015, Proceedings. editor / Yevgeniy Dodis ; Jesper Buus Nielsen. Springer Verlag, 2015. pp. 456-467 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{d0775d10aefd4b81bc746f4c5057b522,

title = "On obfuscation with random oracles",

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

author = "Ran Canetti and Kalai, {Yael Tauman} and Omer Paneth",

note = "Publisher Copyright: {\textcopyright} International Association for Cryptologic Research 2015.; 12th Theory of Cryptography Conference, TCC 2015 ; Conference date: 23-03-2015 Through 25-03-2015",

year = "2015",

doi = "10.1007/978-3-662-46497-7_18",

language = "אנגלית",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "456--467",

editor = "Yevgeniy Dodis and Nielsen, {Jesper Buus}",

booktitle = "Theory of Cryptography - 12th Theory of Cryptography Conference, TCC 2015, Proceedings",

}

Canetti, R, Kalai, YT & Paneth, O 2015, On obfuscation with random oracles. in Y Dodis & JB Nielsen (eds), Theory of Cryptography - 12th Theory of Cryptography Conference, TCC 2015, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 9015, Springer Verlag, pp. 456-467, 12th Theory of Cryptography Conference, TCC 2015, Warsaw, Poland, 23/03/15. https://doi.org/10.1007/978-3-662-46497-7_18

On obfuscation with random oracles. / Canetti, Ran; Kalai, Yael Tauman; Paneth, Omer.
Theory of Cryptography - 12th Theory of Cryptography Conference, TCC 2015, Proceedings. ed. / Yevgeniy Dodis; Jesper Buus Nielsen. Springer Verlag, 2015. p. 456-467 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 9015).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - On obfuscation with random oracles

AU - Canetti, Ran

AU - Kalai, Yael Tauman

AU - Paneth, Omer

PY - 2015

Y1 - 2015

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

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

UR - http://www.scopus.com/inward/record.url?scp=84924401943&partnerID=8YFLogxK

U2 - 10.1007/978-3-662-46497-7_18

DO - 10.1007/978-3-662-46497-7_18

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:84924401943

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 456

EP - 467

BT - Theory of Cryptography - 12th Theory of Cryptography Conference, TCC 2015, Proceedings

A2 - Dodis, Yevgeniy

A2 - Nielsen, Jesper Buus

PB - Springer Verlag

T2 - 12th Theory of Cryptography Conference, TCC 2015

Y2 - 23 March 2015 through 25 March 2015

ER -

Canetti R, Kalai YT, Paneth O. On obfuscation with random oracles. In Dodis Y, Nielsen JB, editors, Theory of Cryptography - 12th Theory of Cryptography Conference, TCC 2015, Proceedings. Springer Verlag. 2015. p. 456-467. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-662-46497-7_18

On obfuscation with random oracles

Abstract

Publication series

Conference

Funding

Access to Document

Other files and links

Fingerprint

Cite this