Composition of random systems: When two weak make one strong

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2951, Issue , 2004, Pages 410-427

  Maurer, Ueli ^a   Pietrzak, Krzysztof ^a  

^a ETH ZURICH   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTERS;

COMPONENT SYSTEMS; DE CORRELATIONS; DISTINGUISHERS; INDISTINGUISHABILITY; PROBABILITY SPACES; PSEUDORANDOMNESS; RANDOM PERMUTATIONS; RANDOM SYSTEMS;

COMPUTATION THEORY;

EID: 26944444779     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24638-1_23     Document Type: Article

References (8)

1. N. Alon, O. Goldreich, J. Hastad, R. Peralta, Simple construction of almost k-wise independent random variables, Random Structures and Algorithms, vol. 3, no. 3, pp. 289-304, 1992.
2. M. Luby and C. Rackoff, How to construct pseudo-random permutations from pseudo-random functions, SIAM J. on Computing, vol. 17, no. 2, pp. 373-386, 1988.
3. U. Maurer, Indistinguishability of random systems, Advances in Cryptology - EUROCRYPT '02, Lecture Notes in Computer Science, vol. 2332, pp. 110-132, Springer-Verlag, 2002.
4. U. Maurer and K. Pietrzak, The security of many-round Luby-Rackoff pseudorandom permutations, Advances in Cryptology - EUROCRYPT '03, Lecture Notes in Computer Science, vol. 2656, pp. 544-561, Springer-Verlag, 2003.
5. J. Naor and M. Naor, Small-bias probability spaces: Efficient constructions and applications, SIAM Journal on Computing, vol. 22, no. 4, pp. 838-356, 1993.
6. R. Renner, The Statistical Distance of Independently Repeated Experiments, Manuscript, available at http://www.crypto.ethz.ch/~renner/ publications.html
7. S. Vaudenay, Provable security for block ciphers by decorrelation, Proceedings of STACS'98, Lecture Notes in Computer Science, vol. 1373, Springer-Verlag, pp. 249-275, 1998.
8. S. Vaudenay, Adaptive-attack norm for decorrelation and super-pseudorandomness, Proc. of SAC'99, Lecture Notes in Computer Science, vol. 1758, pp. 49-61, Springer-Verlag, 2000.