1. Applebaum, B., Golombek, E.: On the randomness complexity of interactive proofs and statistical zero-knowledge proofs. In: Proceedings of the 2nd Conference on Information-Theoretic Cryptography, ITC 2021, pp. 4:1–4:23 (2021)
2. Arnon, G., Chiesa, A., Yogev, E.: Hardness of approximation for stochastic problems via interactive oracle proofs. In: Proceedings of the 37th Annual IEEE Conference on Computational Complexity, CCC 2022, pp. 24:1–24:16 (2022)
3. Arnon, G., Chiesa, A., Yogev, E.: A PCP theorem for interactive proofs. In: Proceedings of the 41st Annual International Conference on Theory and Application of Cryptographic Techniques, EUROCRYPT 2022, pp. 64–94 (2022)
4. Arora, S., Lund, C., Motwani, R., Sudan, M., Szegedy, M.: Proof verification and the hardness of approximation problems. J. ACM 45(3), 501–555 (1998). Preliminary version in FOCS ’92
5. Arora, S., Safra, S.: Probabilistic checking of proofs: a new characterization of NP. J. ACM 45(1), 70–122 (1998). Preliminary version in FOCS ’92