Weizmann Logo
ECCC
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style



LATEST > REPORTS:
RSS-Feedprevious PreviousNext next

TR25-200 | 4th December 2025
Oded Goldreich, Guy Rothblum

On doubly-sublinear interactive proofs for distributions

Revisions: 1

Interactive proofs of proximity for distributions, introduced by Chiesa and Gur (ITCS18) and extensively studied recently by Herman and Rothblum (STOC22, FOCS23, FOCS24}, offer a way of verifying properties of distributions using less samples than required to test these properties.

We say that such an interactive proof system is {\sf ... more >>>


TR25-199 | 26th November 2025
Clement Canonne, Sam Polgar, Aditya Singh, Aravind Thyagarajan, Qiping Yang

Verification of Statistical Properties: Redefining the Possible

Revisions: 1

We revisit the setting of Interactive Proof Systems for Distribution Testing, introduced by Chiesa and Gur (2018), showing that a simple twist on the task requirements may lead to dramatic improvements, allowing verifiers with constant sample complexity.

We define and investigate the multi-prover and zero-knowledge versions of these interactive proof ... more >>>


TR25-198 | 27th November 2025
Ari Biswas, Mark Bun, Clément Canonne, Satchit Sivakumar

Interactive Proofs For Distribution Testing With Conditional Oracles

We revisit the framework of interactive proofs for distribution testing, first introduced by Chiesa and Gur (ITCS 2018), which has recently experienced a surge in interest, accompanied by notable progress (e.g., Herman and Rothblum, STOC 2022, FOCS 2023; Herman, RANDOM~2024).
In this model, a data-poor verifier determines whether a ... more >>>



previous PreviousNext next


ISSN 1433-8092 | Imprint