On Efficient Zero-Knowledge PCPs

DOI10.1007/978-3-642-28914-9_9MaRDI QIDQ2891481zbMATH OpenOpenAlexFDO

Authors Yuval Ishai, Mohammad Mahmoody, 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

zbMATH Keywords

zero-knowledgeprobabilistically checkable proofsArthur-Merlin gamessublinear argumentstamper-proof tokens

Mathematics Subject Classification ID

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

Recommendations

• Zero knowledge with efficient provers
• Zero-knowledge proofs on secret-shared data via fully linear PCPs
• Efficient zero-knowledge proofs. (Abstract)
• Efficient fully secure computation via distributed zero-knowledge proofs
• On the Amortized Complexity of Zero-Knowledge Protocols
• On the amortized complexity of zero-knowledge protocols
• scientific article; zbMATH DE number 4191124
• Zero-knowledge proofs from secure multiparty computation
• Precise zero-knowledge arguments with poly-logarithmic efficiency
• scientific article; zbMATH DE number 1759795

Cited in

(24)

• Actively secure garbled circuits with constant communication overhead in the plain model
• scientific article; zbMATH DE number 1952907 (Why is no real title available?)
• Interactive locking, zero-knowledge PCPs, and unconditional cryptography
• Languages with efficient zero-knowledge PCPs are in SZK
• Round-optimal fully black-box zero-knowledge arguments from one-way permutations
• Secure computation from one-way noisy communication, or: anti-correlation via anti-concentration
• Promise zero knowledge and its applications to round optimal MPC
• Zero-knowledge protocols for the subset sum problem from MPC-in-the-head with rejection
• Probabilistically checkable proofs of proximity with zero-knowledge
• Efficient Delegation of Zero-Knowledge Proofs of Knowledge in a Pairing-Friendly Setting
• 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
• Universally composable succinct vector commitments and applications
• Precise zero-knowledge arguments with poly-logarithmic efficiency
• Interactive oracle proofs
• Quasi-linear size zero knowledge from linear-algebraic PCPs
• Computational integrity with a public random string from quasi-linear PCPs
• Zero-knowledge IOPs with linear-time prover and polylogarithmic-time verifier
• Perfect zero knowledge: new upperbounds and relativized separations
• Which languages have 4-round fully black-box zero-knowledge arguments from one-way functions?
• Are PCPs inherent in efficient arguments?
• Zero-knowledge elementary databases with more expressive queries
• A new approach to efficient non-malleable zero-knowledge

This page was built for publication: On Efficient Zero-Knowledge PCPs

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