CryptoDB
ZK-PCPs from Leakage-Resilient Secret Sharing
Authors: | |
---|---|
Download: | |
Abstract: | Zero-Knowledge PCPs (ZK-PCPs; Kilian, Petrank, and Tardos, STOC ‘97) are PCPs with the additional zero-knowledge guarantee that the view of any (possibly malicious) verifier making a bounded number of queries to the proof can be efficiently simulated up to a small statistical distance. Similarly, ZK-PCPs of Proximity (ZK-PCPPs; Ishai and Weiss, TCC ‘14) are PCPPs in which the view of an adversarial verifier can be efficiently simulated with few queries to the input. Previous ZK-PCP constructions obtained an exponential gap between the query complexity q of the honest verifier, and the bound |
BibTeX
@article{jofc-2022-32786, title={ZK-PCPs from Leakage-Resilient Secret Sharing}, journal={Journal of Cryptology}, publisher={Springer}, volume={35}, doi={10.1007/s00145-022-09433-3}, author={Carmit Hazay and Muthuramakrishnan Venkitasubramaniam and Mor Weiss}, year=2022 }