Indifferentiability, Impossibility Results on Reductions, and Applications to the Random Oracle Methodology
By Ueli M. Maurer, Renato Renner, Clemens Holenstein. Theory of Cryptography Conference, 2004
544 citations recorded by the source corpus.
Subfields: Artificial Intelligence, Information Systems
View Paper: https://www.semanticscholar.org/paper/3a31dcd912d6e827b9bf3ec75808f7b11066e2df
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Artificial Intelligence
- Mihir Bellare
- Jens Groth
- Dan Boneh
- Thomas Ristenpart
- Phillip Rogaway
- Sriram Keelveedhi
- Benedikt Bünz
- Brent Waters
In Information Systems
- Benedikt Bünz
- Jens Groth
- Ben Fisch
- Dan Boneh
- Mihir Bellare
- Joseph Bonneau
- Thomas Ristenpart
- Sriram Keelveedhi
Citations in the corpus
- On the Indifferentiability of the Sponge Construction (2008, methodology): “The indifferentiability framework was introduced by Maurer et al. in [ 14 ] and is an extension of the classical notion of indistinguishability.”
- Cryptographic Extraction and Key Derivation: The HKDF Scheme (2010, methodology): “Fortunately, as shown in [12] (using the framework of indifferentiability from [ 29 ]), the HMAC structure preserves randomness in the sense that if the underlying compression function (computed on fixed length inputs) is modeled as a random oracle so is HMAC on variable length inputs ([12] claims t”
- Short Pairing-Based Non-interactive Zero-Knowledge Arguments (2010, background): “Unfortunately, there are several examples of protocols that are secure in the random oracle model, but do not have any secure standard model instantiation no matter which hash-function is used [9,10,34,3,37].”
- The Skein Hash Function Family (2009, background): “Indifferentiability [72, 24] is a technical term underlain by a formal definition.”
- Efficient Garbling from a Fixed-Key Blockcipher (2013, background): “One possibility is to build H from π in a manner that will render H indifferentiable from a RO [16, 33].”
- Verifiable Delay Functions (2018, background): “Demonstrating a construction from a σ -sequential VDF and random oracle H that is provably indi ff erentiable [53] from a Random Delay Oracle is an interesting research question.”
- Foundations of garbled circuits (2012, background): “One possibility is to build H from π in a manner that will render H indifferentiable from a RO [33, 73].”
- Message-Locked Encryption and Secure Deduplication (2013, background): “Note that SHA-256 is not indifferentiable from a RO [38].”