On the Round Security of Symmetric-Key Cryptographic Primitives (2000)

by Zulfikar Ramzan , Leonid Reyzin
Venue:In Advances in Cryptology — CRYPTO ’00, volume 1880 of LNCS
Citations:10 - 1 self

Documents Related by Co-Citation

285 How to construct pseudorandom permutations from pseudorandom functions – M Luby, C Racko� - 1988
627 How to Construct Random Functions – O Goldreich S Goldwasser, S Micali - 1986
502 Differential Cryptanalysis of DES-like Cryptosystems – Eli Biham, Adi Shamir - 1991
93 On the Construction of Pseudo-Random Permutations: Luby-Rackoff Revisited – Moni Naor , Omer Reingold - 1997
1341 Random Oracles are Practical: A Paradigm for Designing Efficient Protocols – Mihir Bellare, Phillip Rogaway - 1995
797 Communication theory of secrecy systems – C Shannon - 1949
370 A hard-core predicate for all one-way functions – Oded Goldreich, Leonid A. Levint - 1989
48 A Construction of a Cipher From a Single Pseudorandom Permutation – Shimon Even, Yishay Mansour - 1991
673 Universal classes of hash functions – J Lawrence Carter, Mark N Wegman - 1979