1. Aiello, W., Håstad, J.: Perfect zero-knowledge languages can be recognized in two rounds. In: 28th Annual Symposium on Foundations of Computer Science, Los Angeles, California, USA, 27–29 October 1987, pp. 439–448. IEEE Computer Society (1987)
2. Applebaum, B., Ishai, Y., Kushilevitz, E.: Cryptography in
$$\text{NC}^{0}$$
. In: Proceedings of 45th Symposium on Foundations of Computer Science (FOCS 2004), 17–19 October 2004, Rome, Italy, pp. 166–175. IEEE Computer Society (2004)
3. Applebaum, B., Ishai, Y., Kushilevitz, E.: Computationally private randomizing polynomials and their applications. In: 20th Annual IEEE Conference on Computational Complexity (CCC 2005), 11–15 June 2005, San Jose, CA, USA, pp. 260–274. IEEE Computer Society (2005)
4. Applebaum, B., Ishai, Y., Kushilevitz, E., Minimizing locality of one-way functions via semi-private randomized encodings. Electronic Colloquium on Computational Complexity (ECCC), 22:45 (2015)
5. Lecture Notes in Computer Science;S Agrawal,2015