ECCC-Report TR22-127https://eccc.weizmann.ac.il/report/2022/127Comments and Revisions published for TR22-127en-usTue, 13 Sep 2022 20:21:12 +0300
Paper TR22-127
| Kolmogorov Complexity Characterizes Statistical Zero Knowledge |
Eric Allender,
Shuichi Hirahara,
Harsha Tirumala
https://eccc.weizmann.ac.il/report/2022/127We 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 give new characterizations of Statistical Zero Knowledge (SZK), as well as the related classes NISZK_L and SZK_L.Tue, 13 Sep 2022 20:21:12 +0300https://eccc.weizmann.ac.il/report/2022/127