Brzuska, Christina ; Farshim, Pooya ; Mittelbach, Arno
Hrsg.: Dodis, Yevgeniy ; Nielsen, Arno Buus (2015)
Random-Oracle Uninstantiability from Indistinguishability Obfuscation.
Warsaw, Poland
doi: 10.1007/978-3-662-46497-7_17
Konferenzveröffentlichung, Bibliographie
Kurzbeschreibung (Abstract)
Assuming the existence of indistinguishability obfuscation (iO), we show that a number of prominent transformations in the randomoracle model are uninstantiable in the standard model. We start by showing that the Encrypt-with-Hash transform of Bellare, Boldyreva and O’Neill (CRYPTO 2007) for converting randomized public-key encryption schemes to deterministic ones is not instantiable in the standard model. To this end, we build on the recent work of Brzuska, Farshim and Mittelbach (CRYPTO 2014) and rely on the existence of iO for Turing machines or for circuits to derive two flavors of uninstantiability. The techniques that we use to establish this result are flexible and lend themselves to a number of other transformations such as the classical Fujisaki–Okamoto transform (CRYPTO 1998) and transformations akin to those by Bellare and Keelveedhi (CRYPTO 2011) and Douceur et al. (ICDCS 2002) for obtaining KDM-secure encryption and de-duplication schemes respectively. Our results call for a re-assessment of scheme design in the random-oracle model and highlight the need for new transforms that do not suffer from iO-based attacks.
| Typ des Eintrags: | Konferenzveröffentlichung |
|---|---|
| Erschienen: | 2015 |
| Herausgeber: | Dodis, Yevgeniy ; Nielsen, Arno Buus |
| Autor(en): | Brzuska, Christina ; Farshim, Pooya ; Mittelbach, Arno |
| Art des Eintrags: | Bibliographie |
| Titel: | Random-Oracle Uninstantiability from Indistinguishability Obfuscation |
| Sprache: | Deutsch |
| Publikationsjahr: | März 2015 |
| Verlag: | Springer |
| Buchtitel: | Theory of Cryptography. TCC 2015. |
| Reihe: | Lecture Notes in Computer Science 9015 |
| Veranstaltungsort: | Warsaw, Poland |
| DOI: | 10.1007/978-3-662-46497-7_17 |
| Kurzbeschreibung (Abstract): | Assuming the existence of indistinguishability obfuscation (iO), we show that a number of prominent transformations in the randomoracle model are uninstantiable in the standard model. We start by showing that the Encrypt-with-Hash transform of Bellare, Boldyreva and O’Neill (CRYPTO 2007) for converting randomized public-key encryption schemes to deterministic ones is not instantiable in the standard model. To this end, we build on the recent work of Brzuska, Farshim and Mittelbach (CRYPTO 2014) and rely on the existence of iO for Turing machines or for circuits to derive two flavors of uninstantiability. The techniques that we use to establish this result are flexible and lend themselves to a number of other transformations such as the classical Fujisaki–Okamoto transform (CRYPTO 1998) and transformations akin to those by Bellare and Keelveedhi (CRYPTO 2011) and Douceur et al. (ICDCS 2002) for obtaining KDM-secure encryption and de-duplication schemes respectively. Our results call for a re-assessment of scheme design in the random-oracle model and highlight the need for new transforms that do not suffer from iO-based attacks. |
| Freie Schlagworte: | Random oracle, uninstantiability, indistinguishability ob- fuscation, deterministic encryption, UCE, Fujisaki–Okamoto transform, KDM security, message-locked encryption |
| ID-Nummer: | TUD-CS-2015-12087 |
| Fachbereich(e)/-gebiet(e): | Profilbereiche > Cybersicherheit (CYSEC) Profilbereiche |
| Hinterlegungsdatum: | 14 Aug 2017 14:38 |
| Letzte Änderung: | 15 Mai 2018 10:33 |
| PPN: | |
| Export: | |
| Suche nach Titel in: | TUfind oder in Google |
 |
Frage zum Eintrag |
Optionen (nur für Redakteure)
 |
Redaktionelle Details anzeigen |
Drucken
Impressum