Making the Best of a Leaky Situation: Zero-Knowledge PCPs from Leakage-Resilient Circuits

DOI10.1007/978-3-662-49099-0_1zbMath1375.94136OpenAlexW2295312067MaRDI QIDQ2799088

Guang Yang, Mor Weiss, Yuval Ishai

Publication date: 8 April 2016

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

Full work available at URL: https://doi.org/10.1007/978-3-662-49099-0_1

zbMATH Keywords

probabilistically checkable proof (PCP)zero-knowledge PCP (ZKPCP)

Mathematics Subject Classification ID

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

Related Items (4)

ZK-PCPs from leakage-resilient secret sharing ⋮ Zero-Knowledge Proofs of Proximity ⋮ Unconditionally secure computation against low-complexity leakage ⋮ Correction to: ``Unconditionally secure computation against low-complexity leakage

Uses Software

• SNARKs for C
• zk-SNARK

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• SNARKs for C: Verifying Program Executions Succinctly and in Zero Knowledge
• Scalable Zero Knowledge via Cycles of Elliptic Curves
• On Efficient Zero-Knowledge PCPs
• Leakage-Resilient Circuits without Computational Assumptions
• How to Compute under $${\mathcal {\varvec{AC}}}^\mathbf{0}$$ Leakage without Secure Hardware
• On the randomness complexity of efficient sampling
• Correlation Bounds for Poly-size $\mbox{\rm AC}^0$ Circuits with n 1 − o(1) Symmetric Gates
• Protecting Circuits from Leakage: the Computationally-Bounded and Noisy Cases
• Noninteractive Zero-Knowledge
• Foundations of Cryptography
• The knowledge complexity of interactive proof-systems
• Advances in Cryptology - CRYPTO 2003
• Shielding circuits with groups
• Probabilistically Checkable Proofs of Proximity with Zero-Knowledge
• The PCP theorem by gap amplification

This page was built for publication: Making the Best of a Leaky Situation: Zero-Knowledge PCPs from Leakage-Resilient Circuits