@inproceedings{Maurer2002IndistinguishabilityOR,
title={Indistinguishability of Random Systems},
author={Ueli Maurer},
booktitle={EUROCRYPT},
year={2002}
}

An (X ,Y)-random system takes inputs X1, X2, . . . ∈ X and generates, for each new input Xi, an output Yi ∈ Y, depending probabilistically on X1, . . . , Xi and Y1, . . . , Yi−1. Many cryptographic systems like block ciphers, MAC-schemes, pseudo-random functions, etc., can be modeled as random systems, where in fact Yi often depends only on Xi, i.e., the system is stateless. The security proof of such a system (e.g. a block cipher) amounts to showing that it is indistinguishable from a certain… CONTINUE READING