Languages with efficient zero-knowledge PCPs are in SZK

DOI10.1007/978-3-642-36594-2_17MaRDI QIDQ4910284zbMATH OpenOpenAlexFDO

Authors Mohammad Mahmoody, David Xiao

Publication date 18 March 2013

Published in Theory of Cryptography (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-36594-2_17

zbMATH Keywords

probabilistically checkable proofsstatistical zero-knowledge

Mathematics Subject Classification ID

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

Recommendations

• On Efficient Zero-Knowledge PCPs
• scientific article; zbMATH DE number 1559565
• Zero knowledge with efficient provers
• scientific article; zbMATH DE number 7706038
• On relationships between statistical zero-knowledge proofs

Cited in

(6)

• Zero knowledge with efficient provers
• Secure computation from one-way noisy communication, or: anti-correlation via anti-concentration
• ZK-PCPs from leakage-resilient secret sharing
• Quasi-linear size zero knowledge from linear-algebraic PCPs
• Computational integrity with a public random string from quasi-linear PCPs
• Zero knowledge protocols from succinct constraint detection

This page was built for publication: Languages with efficient zero-knowledge PCPs are in SZK

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