1. M. Bellare, A note on negligible functions. J. Cryptol., 271–284 (2002). doi:
10.1007/s00145-002-0116-x
2. I. Berman, I. Haitner, From non-adaptive to adaptive pseudorandom functions, in Theory of Cryptography, 9th Theory of Cryptography Conference, TCC 2012 (2012), pp. 357–368
3. I. Berman, I. Haitner, I. Komargodski, M. Naor, Hardness preserving reductions via cuckoo hashing, in Theory of Cryptography, 10th Theory of Cryptography Conference, TCC 2013 (2013), pp. 40–59
4. L.J. Carter, M.N. Wegman, Universal classes of hash functions. J. Comput. Syst. Sci., 143–154 (1979). doi:
10.1145/800105.803400
5. C. Cho, C.-K. Lee, R. Ostrovsky, Equivalence of uniform key agreement and composition insecurity, in Advances in Cryptology – CRYPTO 2010 (2010), pp. 447–464