Gal Arnon

Ph.D. Student
Computer Science, Weizmann Institute
gal.arnon [at] weizmann.ac.il
DBLP

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.

Listen below (also available here) to an interview Giacomo and I gave on ZK Podcast where where we discuss our paper on the STIR proximity test (co-authored with Alessandro Chiesa and Eylon Yogev).

Publications

  1. STIR: Reed–Solomon Proximity Testing with Fewer Queries

    with Alessandro Chiesa, Giacomo Fenzi, and Eylon Yogev.

    Appeared in ZKSummit 11    and to appear in ZKProof 6

    See also, Giacomo's wonderful blogpost

  2. Hamming Weight Proofs of Proximity with One-Sided Error

    with Shany Ben-David, and Eylon Yogev.

  3. IOPs with Inverse Polynomial Soundness Error

    with Alessandro Chiesa, and Eylon Yogev.

    FOCS 2023    +  Talk @zkStudyClub  

  4. A Toolbox for Barriers on Interactive Oracle Proofs

    with Amey Bhangale, Alessandro Chiesa, and Eylon Yogev.

    TCC 2022  

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

    with Alessandro Chiesa, and Eylon Yogev.

    CCC 2022  

  6. Min-Entropic Optimality

    with Tomer Grossman.

  7. A PCP Theorem for Interactive Proofs and Applications

    with Alessandro Chiesa, and Eylon Yogev.

    EUROCRYPT 2022  

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

    with Guy Rothblum.

    ITC 2021  

Workshop Organization

Teaching