‪Gal Arnon‬ - ‪Google Scholar‬

Get my own profile

Cited by

	All	Since 2019
Citations	18	18
h-index	3	3
i10-index	0	0

0

8

4

2022202320248 7 1

Public access

1 article

0 articles

available

not available

Based on funding mandates

Co-authors

Alessandro ChiesaEPFLVerified email at epfl.ch
Eylon YogevBar-Ilan UniversityVerified email at biu.ac.il
Guy RothblumWeizmann Institute of ScienceVerified email at alum.mit.edu
Amey BhangaleUniversity of California, RiversideVerified email at cs.ucr.edu
Giacomo FenziPhD Student, EPFLVerified email at epfl.ch

Gal Arnon

Gal Arnon

Weizmann Institute of Science

Verified email at weizmann.ac.il - Homepage

Cryptography Computational Complexity


Title Sort by citations Sort by year Sort by title	Cited by Cited by	Year
A PCP Theorem for Interactive Proofs and Applications G Arnon, A Chiesa, E Yogev Annual International Conference on the Theory and Applications of …, 2022	8	2022
IOPs with inverse polynomial soundness error G Arnon, A Chiesa, E Yogev 2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS …, 2023	4	2023
Hardness of approximation for stochastic problems via interactive oracle proofs G Arnon, A Chiesa, E Yogev Cryptology ePrint Archive, 2022	4	2022
A Toolbox for Barriers on Interactive Oracle Proofs G Arnon, A Bhangale, A Chiesa, E Yogev Cryptology ePrint Archive, 2022	1	2022
On Prover-Efficient Public-Coin Emulation of Interactive Proofs G Arnon, GN Rothblum 2nd Conference on Information-Theoretic Cryptography (ITC 2021), 2021	1	2021
STIR: Reed–Solomon Proximity Testing with Fewer Queries G Arnon, A Chiesa, G Fenzi, E Yogev Cryptology ePrint Archive, 2024		2024

The system can't perform the operation now. Try again later.

Articles 1–6