License: 
Creative Commons Attribution 4.0 International license (CC BY 4.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.ITCS.2023.3
URN: urn:nbn:de:0030-drops-175063
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2023/17506/
Allender, Eric ;
Hirahara, Shuichi ;
Tirumala, Harsha
Kolmogorov Complexity Characterizes Statistical Zero Knowledge
Abstract
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.
BibTeX - Entry
@InProceedings{allender_et_al:LIPIcs.ITCS.2023.3,
author = {Allender, Eric and Hirahara, Shuichi and Tirumala, Harsha},
title = {{Kolmogorov Complexity Characterizes Statistical Zero Knowledge}},
booktitle = {14th Innovations in Theoretical Computer Science Conference (ITCS 2023)},
pages = {3:1--3:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-263-1},
ISSN = {1868-8969},
year = {2023},
volume = {251},
editor = {Tauman Kalai, Yael},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/opus/volltexte/2023/17506},
URN = {urn:nbn:de:0030-drops-175063},
doi = {10.4230/LIPIcs.ITCS.2023.3},
annote = {Keywords: Kolmogorov Complexity, Interactive Proofs}
}
|
Keywords: |
|
Kolmogorov Complexity, Interactive Proofs |
|
Collection: |
|
14th Innovations in Theoretical Computer Science Conference (ITCS 2023) |
|
Issue Date: |
|
2023 |
|
Date of publication: |
|
01.02.2023 |
