Gal Arnon

According to our database, Gal Arnon authored at least 11 papers between 2019 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

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

Gal Arnon, Alessandro Chiesa, Giacomo Fenzi, 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

Instance Compression, Revisited.

Gal Arnon, Shany Ben-David, Eylon Yogev

IACR Cryptol. ePrint Arch., 2024

Hamming Weight Proofs of Proximity with One-Sided Error.

Gal Arnon, Shany Ben-David, Eylon Yogev

IACR Cryptol. ePrint Arch., 2024

2023

IOPs with Inverse Polynomial Soundness Error.

Gal Arnon, Alessandro Chiesa, Eylon Yogev

IACR Cryptol. ePrint Arch., 2023

2022

Hardness of Approximation for Stochastic Problems via Interactive Oracle Proofs.

Gal Arnon, Alessandro Chiesa, Eylon Yogev

IACR Cryptol. ePrint Arch., 2022

A Toolbox for Barriers on Interactive Oracle Proofs.

Gal Arnon, Amey Bhangale, Alessandro Chiesa, Eylon Yogev

IACR Cryptol. ePrint Arch., 2022

A PCP Theorem for Interactive Proofs and Applications.

Gal Arnon, Alessandro Chiesa, Eylon Yogev

Proceedings of the Advances in Cryptology - EUROCRYPT 2022 - 41st Annual International Conference on the Theory and Applications of Cryptographic Techniques, Trondheim, Norway, May 30, 2022

2021

A PCP Theorem for Interactive Proofs.

Gal Arnon, Alessandro Chiesa, Eylon Yogev

IACR Cryptol. ePrint Arch., 2021

Min-Entropic Optimality.

Gal Arnon, Tomer Grossman

Electron. Colloquium Comput. Complex., 2021

2019

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

Gal Arnon, Guy N. Rothblum

Electron. Colloquium Comput. Complex., 2019