On Efficient Zero-Knowledge PCPs
From MaRDI portal
Publication:2891481
DOI10.1007/978-3-642-28914-9_9zbMath1304.68056OpenAlexW81245908MaRDI QIDQ2891481
Mohammad Mahmoody, Yuval Ishai, Amit Sahai
Publication date: 15 June 2012
Published in: Theory of Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-28914-9_9
probabilistically checkable proofszero-knowledgeArthur-Merlin gamessublinear argumentstamper-proof tokens
Cryptography (94A60) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)
Related Items (12)
Secure computation from one-way noisy communication, or: anti-correlation via anti-concentration ⋮ Round-optimal fully black-box zero-knowledge arguments from one-way permutations ⋮ Interactive Oracle Proofs ⋮ ZK-PCPs from leakage-resilient secret sharing ⋮ Zero-knowledge IOPs with linear-time prover and polylogarithmic-time verifier ⋮ Ligero: lightweight sublinear arguments without a trusted setup ⋮ A new approach to efficient non-malleable zero-knowledge ⋮ Actively secure garbled circuits with constant communication overhead in the plain model ⋮ Making the Best of a Leaky Situation: Zero-Knowledge PCPs from Leakage-Resilient Circuits ⋮ Quasi-Linear Size Zero Knowledge from Linear-Algebraic PCPs ⋮ Which languages have 4-round fully black-box zero-knowledge arguments from one-way functions? ⋮ Computational Integrity with a Public Random String from Quasi-Linear PCPs
This page was built for publication: On Efficient Zero-Knowledge PCPs
