1. Ajtai, M., Ben-Or, M.: A theorem on probabilistic constant depth computations. In: Proceedings of the 16th Annual ACM Symposium on Theory of Computing, April 30–May 2 1984, Washington, DC, USA, pp. 471–474 (1984)
2. Applebaum, B., Barak, B., Wigderson, A.: Public-key cryptography from different assumptions. In: Proceedings of the Forty-Second ACM Symposium on Theory of Computing, pp. 171–180. ACM (2010)
3. Akavia, A., Goldreich, O., Goldwasser, S., Moshkovitz, D.: On basing one-way functions on NP-hardness. In: Proceedings of the 38th Annual ACM Symposium on Theory of Computing, Seattle, WA, USA, May 21–23 2006, pp. 701–710 (2006)
4. Alon, N., Goldreich, O., Håstad, J., Peralta, R.: Addendum to “simple construction of almost k-wise independent random variables”. Random Struct. Algorithms 4(1), 119–120 (1993)
5. Applebaum, B., Ishai, Y., Kushilevitz, E.: Cryptography in NC
$$^0$$
. In: Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2004, 17–19 October 2004, Rome, Italy, p. 166. IEEE Computer Society Press (2004)