Arguments of Proximity

DOI10.1007/978-3-662-48000-7_21zbMath1352.94063OpenAlexW2337421628MaRDI QIDQ3457077

Yael Tauman Kalai, Ron D. Rothblum

Publication date: 10 December 2015

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-48000-7_21

Mathematics Subject Classification ID

Related Items (11)

Proofs of Proximity for Context-Free Languages and Read-Once Branching Programs ⋮ A Hierarchy Theorem for Interactive Proofs of Proximity ⋮ Delegating RAM Computations ⋮ A Structural Theorem for Local Algorithms with Applications to Coding, Testing, and Verification ⋮ Zero-Knowledge Proofs of Proximity ⋮ Proofs of Proximity for Distribution Testing ⋮ An exponential separation between \textsf{MA} and \textsf{AM} proofs of proximity ⋮ Non-interactive proofs of proximity ⋮ Rational Sumchecks ⋮ Unnamed Item ⋮ Constant-Round Interactive Proofs for Delegating Computation

Cites Work

• Fast approximate probabilistically checkable proofs
• Time-Optimal Interactive Proofs for Circuit Evaluation
• Secure Two-Party Computation with Low Communication
• Progression-Free Sets and Sublinear Pairing-Based Non-Interactive Zero-Knowledge Arguments
• How to Delegate and Verify in Public: Verifiable Computation from Attribute-Based Encryption
• Short Pairing-Based Non-interactive Zero-Knowledge Arguments
• Linear-time encodable and decodable error-correcting codes
• Property testing and its connection to learning and approximation
• Non-interactive Verifiable Computing: Outsourcing Computation to Untrusted Workers
• Improved Delegation of Computation Using Fully Homomorphic Encryption
• Polynomial-Space Approximation of No-Signaling Provers
• From Secrecy to Soundness: Efficient Verification via Secure Computation
• Memory Delegation
• Robust PCPs of Proximity, Shorter PCPs, and Applications to Coding
• Assignment Testers: Towards a Combinatorial Proof of the PCP Theorem
• Unnamed Item

This page was built for publication: Arguments of Proximity