Pages that link to "Item:Q5361818"
From MaRDI portal
The following pages link to Constant-round interactive proofs for delegating computation (Q5361818):
Displaying 40 items.
- Outsourcing computation: the minimal refereed mechanism (Q777972) (← links)
- Proofs of proximity for context-free languages and read-once branching programs (Q1640993) (← links)
- Fiat-Shamir and correlation intractability from strong KDM-secure encryption (Q1648782) (← links)
- An exponential separation between \textsf{MA} and \textsf{AM} proofs of proximity (Q1983326) (← links)
- Universal locally verifiable codes and 3-round interactive proofs of proximity for CSP (Q2043015) (← links)
- Transparent SNARKs from DARK compilers (Q2055634) (← 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)
- Delegation with updatable unambiguous proofs and PPAD-hardness (Q2104236) (← links)
- Spartan: efficient and general-purpose zkSNARKs without trusted setup (Q2104239) (← links)
- TurboIKOS: improved non-interactive zero knowledge and post-quantum signatures (Q2117059) (← links)
- Time- and space-efficient arguments from groups of unknown order (Q2139631) (← links)
- Non-interactive batch arguments for NP from standard assumptions (Q2139642) (← links)
- More efficient amortization of exact zero-knowledge proofs for LWE (Q2148770) (← links)
- A PCP theorem for interactive proofs and applications (Q2170038) (← links)
- Zero-knowledge IOPs with linear-time prover and polylogarithmic-time verifier (Q2170049) (← links)
- Gemini: elastic SNARKs for diverse environments (Q2170056) (← links)
- SNARGs for P from sub-exponential DDH and QR (Q2170061) (← links)
- Succinct arguments in the quantum random oracle model (Q2175929) (← links)
- Linear-size constant-query IOPs for delegating computation (Q2175951) (← links)
- On the (In)security of Kilian-based SNARGs (Q2175953) (← links)
- Elimination-based certificates for triangular equivalence and rank profiles (Q2284959) (← links)
- Efficient multivariate low-degree tests via interactive oracle proofs of proximity for polynomial codes (Q2692970) (← links)
- Fully-succinct publicly verifiable delegation from constant-size assumptions (Q2695648) (← links)
- Interactive Oracle Proofs (Q3181021) (← links)
- A Hierarchy Theorem for Interactive Proofs of Proximity (Q4638092) (← links)
- Pseudo-deterministic Proofs (Q4993280) (← links)
- (Q4993281) (← links)
- Zero-Knowledge Proofs of Proximity (Q4993282) (← links)
- Fast and Deterministic Constant Factor Approximation Algorithms for LCS Imply New Circuit Lower Bounds (Q4993300) (← links)
- Proofs of Proximity for Distribution Testing (Q4993323) (← links)
- Constant-Round Interactive Proofs for Delegating Computation (Q4997311) (← links)
- Fast Reed-Solomon Interactive Oracle Proofs of Proximity (Q5002680) (← 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)
- (Q5121910) (← links)
- (Q5857610) (← links)
- Ligero: lightweight sublinear arguments without a trusted setup (Q6063128) (← links)
