Probabilistically Checkable Proofs of Proximity with Zero-Knowledge
From MaRDI portal
Publication:5746335
DOI10.1007/978-3-642-54242-8_6zbMath1323.94117OpenAlexW15244400MaRDI QIDQ5746335
Publication date: 18 February 2014
Published in: Theory of Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-54242-8_6
Cryptography (94A60) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)
Related Items (14)
ZK-PCPs from leakage-resilient secret sharing ⋮ Asymptotically quasi-optimal cryptography ⋮ A PCP theorem for interactive proofs and applications ⋮ Ligero: lightweight sublinear arguments without a trusted setup ⋮ Black-box anonymous commit-and-prove ⋮ A new approach to efficient non-malleable zero-knowledge ⋮ Zero-Knowledge Proofs of Proximity ⋮ Fast Reed-Solomon Interactive Oracle Proofs of Proximity ⋮ Actively secure garbled circuits with constant communication overhead in the plain model ⋮ Smooth and strong PCPs ⋮ Making the Best of a Leaky Situation: Zero-Knowledge PCPs from Leakage-Resilient Circuits ⋮ On the power of secure two-party computation ⋮ On the Power of Secure Two-Party Computation ⋮ Round-optimal black-box commit-and-prove with succinct communication
This page was built for publication: Probabilistically Checkable Proofs of Proximity with Zero-Knowledge
