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.APPROX/RANDOM.2023.56
URN: urn:nbn:de:0030-drops-188815
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2023/18881/
Allender, Eric ;
Gray, Jacob ;
Mutreja, Saachi ;
Tirumala, Harsha ;
Wang, Pengxiang
Robustness for Space-Bounded Statistical Zero Knowledge
Abstract
We show that the space-bounded Statistical Zero Knowledge classes SZK_L and NISZK_L are surprisingly robust, in that the power of the verifier and simulator can be strengthened or weakened without affecting the resulting class. Coupled with other recent characterizations of these classes [Eric Allender et al., 2023], this can be viewed as lending support to the conjecture that these classes may coincide with the non-space-bounded classes SZK and NISZK, respectively.
BibTeX - Entry
@InProceedings{allender_et_al:LIPIcs.APPROX/RANDOM.2023.56,
author = {Allender, Eric and Gray, Jacob and Mutreja, Saachi and Tirumala, Harsha and Wang, Pengxiang},
title = {{Robustness for Space-Bounded Statistical Zero Knowledge}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2023)},
pages = {56:1--56:21},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-296-9},
ISSN = {1868-8969},
year = {2023},
volume = {275},
editor = {Megow, Nicole and Smith, Adam},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/opus/volltexte/2023/18881},
URN = {urn:nbn:de:0030-drops-188815},
doi = {10.4230/LIPIcs.APPROX/RANDOM.2023.56},
annote = {Keywords: Interactive Proofs}
}
Keywords: |
|
Interactive Proofs |
Collection: |
|
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2023) |
Issue Date: |
|
2023 |
Date of publication: |
|
04.09.2023 |