@InProceedings{applebaum_et_al:LIPIcs.ITC.2021.4,
author = {Applebaum, Benny and Golombek, Eyal},
title = {{On the Randomness Complexity of Interactive Proofs and Statistical Zero-Knowledge Proofs}},
booktitle = {2nd Conference on Information-Theoretic Cryptography (ITC 2021)},
pages = {4:1--4:23},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-197-9},
ISSN = {1868-8969},
year = {2021},
volume = {199},
editor = {Tessaro, Stefano},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITC.2021.4},
URN = {urn:nbn:de:0030-drops-143238},
doi = {10.4230/LIPIcs.ITC.2021.4},
annote = {Keywords: Interactive proofs, Zero-knowledge proofs, Pseudorandomness}
}