Gal Arnon

According to our database, Gal Arnon authored at least 13 papers between 2021 and 2025.

Collaborative distances:

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

2025

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

Gal Arnon, Alessandro Chiesa, Giacomo Fenzi, Eylon Yogev

Proceedings of the Advances in Cryptology - EUROCRYPT 2025, 2025

Instance Compression, Revisited.

Gal Arnon, Shany Ben-David, Eylon Yogev

Proceedings of the Advances in Cryptology - EUROCRYPT 2025, 2025

Towards a White-Box Secure Fiat-Shamir Transformation.

Gal Arnon, Eylon Yogev

Proceedings of the Advances in Cryptology - CRYPTO 2025, 2025

Designated-Verifier SNARGs with One Group Element.

Gal Arnon, Jesko Dujmovic, Yuval Ishai

Proceedings of the Advances in Cryptology - CRYPTO 2025, 2025

2024

Hamming Weight Proofs of Proximity with One-Sided Error.

Gal Arnon, Shany Ben-David, Eylon Yogev

Proceedings of the Theory of Cryptography - 22nd International Conference, 2024

STIR: Reed-Solomon Proximity Testing with Fewer Queries.

Gal Arnon, Alessandro Chiesa, Giacomo Fenzi, Eylon Yogev

Proceedings of the Advances in Cryptology - CRYPTO 2024, 2024

2023

IOPs with Inverse Polynomial Soundness Error.

Gal Arnon, Alessandro Chiesa, Eylon Yogev

Proceedings of the 64th IEEE Annual Symposium on Foundations of Computer Science, 2023

2022

A Toolbox for Barriers on Interactive Oracle Proofs.

Gal Arnon, Amey Bhangale, Alessandro Chiesa, Eylon Yogev

Proceedings of the Theory of Cryptography - 20th International Conference, 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

Hardness of Approximation for Stochastic Problems via Interactive Oracle Proofs.

Gal Arnon, Alessandro Chiesa, Eylon Yogev

Proceedings of the 37th Computational Complexity Conference, 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

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

Gal Arnon, Guy N. Rothblum

Proceedings of the 2nd Conference on Information-Theoretic Cryptography, 2021