2011 · 89 citations · 9 references
ComputingComputer ScienceMathematicsCryptographyInformation TheoryTheory Of ComputationCryptographic AlgorithmsCryptographic ComplexityCryptographic ProtocolsInformation-theoretic SecurityPermutationsRandom Oracle ModelRandom Permutations
We consider the cryptographic problem of constructing an invertible random permutation from a public random function (i.e., which can be accessed by the adversary). This goal is formalized by the notion of indifferentiability of Maurer et al. (TCC 2004). This is the natural extension to the public setting of the well-studied problem of building random permutations from random functions, which was first solved by Luby and Rackoff (Siam J. Comput., '88) using the so-called Feistel construction. The most important implication of such a construction is the equivalence of the random oracle model (Bellare and Rogaway, CCS '93) and the ideal cipher model, which is typically used in the analysis of several constructions in symmetric cryptography.
9
Mihir Bellare, Phillip Rogaway · 1993 · 4.7K citations · Full text
Universally composable security: a new paradigm for cryptographic protocols
Ran Canetti · 2001 · 3.3K citations
The random oracle methodology, revisited
Ran Canetti, Oded Goldreich, Shai Halevi · Journal of the ACM · 2004 · 978 citations · Full text