Indistinguishability of Random Systems

@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
Highly Influential
This paper has highly influenced 20 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS
Highly Cited
This paper has 206 citations. REVIEW CITATIONS
132 Citations
16 References
Similar Papers

Citations

Publications citing this paper.
Showing 1-10 of 132 extracted citations

207 Citations

01020'02'05'09'13'17
Citations per Year
Semantic Scholar estimates that this publication has 207 citations based on the available data.

See our FAQ for additional information.

Similar Papers

Loading similar papers…