Gal Arnon

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

About Me

I am a research fellow at the Simons Institue in UC Berkeley. I completed my Ph.D. at the Weizmann Institute of Science, where I was 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.

My Curriculum Vitae can be found here.

Click here to listen to an interview Giacomo and I gave on ZK Podcast where where we discuss the STIR protocol.

Publications

  1. Designated-Verifier SNARGs with One Group Element

    Gal Arnon, Jesko Dujmovic, and Yuval Ishai

    CRYPTO 2025

  2. Towards a White-Box Secure Fiat-Shamir Transformation

    Gal Arnon and Eylon Yogev

    CRYPTO 2025, ZKProof 7

  3. Instance Compression, Revisited

    Gal Arnon, Shany Ben-David, and Eylon Yogev

    EUROCRYPT 2025

  4. WHIR: Reed–Solomon Proximity Testing with Super-Fast Verification

    Gal Arnon, Alessandro Chiesa, Giacomo Fenzi, and Eylon Yogev

    EUROCRYPT 2025, ZKSummit 12, ZKProof 7

    See also Giacomo's blogpost

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

    Gal Arnon, Shany Ben-David, and Eylon Yogev

    TCC 2024

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

    Gal Arnon, Alessandro Chiesa, Giacomo Fenzi, and Eylon Yogev

    CRYPTO 2024 (Best Paper Award) ,  ZKSummit 11    , ZKProof 6

    See also Giacomo's blogpost

  7. IOPs with Inverse Polynomial Soundness Error

    Gal Arnon, Alessandro Chiesa, and Eylon Yogev

    FOCS 2023   and chosen for ITC 2024 highlights track

  8. A Toolbox for Barriers on Interactive Oracle Proofs

    Gal Arnon, Amey Bhangale, Alessandro Chiesa, and Eylon Yogev

    TCC 2022  

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

    Gal Arnon, Alessandro Chiesa, and Eylon Yogev

    CCC 2022  

  10. Min-Entropic Optimality

    Gal Arnon and Tomer Grossman

    Manuscript

  11. A PCP Theorem for Interactive Proofs and Applications

    Gal Arnon, Alessandro Chiesa, and Eylon Yogev

    EUROCRYPT 2022  

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

    Gal Arnon and Guy N. Rothblum

    ITC 2021  

Awards

  • Esther Hellinger Memorial Prize for academic excellence. Awarded in 2024 by the Weizmann Institute.
  • Best Paper Award at CRYPTO 2024 for “STIR: Reed–Solomon Proximity Testing with Fewer Queries”.

Workshop Organization

Teaching