Weizmann Logo
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style

Reports tagged with NISZK:
TR22-127 | 12th September 2022
Eric Allender, Shuichi Hirahara, Harsha Tirumala

Kolmogorov Complexity Characterizes Statistical Zero Knowledge

We show that a decidable promise problem has a non-interactive statistical zero-knowledge proof system if and only if it is randomly reducible to a promise problem for Kolmogorov-random strings, with a superlogarithmic additive approximation term. This extends recent work by Saks and Santhanam (CCC 2022). We build on this to ... more >>>

ISSN 1433-8092 | Imprint