Probabilistically checkable proofs of proximity with zero-knowledge

DOI10.1007/978-3-642-54242-8_6MaRDI QIDQ5746335zbMATH OpenOpenAlexFDO

Authors Yuval Ishai, Mor Weiss

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

Mathematics Subject Classification ID

Cryptography (94A60) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Recommendations

• Zero-knowledge proofs of proximity
• scientific article; zbMATH DE number 1559565
• On Efficient Zero-Knowledge PCPs
• Interactive PCP
• scientific article; zbMATH DE number 7706038

Cited in

(31)

• Actively secure garbled circuits with constant communication overhead in the plain model
• zkSNARKs in the ROM with unconditional UC-security
• Black-box anonymous commit-and-prove
• Interactive PCP
• Zero-knowledge proofs of proximity
• scientific article; zbMATH DE number 1559565 (Why is no real title available?)
• Beyond MPC-in-the-head: black-box constructions of short zero-knowledge proofs
• Your reputation's safe with me: framing-free distributed zero-knowledge proofs
• Round-optimal black-box commit-and-prove with succinct communication
• Your reputation's safe with me: framing-free distributed zero-knowledge proofs
• Smooth and strong PCPs
• Ligero: lightweight sublinear arguments without a trusted setup
• ZK-PCPs from leakage-resilient secret sharing
• Making the best of a leaky situation: zero-knowledge PCPs from leakage-resilient circuits
• On the Power of Secure Two-Party Computation
• Quasi-linear size zero knowledge from linear-algebraic PCPs
• Computational integrity with a public random string from quasi-linear PCPs
• Optimal Proximity Proofs Revisited
• Fast Reed-Solomon interactive oracle proofs of proximity
• Asymptotically quasi-optimal cryptography
• Streaming zero-knowledge proofs
• Zero-knowledge proofs on secret-shared data via fully linear PCPs
• A PCP theorem for interactive proofs and applications
• Zero knowledge protocols from succinct constraint detection
• Zero-knowledge RAM: doubly efficient and black-box
• Query-reusable proof systems
• On the power of secure two-party computation
• Zero-knowledge IOPs approaching witness length
• A new approach to efficient non-malleable zero-knowledge
• Card-based zero-knowledge proof for the nearest neighbor property: zero-knowledge proof of ABC end view
• (Commit-and-prove) predictable arguments with privacy

This page was built for publication: Probabilistically checkable proofs of proximity with zero-knowledge

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5746335)