Weizmann Logo
ECCC
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style



REPORTS > AUTHORS > GAL ARNON:
All reports by Author Gal Arnon:

TR26-322 | 19th November 2026
Gal Arnon, Noam Mazor, Rafael Pass, Jad Silbak

Complexity-Theoretic Consequences of Zero-Knowledge with Inefficient Simulation

Zero-knowledge ($ZK$) protocols are one of the most fundamental cryptographic primitives. Classic results in the 1980s established that one-way functions (OWFs) suffice for constructing $ZK$ for $NP$ (Goldreich-Micali-Wigderson [JACM'91], Naor [CRYPTO’89], Hastad et al. [SICOMP’99]). Moreover, OWFs are, in fact, necessary for $ZK$ for $NP$, due to the classic result ... more >>>


TR26-050 | 7th April 2026
Gal Arnon, Noam Mazor, Rafael Pass, Jad Silbak

Witness-Indistinguishable Arguments of Knowledge and One-Way Functions

In this paper we study the cryptographic complexity of non-trivial witness-indistinguishable ($WI$) arguments of knowledge. We establish that:

- Assuming that $NP\not\subseteq P/poly,$ the existence of a constant-round computational $WI$ argument of knowledge for $NP$ implies that (infinitely-often) auxiliary-input one-way functions exist.

- Assuming that $NP\not\subseteq P^{Sam}/poly,$ there is no ... more >>>


TR19-176 | 4th December 2019
Gal Arnon, Guy Rothblum

On Prover-Efficient Public-Coin Emulation of Interactive Proofs

Revisions: 4

A central question in the study of interactive proofs is the relationship between private-coin proofs, where the verifier is allowed to hide its randomness from the prover, and public-coin proofs, where the verifier's random coins are sent to the prover.

In this work, we study transformations ... more >>>




ISSN 1433-8092 | Imprint