Indifferentiability, Impossibility Results on Reductions, and Applications to the Random Oracle Methodology
Ueli Maurer, Renato Renner, and Clemens Holenstein
The goals of this paper are two-fold. First we introduce and motivate a generalization of the fundamental concept of the indistinguishability of two systems, called indifferentiability. This immediately leads to a generalization of the related notion of reducibility of one system to another. In contrast to the conventional notion of indistinguishability, indifferentiability is applicable in settings where a possible adversary is assumed to have access to additional information about the internal state of the involved systems, for instance the public parameter selecting a member from a family of hash functions. Second, we state an easily verifiable criterion for a system
BibTeX Citation
@inproceedings{MaReHo04, author = {Ueli Maurer and Renato Renner and Clemens Holenstein}, title = {Indifferentiability, Impossibility Results on Reductions, and Applications to the Random Oracle Methodology}, editor = {Moni Naor}, booktitle = {Theory of Cryptography Conference --- TCC 2004}, pages = {21--39}, series = {Lecture Notes in Computer Science}, volume = {2951}, year = {2004}, month = {2}, publisher = {Springer-Verlag}, }