Delegating computation: interactive proofs for muggles
From MaRDI portal
Recommendations
Cited in
(68)- Public-coin 3-round zero-knowledge from learning with errors and keyless multi-collision-resistant hash
- Competing-provers protocols for circuit evaluation
- Doubly-efficient batch verification in statistical zero-knowledge
- Rate-1 zero-knowledge proofs from one-way functions
- Constant-Round Interactive Proof Systems for AC0[2] and NC1
- Spatial Isolation Implies Zero Knowledge Even in a Quantum World
- Energy complexity of computation
- scientific article; zbMATH DE number 7250160 (Why is no real title available?)
- Non-interactive delegation and batch NP verification from standard computational assumptions
- Parallelizable delegation from LWE
- Beyond MPC-in-the-head: black-box constructions of short zero-knowledge proofs
- Holographic SNARGs for P and batch-NP from (polynomially hard) learning with errors
- Two protocols for delegation of computation
- The power of distributed verifiers in interactive proofs
- Simple doubly-efficient interactive proof systems for locally-characterizable sets
- Witness indistinguishability for any single-round argument with applications to access control
- Round-optimal black-box commit-and-prove with succinct communication
- Uni/multi variate polynomial embeddings for zkSNARKs
- Local proofs approaching the witness length
- Corrigimus, verificamus, vincimus: ensuring algorithmic accuracy in an age of uncertainty
- Ligero: lightweight sublinear arguments without a trusted setup
- Interactive proofs of proximity: delegating computation in sublinear time
- Interactive proofs for verifying machine learning
- Doubly efficient interactive proofs over infinite and non-commutative rings
- Scalable zkSNARKs for matrix computations. A generic framework for verifiable deep learning
- Non-interactive publicly-verifiable delegation of committed programs
- Time-space trade-offs for sumcheck
- Time-optimal interactive proofs for circuit evaluation
- Practical verified computation with streaming interactive proofs
- How to Verify a Quantum Computation
- Competing provers protocols for circuit evaluation
- Secure and efficient delegation of elliptic-curve pairing
- SNARGs for P from sub-exponential DDH and QR
- Constant-round interactive proofs for delegating computation
- \textsc{Fractal}: post-quantum and transparent recursive proofs from holography
- SPARKs: succinct parallelizable arguments of knowledge
- Verifiable computation for approximate homomorphic encryption schemes
- Zero-knowledge in streaming interactive proofs
- No-signaling linear PCPs
- Distribution-free proofs of proximity
- Explicit time and space efficient encoders exist only with random access
- Towards a white-box secure Fiat-Shamir transformation
- How to prove false statements: practical attacks on Fiat-Shamir
- Towards reducing delegation overhead in replication-based verification: an incentive-compatible rational delegation computing scheme
- Succinct arguments in the quantum random oracle model
- Outsourcing computation: the minimal refereed mechanism
- Unconditional proofs of quantumness between small-space machines
- Elimination-based certificates for triangular equivalence and rank profiles
- Constant-round interactive proofs for delegating computation
- Polynomial-time pseudodeterministic construction of primes
- Verifying and decoding in constant depth
- Loquat: a SNARK-friendly post-quantum signature based on the Legendre PRF with applications in ring and aggregate signatures
- Public-coin three-round zero-knowledge from learning with errors and keyless multi-collision-resistant hash
- Zero-knowledge RAM: doubly efficient and black-box
- Blaze: fast SNARKs from interleaved RAA codes
- Succinct arguments over towers of binary fields
- \(\mathrm{P}\) has polynomial-time finite-state verifiers
- Instance-wise hardness and refutation versus derandomization for Arthur-Merlin protocols
- Functional commitments for arbitrary circuits of bounded sizes
- Constant-round arguments from one-way functions
- When Arthur has neither random coins nor time to spare: superfast derandomization of proof systems
- BaseFold: efficient field-agnostic polynomial commitment schemes from foldable codes
- Zero-knowledge IOPs approaching witness length
- scientific article; zbMATH DE number 5485522 (Why is no real title available?)
- Marlin: preprocessing zkSNARKs with universal and updatable SRS
- Rational arguments: single round delegation with sublinear verification
- Refereed delegation of computation
- Succinct interactive oracle proofs: applications and limitations
This page was built for publication: Delegating computation: interactive proofs for muggles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3177732)
