Name
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]. |
Year | DOI | Venue |
|---|---|---|
2015 | 10.1007/978-3-662-46497-7_18 | Lecture Notes in Computer Science |
DocType | Volume | ISSN |
Journal | 9015 | 0302-9743 |
Citations | PageRank | References |
14 | 0.51 | 18 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Ran Canetti | 1 | 11355 | 764.53 |
| Yael Tauman Kalai | 2 | 2502 | 104.65 |
| Omer Paneth | 3 | 535 | 22.42 |