On Prover-Efficient Public-Coin Emulation of Interactive Proofs. - Gal Arnon; Guy N. Rothblum (Electron. Colloquium Comput. Complex., 2019)

Min-Entropic Optimality. - Gal Arnon; Tomer Grossman (Electron. Colloquium Comput. Complex., 2021)

A PCP Theorem for Interactive Proofs. - Gal Arnon; Alessandro Chiesa; Eylon Yogev (IACR Cryptol. ePrint Arch., 2021)

A PCP Theorem for Interactive Proofs and Applications. - Gal Arnon; Alessandro Chiesa; Eylon Yogev (EUROCRYPT (2), 2022)

A Toolbox for Barriers on Interactive Oracle Proofs. - Gal Arnon; Amey Bhangale; Alessandro Chiesa; Eylon Yogev (IACR Cryptol. ePrint Arch., 2022)

Hardness of Approximation for Stochastic Problems via Interactive Oracle Proofs. - Gal Arnon; Alessandro Chiesa; Eylon Yogev (IACR Cryptol. ePrint Arch., 2022)

IOPs with Inverse Polynomial Soundness Error. - Gal Arnon; Alessandro Chiesa; Eylon Yogev (IACR Cryptol. ePrint Arch., 2023)

Hamming Weight Proofs of Proximity with One-Sided Error. - Gal Arnon; Shany Ben-David; Eylon Yogev (IACR Cryptol. ePrint Arch., 2024)

Instance Compression, Revisited. - Gal Arnon; Shany Ben-David; Eylon Yogev (IACR Cryptol. ePrint Arch., 2024)

STIR: Reed-Solomon Proximity Testing with Fewer Queries. - Gal Arnon; Alessandro Chiesa; Giacomo Fenzi; Eylon Yogev (IACR Cryptol. ePrint Arch., 2024)

WHIR: Reed-Solomon Proximity Testing with Super-Fast Verification. - Gal Arnon; Alessandro Chiesa; Giacomo Fenzi; Eylon Yogev (IACR Cryptol. ePrint Arch., 2024)

Designated-Verifier SNARGs with One Group Element. - Gal Arnon; Jesko Dujmovic; Yuval Ishai (IACR Cryptol. ePrint Arch., 2025)

Towards a White-Box Secure Fiat-Shamir Transformation. - Gal Arnon; Eylon Yogev (IACR Cryptol. ePrint Arch., 2025)