Weizmann Logo
ECCC
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style



REPORTS > AUTHORS > HADAR STRAUSS:
All reports by Author Hadar Strauss:

TR25-097 | 16th July 2025
Hadar Strauss

On the Limits of Computationally Sound IPPs in the Isolated Model

Interactive proofs of proximity (IPPs) are a relaxation of interactive proofs, analogous to property testing, in which soundness is required to hold only for inputs that are far from the property being verified. In such proof systems, the verifier has oracle access to the input, and it engages in two ... more >>>


TR24-131 | 5th September 2024
Hadar Strauss

Emulating Computationally Sound Public-Coin IPPs in the Pre-Coordinated Model

Revisions: 1

Interactive proofs of proximity (IPPs) for a property are relaxed proof systems analogous to property testers in which the goal is for the verifier to be convinced to accept inputs that are in the property, and to not be fooled into accepting inputs that are far from the property.

... more >>>



ISSN 1433-8092 | Imprint