How to Delegate Computations: The Power of No-Signaling Proofs

DOI10.1145/3456867MaRDI QIDQ5066938zbMATH OpenOpenAlexWikidataFDO

Authors Yael Tauman Kalai, Ran Raz, Ron D. Rothblum

Publication date 31 March 2022

Published in Journal of the ACM (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/3456867

zbMATH Keywords

delegating computationsno-signaling proofs

Mathematics Subject Classification ID

Computer science (68-XX)

Recommendations

• How to delegate computations
• Delegation for bounded space
• No-signaling linear PCPs
• No-signaling linear PCPs
• Succinct delegation for low-space non-deterministic computation

Cited in

(9)

• Holographic SNARGs for P and batch-NP from (polynomially hard) learning with errors
• DELEGATING COMPUTATION VIA NO-SIGNALING STRATEGIES
• How to delegate computations
• No-signaling linear PCPs
• Public-coin three-round zero-knowledge from learning with errors and keyless multi-collision-resistant hash
• Reusable online-efficient commitments
• Constant-round arguments from one-way functions
• Constant-round arguments for batch-verification and bounded-space computations from one-way functions
• scientific article; zbMATH DE number 5485522 (Why is no real title available?)

This page was built for publication: How to Delegate Computations: The Power of No-Signaling Proofs

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