Gal Arnon

About Me

I am a Ph.D. student at the Weizmann Institute in Israel, where I am jointly advised by Moni Naor (Weizmann Institute) and Eylon Yogev (Bar-Ilan University). My interests are at the intersection between cryptography and theoretical computer science. I am especially interested in understanding the power and limitations of probabilistic proof systems.

I completed my master's degree at the Weizmann Institute in 2020 under the supervision of Guy Rothblum and my bachelor's degree in computer science and electrical engineering at Tel Aviv University in 2017.

Publications

1. A Toolbox for Barriers on Interactive Oracle Proofs

   with Amey Bhangale, Alessandro Chiesa, and Eylon Yogev.

   TCC 2022 (Video)

2. Hardness of Approximation for Stochastic Problems via Interactive Oracle Proofs

   with Alessandro Chiesa, and Eylon Yogev.

   CCC 2022 (Video)

3. Min-Entropic Optimality

   with Tomer Grossman.

   (Preprint)

4. A PCP Theorem for Interactive Proofs and Applications

   with Alessandro Chiesa, and Eylon Yogev.

   EUROCRYPT 2022 (Video)

5. On Prover-Efficient Public-Coin Emulation of Interactive Proofs

   with Guy Rothblum.

   ITC 2021 (Video)
   (Also, paper #309 in Oded's Choices)

Workshop Organization

• Organizer: "Lattices Meet Hashes: Recent Advances in Post-Quantum Zero-Knowledge Proofs", Bernoulli Center for Fundamental Studies at EPFL in Lausanne, Switzerland, May 2023.

Teaching

• Teaching Assistant: "Foundations and frontiers of probabilistic proofs", virtual MSRI summer graduate school, July-August 2021.
• Instructor: "Mini-course on zero-knowledge proofs", Amos de-Shalit Summer School, Weizmann Institute of Science, September 2018.