ZK-PCPs from Leakage-Resilient Secret Sharing

Hazay, Carmit; Venkitasubramaniam, Muthuramakrishnan; Weiss, Mor

doi:10.4230/lipics.itc.2021.6

Cited by 1 publication

(31 citation statements)

References 8 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The question of designing non-adaptive ZK-PCPs had remained open for nearly 20 years, until Ishai, Weiss and Yang [ 8 ] gave the first construction of a non-adaptive ZK-PCP, which was followed by the non-adaptive ZK-PCP of Hazay, Venkitasubramaniam and Weiss [ 13 ]. The focus of this survey is on describing and comparing these constructions.…”

Section: Introductionmentioning

confidence: 99%

“…We survey two recent works [ 8 , 13 ] that construct ZK-PCPs for

with a non-adaptive honest verifier , obtained through a novel connection to the seemingly unrelated field of leakage-resilient cryptography . These constructions differ drastically from the ZK-PCP constructions described above.…”

Section: Introductionmentioning

confidence: 99%

“…Recall that the ZK-PCPs of [ 6 , 10 , 11 ] are obtained from a PCP with weak ZK guarantees (specifically, HVZK) by effectively restricting the malicious verifier , i.e., forcing its queries to be distributed similarly to the queries of (multiple independent copies of) the honest verifier. The ZK-PCPs of [ 8 , 13 ] take a different approach: instead of forcing a certain structure on

’s queries, they classify the type of information which an arbitrary query-bounded

obtains by querying the proof, and modify the proof to guarantee this type of information reveals nothing about the underlying

witness. Their insight is that the partial information obtained by deviating from the honest verifier’s query pattern constitutes leakage on the proof and consequently, on the underlying witness.…”

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

“…The works of [ 8 , 13 ] differ in the method they use to protect against leakage. Hazay et al [ 13 ] chose to protect the proof itself, whereas Ishai et al [ 8 ] protect the process of proof generation from the witness. Put differently, the latter protect computation against leakage, for which they employ leakage-resilient circuits , whereas the former protect information (the proof, once it has been generated), by using an appropriate leakage-resilient encoding .…”

Section: Introductionmentioning

confidence: 99%

See 4 more Smart Citations

Shielding Probabilistically Checkable Proofs: Zero-Knowledge PCPs from Leakage Resilience

Weiss

2022

Entropy

Self Cite

View full text Add to dashboard Cite

Probabilistically Checkable Proofs (PCPs) allows a randomized verifier, with oracle access to a purported proof, to probabilistically verify an input statement of the form “x∈L” by querying only a few proof bits. Zero-Knowledge PCPs (ZK-PCPs) enhance standard PCPs to additionally guarantee that the view of any (possibly malicious) verifier querying a bounded number of proof bits can be efficiently simulated up to a small statistical distance. The first ZK-PCP construction of Kilian, Petrank and Tardos (STOC 1997), and following constructions employing similar techniques, necessitate that the honest verifier makes several rounds of queries to the proof. This undesirable property, which is inherent to their technique, translates into increased round complexity in cryptographic applications of ZK-PCPs. We survey two recent ZK-PCP constructions—due to Ishai, Yang and Weiss (TCC 2016-A), and Hazay, Venkitasubramaniam and Weiss (ITC 2021)—in which the honest verifier makes a single round of queries to the proof. Both constructions use entirely different techniques compared to previous ZK-PCP constructions, by showing connections to the seemingly-unrelated notion of leakage resilience. These constructions are incomparable to previous ZK-PCP constructions: while on the one hand the honest verifier only makes a single round of queries to the proof, these ZK-PCPs either obtain a smaller (polynomial) ratio between the query complexity of the honest and malicious verifiers or obtain a weaker ZK guarantee in which the ZK simulator is not necessarily efficient.

show abstract

Section: Introductionmentioning

confidence: 99%

“…We survey two recent works [ 8 , 13 ] that construct ZK-PCPs for

Section: Introductionmentioning

confidence: 99%