Constant-round interactive proofs for delegating computation
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 5485433 (Why is no real title available?)
- scientific article; zbMATH DE number 5485522 (Why is no real title available?)
- scientific article; zbMATH DE number 1332658 (Why is no real title available?)
- scientific article; zbMATH DE number 1559559 (Why is no real title available?)
- scientific article; zbMATH DE number 1559566 (Why is no real title available?)
- scientific article; zbMATH DE number 7250162 (Why is no real title available?)
- scientific article; zbMATH DE number 4185024 (Why is no real title available?)
- A Pseudorandom Generator from any One-way Function
- Algebraic methods for interactive proof systems
- Arguments of proximity (extended abstract)
- Arthur-Merlin games: A randomized proof system, and a hierarchy of complexity classes
- Assignment Testers: Towards a Combinatorial Proof of the PCP Theorem
- Bit commitment using pseudorandomness
- Bravely, moderately: a common theme in four recent works
- Computational Complexity
- Constant-round interactive proofs for delegating computation
- Delegating computation: interactive proofs for muggles
- Delegation for bounded space
- Efficient Probabilistically Checkable Debates
- Efficient checking of polynomials and proofs and the hardness of approximation problems
- Entropy waves, the zig-zag graph product, and new constant-degree expanders
- Fast approximate probabilistically checkable proofs
- From extractable collision resistance to succinct non-interactive arguments of knowledge, and back again
- From secrecy to soundness: efficient verification via secure computation (extended abstract)
- Highly resilient correctors for polynomials
- How to delegate and verify in public: verifiable computation from attribute-based encryption
- How to delegate computations
- IP = PSPACE
- IP = PSPACE using error-correcting codes
- Improved delegation of computation using fully homomorphic encryption
- Improved low-degree testing and its applications
- Indistinguishability obfuscation for Turing machines with unbounded memory
- Interactive oracle proofs
- Interactive oracle proofs with constant rate and query complexity
- Interactive proofs of proximity: delegating computation in sublinear time
- Locally testable codes and PCPs of almost-linear length
- NP is as easy as detecting unique solutions
- Nearly-linear size holographic proofs
- New limits to classical and quantum instance compression
- Non-interactive delegation and batch NP verification from standard computational assumptions
- Non-interactive proofs of proximity
- Non-interactive verifiable computing: outsourcing computation to untrusted workers
- On codes derivable from the tensor product of check matrices
- On interactive proofs with a laconic prover
- On the complexity of interactive proofs with bounded communication
- On the compressibility of \(\mathcal{NP}\) instances and cryptographic applications
- On zero-testable homomorphic encryption and publicly verifiable non-interactive arguments
- Progression-free sets and sublinear pairing-based non-interactive zero-knowledge arguments
- Proofs of proximity for context-free languages and read-once branching programs
- Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems
- Property testing and its connection to learning and approximation
- Pseudorandom generators for space-bounded computation
- Quadratic span programs and succinct NIZKs without PCPs
- Quasi-linear size zero knowledge from linear-algebraic PCPs
- Recursive composition and bootstrapping for SNARKs and proof-carrying data
- Relations Among Complexity Measures
- Robust Characterizations of Polynomials with Applications to Program Testing
- Robust PCPs of Proximity, Shorter PCPs, and Applications to Coding
- Secure two-party computation with low communication
- Separating succinct non-interactive arguments from all falsifiable assumptions
- Short pairing-based non-interactive zero-knowledge arguments
- Succinct garbling and indistinguishability obfuscation for RAM programs
- Succinct non-interactive arguments via linear interactive proofs
- Succinct randomized encodings and their applications
- The Knowledge Complexity of Interactive Proof Systems
- The PCP theorem by gap amplification
- Undirected connectivity in log-space
Cited in
(40)- Interactive distributed proofs
- Pseudo-deterministic proofs
- Competing-provers protocols for circuit evaluation
- Doubly-efficient batch verification in statistical zero-knowledge
- Rate-1 zero-knowledge proofs from one-way functions
- Homomorphic secret sharing with verifiable evaluation
- Fiat-Shamir for repeated squaring with applications to PPAD-hardness and VDFs
- scientific article; zbMATH DE number 7563815 (Why is no real title available?)
- Lattice-based succinct arguments for NP with polylogarithmic-time verification
- Constant-Round Interactive Proof Systems for AC0[2] and NC1
- No-signaling linear PCPs
- Parallelizable delegation from LWE
- Distributed-prover interactive proofs
- A Structural Theorem for Local Algorithms with Applications to Coding, Testing, and Verification
- How to delegate computations
- Nearly optimal property preserving hashing
- Local proofs approaching the witness length
- Improved Merlin-Arthur protocols for central problems in fine-grained complexity
- Interactive proofs of proximity: delegating computation in sublinear time
- Non-interactive publicly-verifiable delegation of committed programs
- Linear prover IOPs in log star rounds
- Time-optimal interactive proofs for circuit evaluation
- Faster sounder succinct arguments and \textsf{IOP}s
- Competing provers protocols for circuit evaluation
- Delegation for bounded space
- Constant-round interactive proofs for delegating computation
- Distribution-free proofs of proximity
- Streaming zero-knowledge proofs
- Polynomial commitments for Galois rings and applications to SNARKs over \(\mathbb{Z}_{2^k}\)
- Linear-size constant-query IOPs for delegating computation
- Public-coin, complexity-preserving, succinct arguments of knowledge for NP from collision-resistance
- Strong batching for non-interactive statistical zero-knowledge
- Incrementally verifiable computation via incremental PCPs
- Verifying and decoding in constant depth
- A PCP theorem for interactive proofs and applications
- When Arthur has neither random coins nor time to spare: superfast derandomization of proof systems
- scientific article; zbMATH DE number 1670844 (Why is no real title available?)
- scientific article; zbMATH DE number 5485522 (Why is no real title available?)
- Delegating computation: interactive proofs for muggles
- Succinct interactive oracle proofs: applications and limitations
This page was built for publication: Constant-round interactive proofs for delegating computation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4997311)
