1. Arthur-Merlin games: A randomized proof system, and a hierarchy of complexity classes
2. James Bartusek , Liron Bronfman , Justin Holmgren , Fermi Ma , and Ron D. Rothblum . 2019. On the (In)security of Kilian-Based SNARGs. In Theory of Cryptography - 17th International Conference , TCC 2019, Nuremberg, Germany, December 1-5, 2019, Proceedings, Part II, Dennis Hofheinz and Alon Rosen (Eds.) (Lecture Notes in Computer Science , Vol. 11892). Springer, 522– 551 . James Bartusek, Liron Bronfman, Justin Holmgren, Fermi Ma, and Ron D. Rothblum. 2019. On the (In)security of Kilian-Based SNARGs. In Theory of Cryptography - 17th International Conference, TCC 2019, Nuremberg, Germany, December 1-5, 2019, Proceedings, Part II, Dennis Hofheinz and Alon Rosen (Eds.) (Lecture Notes in Computer Science, Vol. 11892). Springer, 522–551.
3. Mihir Bellare and Phillip Rogaway . 1993 . Entity Authentication and Key Distribution. In Advances in Cryptology - CRYPTO ’93 , 13th Annual International Cryptology Conference, Santa Barbara, California, USA, August 22-26, 1993, Proceedings, Douglas R. Stinson (Ed.) (Lecture Notes in Computer Science , Vol. 773). Springer, 232– 249 . Mihir Bellare and Phillip Rogaway. 1993. Entity Authentication and Key Distribution. In Advances in Cryptology - CRYPTO ’93, 13th Annual International Cryptology Conference, Santa Barbara, California, USA, August 22-26, 1993, Proceedings, Douglas R. Stinson (Ed.) (Lecture Notes in Computer Science, Vol. 773). Springer, 232–249.
4. Eli Ben-Sasson , Alessandro Chiesa , and Nicholas Spooner . 2016 . Interactive Oracle Proofs. In Theory of Cryptography - 14th International Conference , TCC 2016-B, Beijing, China, October 31 - November 3, 2016, Proceedings, Part II, Martin Hirt and Adam D. Smith (Eds.) (Lecture Notes in Computer Science , Vol. 9986). 31– 60 . Eli Ben-Sasson, Alessandro Chiesa, and Nicholas Spooner. 2016. Interactive Oracle Proofs. In Theory of Cryptography - 14th International Conference, TCC 2016-B, Beijing, China, October 31 - November 3, 2016, Proceedings, Part II, Martin Hirt and Adam D. Smith (Eds.) (Lecture Notes in Computer Science, Vol. 9986). 31–60.