No-signaling linear PCPs
From MaRDI portal
Publication:5915596
DOI10.1007/978-3-030-03807-6_3zbMath1443.94068OpenAlexW2889307377MaRDI QIDQ5915596
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
no-signaling linear probabilistically checkable proof (PCP) systempolynomial-time deterministic computation
Related Items (2)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Probabilistic encryption
- On zero-testable homomorphic encryption and publicly verifiable non-interactive arguments
- The hunting of the SNARK
- Fully Succinct Garbled RAM
- Cryptography for Parallel RAM from Indistinguishability Obfuscation
- SNARKs for C: Verifying Program Executions Succinctly and in Zero Knowledge
- Succinct Non-Interactive Zero Knowledge Arguments from Span Programs and Linear Error-Correcting Codes
- Scalable Zero Knowledge via Cycles of Elliptic Curves
- 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
- Succinct Arguments from Multi-prover Interactive Proofs and Their Efficiency Benefits
- Square Span Programs with Applications to Succinct NIZK Arguments
- Indistinguishability Obfuscation for Turing Machines with Unbounded Memory
- Succinct Garbling and Indistinguishability Obfuscation for RAM Programs
- Succinct Randomized Encodings and their Applications
- Short Pairing-Based Non-interactive Zero-Knowledge Arguments
- Proof verification and the hardness of approximation problems
- Delegating RAM Computations with Adaptive Soundness and Privacy
- Interactive Oracle Proofs
- Adaptive Succinct Garbled RAM or: How to Delegate Your Database
- Delegating RAM Computations
- Non-interactive Verifiable Computing: Outsourcing Computation to Untrusted Workers
- Improved Delegation of Computation Using Fully Homomorphic Encryption
- Universal Arguments and their Applications
- Probabilistic checking of proofs
- Computationally Sound Proofs
- Succinct Non-interactive Arguments via Linear Interactive Proofs
- Quadratic Span Programs and Succinct NIZKs without PCPs
- Non-interactive delegation and batch NP verification from standard computational assumptions
- Succinct delegation for low-space non-deterministic computation
- How to delegate computations
- Lattice-Based SNARGs and Their Application to More Efficient Obfuscation
- Advances in Cryptology – CRYPTO 2004
- Computational Complexity
- Recursive composition and bootstrapping for SNARKS and proof-carrying data
- Delegation for bounded space
- On the Size of Pairing-Based Non-interactive Arguments
- No-signaling linear PCPs
This page was built for publication: No-signaling linear PCPs
