Languages with Efficient Zero-Knowledge PCPs are in SZK

DOI10.1007/978-3-642-36594-2_17zbMath1315.94089OpenAlexW1502260804MaRDI QIDQ4910284

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)

Related Items (3)

Secure computation from one-way noisy communication, or: anti-correlation via anti-concentration ⋮ Quasi-Linear Size Zero Knowledge from Linear-Algebraic PCPs ⋮ Computational Integrity with a Public Random String from Quasi-Linear PCPs

This page was built for publication: Languages with Efficient Zero-Knowledge PCPs are in SZK