Revision #1 Authors: Eric Allender, Shuichi Hirahara, Harsha Tirumala

Accepted on: 22nd November 2022 21:52

Downloads: 10

Keywords:

We show that a decidable promise problem has a non-interactive statistical zero-knowledge proof system if and only if it is randomly reducible via an honest polynomial-time reduction 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.

The main theorems are now stated in terms of "honest" reductions. Some minor typos were fixed, a new theorem was added, etc.

TR22-127 Authors: Eric Allender, Shuichi Hirahara, Harsha Tirumala

Publication: 13th September 2022 20:21

Downloads: 243

Keywords:

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 give new characterizations of Statistical Zero Knowledge (SZK), as well as the related classes NISZK_L and SZK_L.