Weizmann Logo
ECCC
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style



REPORTS > KEYWORD > COMPUTATIONAL SOUNDNESS:
Reports tagged with Computational Soundness:
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 >>>


TR25-195 | 29th November 2025
Hadar Strauss

On the Power of Computationally Sound Interactive Proofs of Proximity

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 $\epsilon$-far from the property being verified, where $\epsilon>0$ is a proximity parameter. In such proof systems, the verifier has oracle access to the ... more >>>




ISSN 1433-8092 | Imprint