1. Ajtai, M.: Generating hard instances of lattice problems (extended abstract). In: Proceedings of the Twenty-Eighth Annual ACM Symposium on the Theory of Computing (STOC 1996), pp. 99–108 (1996)
2. Alekhnovich, M.: More on average case vs approximation complexity. In: 44th Annual Symposium on Foundations of Computer Science, Cambridge, Massachusetts, pp. 298–307. IEEE, October 2003
3. Andreeva, E., Mennink, B., Preneel, B.: Security properties of domain extenders for cryptographic hash functions. J. Inf. Process. Syst. 6(4), 453–480 (2010).
https://doi.org/10.3745/JIPS.2010.6.4.453
4. Lecture Notes in Computer Science;B Applebaum,2009
5. Applebaum, B., Haramaty, N., Ishai, Y., Kushilevitz, E., Vaikuntanathan, V.: Low-complexity cryptographic hash functions. In: Proceedings of the 2017 Conference on Innovations in Theoretical Computer Science (ITCS 2017), pp. 7:1–7:31 (2017)