Interactive proofs of proximity: delegating computation in sublinear time
From MaRDI portal
Recommendations
Cited in
(43)- Proofs of proximity for context-free languages and read-once branching programs
- Non-interactive proofs of proximity
- An exponential separation between \textsf{MA} and \textsf{AM} proofs of proximity
- Universal locally verifiable codes and 3-round interactive proofs of proximity for CSP
- \textsc{Fractal}: post-quantum and transparent recursive proofs from holography
- Interactive proofs for social graphs
- Batch verification and proofs of proximity with polylog overhead
- More efficient amortization of exact zero-knowledge proofs for LWE
- Efficient multivariate low-degree tests via interactive oracle proofs of proximity for polynomial codes
- Optimal Proximity Proofs Revisited
- Rational sumchecks
- Non-interactive proofs of proximity
- Delegating computation: interactive proofs for muggles
- Delegating RAM Computations
- Proofs of proximity for context-free languages and read-once branching programs
- Arguments of proximity (extended abstract)
- scientific article; zbMATH DE number 5485522 (Why is no real title available?)
- Interactive proofs and the hardness of approximating cliques
- A hierarchy theorem for interactive proofs of proximity
- Zero-knowledge proofs of proximity
- Proofs of proximity for distribution testing
- Constant-round interactive proofs for delegating computation
- An exponential separation between MA and AM proofs of proximity
- Non-cooperative rational interactive proofs
- scientific article; zbMATH DE number 7250162 (Why is no real title available?)
- scientific article; zbMATH DE number 7250164 (Why is no real title available?)
- Constant-round interactive proofs for delegating computation
- A Structural Theorem for Local Algorithms with Applications to Coding, Testing, and Verification
- Constant-round arguments from one-way functions
- Distributed-prover interactive proofs
- Holographic SNARGs for P and batch-NP from (polynomially hard) learning with errors
- Distribution-free proofs of proximity
- Streaming zero-knowledge proofs
- On testing group properties
- Public-coin three-round zero-knowledge from learning with errors and keyless multi-collision-resistant hash
- WHIR: Reed-Solomon proximity testing with super-fast verification
- Blaze: fast SNARKs from interleaved RAA codes
- Public coin interactive proofs for label-invariant distribution properties
- Doubly-efficient batch verification in statistical zero-knowledge
- Hamming weight proofs of proximity with one-sided error
- Local proofs approaching the witness length
- Proximity gaps for Reed-Solomon codes
- How to make rational arguments practical and extractable
This page was built for publication: Interactive proofs of proximity: delegating computation in sublinear time
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5495850)
