1. Applebaum, B., Golombek, E.: On the randomness complexity of interactive proofs and statistical zero-knowledge proofs. In: Tessaro, S. (ed.) 2nd Conference on Information-Theoretic Cryptography, ITC 2021, 23–26 July 2021, Virtual Conference. LIPIcs, vol. 199, pp. 4:1–4:23. Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2021)
2. Lecture Notes in Computer Science;E Ben-Sasson,2016
3. Lecture Notes in Computer Science;I Berman,2018
4. Lecture Notes in Computer Science;M Ben-Or,1990
5. Brakerski, Z.: Fundamentals of fully homomorphic encryption. In: Goldreich, O. (ed.) Providing Sound Foundations for Cryptography: On the Work of Shafi Goldwasser and Silvio Micali, pp. 543–563. ACM (2019)