Languages with Efficient Zero-Knowledge PCPs are in SZK

Abstract

A Zero-Knowledge PCP (ZK-PCP) is a randomized PCP such that the view of any (perhaps cheating) efficient verifier can be efficiently simulated up to small statistical distance. Kilian, Petrank, and Tardos (STOC ’97) constructed ZK-PCPs for all languages in NEXP. Ishai, Mahmoody, and Sahai (TCC ’12), motivated by cryptographic applications, revisited the… (More)
DOI: 10.1007/978-3-642-36594-2_17

Topics

  • Presentations referencing similar topics