Weizmann Logo
ECCC
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style



REPORTS > AUTHORS > GEOFFROY COUTEAU:
All reports by Author Geoffroy Couteau:

TR26-215 | 25th September 2026
Geoffroy Couteau, Nikolas Melissaris, Tamara Paris

Interactive Proofs of Proximity for Model Evaluation

We study interactive proofs of proximity (IPP) for model evaluation: a resource-limited verifier interacts with an untrusted prover, typically the model owner, to certify statistical properties of a model under an unknown input distribution. Our formulation is shaped by the constraints of practical evaluation: it separates sampling the input distribution ... more >>>


TR26-194 | 18th September 2026
Nir Bitansky, Geoffroy Couteau, Noam Mazor

Interactive Secret-Key PIR

Private information retrieval (PIR) inherently requires public-key cryptography. A recent line of work suggests that this barrier can be avoided in secret-key PIR, where the client first preprocesses an N-bit database and retains only a short secret key. This line of work has yielded communication O(N^\epsilon) for any constant \epsilon ... more >>>




ISSN 1433-8092 | Imprint