No-signaling linear PCPs

DOI10.1007/978-3-030-03807-6_3MaRDI QIDQ5915596zbMATH OpenOpenAlexFDO

Authors Susumu Kiyoshima

Publication date 11 December 2018

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

Full work available at URL https://doi.org/10.1007/978-3-030-03807-6_3

zbMATH Keywords

no-signaling linear probabilistically checkable proof (PCP) systempolynomial-time deterministic computation

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• How to delegate computations
• Delegation for bounded space
• Probabilistic checking against non-signaling strategies from linearity testing
• DELEGATING COMPUTATION VIA NO-SIGNALING STRATEGIES
• Constant-round interactive proofs for delegating computation

Cites work

• Adaptive succinct garbled RAM or: how to delegate your database
• Advances in Cryptology – CRYPTO 2004
• Computational Complexity
• Computationally Sound Proofs
• Cryptography for parallel RAM from indistinguishability obfuscation
• Delegating RAM Computations
• Delegating RAM computations with adaptive soundness and privacy
• Delegation for bounded space
• Fully succinct garbled RAM
• How to delegate and verify in public: verifiable computation from attribute-based encryption
• How to delegate computations
• scientific article; zbMATH DE number 1670844 (Why is no real title available?)
• scientific article; zbMATH DE number 5485522 (Why is no real title available?)
• scientific article; zbMATH DE number 7250157 (Why is no real title available?)
• Improved delegation of computation using fully homomorphic encryption
• Indistinguishability obfuscation for Turing machines with unbounded memory
• Interactive oracle proofs
• Lattice-based SNARGs and their application to more efficient obfuscation
• No-signaling linear PCPs
• Non-interactive delegation and batch NP verification from standard computational assumptions
• Non-interactive verifiable computing: outsourcing computation to untrusted workers
• On the size of pairing-based non-interactive arguments
• On zero-testable homomorphic encryption and publicly verifiable non-interactive arguments
• Probabilistic checking of proofs
• Probabilistic encryption
• Progression-free sets and sublinear pairing-based non-interactive zero-knowledge arguments
• Proof verification and the hardness of approximation problems
• Quadratic span programs and succinct NIZKs without PCPs
• Recursive composition and bootstrapping for SNARKs and proof-carrying data
• Scalable zero knowledge via cycles of elliptic curves
• Secure two-party computation with low communication
• Short pairing-based non-interactive zero-knowledge arguments
• Snarks for C: verifying program executions succinctly and in zero knowledge
• Square span programs with applications to succinct NIZK arguments
• Succinct arguments from multi-prover interactive proofs and their efficiency benefits
• Succinct delegation for low-space non-deterministic computation
• Succinct garbling and indistinguishability obfuscation for RAM programs
• Succinct non-interactive arguments via linear interactive proofs
• Succinct non-interactive zero knowledge arguments from span programs and linear error-correcting codes
• Succinct randomized encodings and their applications
• The hunting of the SNARK
• Universal Arguments and their Applications

Cited in

(5)

• How to Delegate Computations: The Power of No-Signaling Proofs
• Probabilistic checking against non-signaling strategies from linearity testing
• Delegation for bounded space
• No-signaling linear PCPs
• No-signaling linear PCPs

This page was built for publication: No-signaling linear PCPs

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