The following pages link to Delegating Computation (Q3177732):
Displaying 35 items.
- Refereed delegation of computation (Q385709) (← links)
- Outsourcing computation: the minimal refereed mechanism (Q777972) (← links)
- SPARKs: succinct parallelizable arguments of knowledge (Q2055636) (← links)
- Marlin: preprocessing zkSNARKs with universal and updatable SRS (Q2055641) (← links)
- \textsc{Fractal}: post-quantum and transparent recursive proofs from holography (Q2055643) (← links)
- Witness indistinguishability for any single-round argument with applications to access control (Q2055687) (← links)
- Round-optimal black-box commit-and-prove with succinct communication (Q2096539) (← links)
- SNARGs for P from sub-exponential DDH and QR (Q2170061) (← links)
- Succinct arguments in the quantum random oracle model (Q2175929) (← links)
- Secure and efficient delegation of elliptic-curve pairing (Q2229264) (← links)
- Elimination-based certificates for triangular equivalence and rank profiles (Q2284959) (← links)
- Practical verified computation with streaming interactive proofs (Q2826047) (← links)
- Competing-provers protocols for circuit evaluation (Q3191608) (← links)
- Verifying and decoding in constant depth (Q3549643) (← links)
- (Q3549691) (← links)
- How to Verify a Quantum Computation (Q4568113) (← links)
- Non-interactive delegation and batch NP verification from standard computational assumptions (Q4977995) (← links)
- Simple doubly-efficient interactive proof systems for locally-characterizable sets (Q4993281) (← links)
- Constant-Round Interactive Proofs for Delegating Computation (Q4997311) (← links)
- Spatial Isolation Implies Zero Knowledge Even in a Quantum World (Q5066952) (← links)
- Constant-Round Interactive Proof Systems for AC0[2] and NC1 (Q5098783) (← links)
- (Q5121908) (← links)
- Interactive proofs of proximity (Q5495850) (← links)
- No-signaling linear PCPs (Q5925695) (← links)
- Ligero: lightweight sublinear arguments without a trusted setup (Q6063128) (← links)
- Towards reducing delegation overhead in replication-based verification: an incentive-compatible rational delegation computing scheme (Q6086333) (← links)
- Parallelizable delegation from LWE (Q6114288) (← links)
- Succinct interactive oracle proofs: applications and limitations (Q6155266) (← links)
- Doubly efficient interactive proofs over infinite and non-commutative rings (Q6169369) (← links)
- Beyond MPC-in-the-head: black-box constructions of short zero-knowledge proofs (Q6581781) (← links)
- Holographic SNARGs for P and batch-NP from (polynomially hard) learning with errors (Q6582222) (← links)
- Loquat: a SNARK-friendly post-quantum signature based on the Legendre PRF with applications in ring and aggregate signatures (Q6648186) (← links)
- Functional commitments for arbitrary circuits of bounded sizes (Q6651898) (← links)
- Zero-knowledge IOPs approaching witness length (Q6660294) (← links)
- BaseFold: efficient field-agnostic polynomial commitment schemes from foldable codes (Q6660296) (← links)
