TU Darmstadt / ULB / TUbiblio

Random-Oracle Uninstantiability from Indistinguishability Obfuscation

Brzuska, Christina and Farshim, Pooya and Mittelbach, Arno Dodis, Yevgeniy and Nielsen, Arno Buus (eds.) (2015):
Random-Oracle Uninstantiability from Indistinguishability Obfuscation.
In: Lecture Notes in Computer Science 9015, In: Theory of Cryptography. TCC 2015., Springer, Warsaw, Poland, pp. 428-455, ISBN 978-3-662-46497-7,
DOI: 10.1007/978-3-662-46497-7_17,
[Conference or Workshop Item]

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.

Item Type: Conference or Workshop Item
Erschienen: 2015
Editors: Dodis, Yevgeniy and Nielsen, Arno Buus
Creators: Brzuska, Christina and Farshim, Pooya and Mittelbach, Arno
Title: Random-Oracle Uninstantiability from Indistinguishability Obfuscation
Language: German
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.

Title of Book: Theory of Cryptography. TCC 2015.
Series Name: Lecture Notes in Computer Science 9015
Publisher: Springer
ISBN: 978-3-662-46497-7
Uncontrolled Keywords: Random oracle, uninstantiability, indistinguishability ob- fuscation, deterministic encryption, UCE, Fujisaki–Okamoto transform, KDM security, message-locked encryption
Divisions: Profile Areas > Cybersecurity (CYSEC)
Profile Areas
Event Location: Warsaw, Poland
Date Deposited: 14 Aug 2017 14:38
DOI: 10.1007/978-3-662-46497-7_17
Identification Number: TUD-CS-2015-12087
Export:
Suche nach Titel in: TUfind oder in Google
Send an inquiry Send an inquiry

Options (only for editors)

View Item View Item