Pages that link to "Item:Q5495829"
From MaRDI portal
The following pages link to On the concrete efficiency of probabilistically-checkable proofs (Q5495829):
Displaying 29 items.
- Shorter arithmetization of nondeterministic computations (Q496013) (← links)
- Are PCPs inherent in efficient arguments? (Q626678) (← links)
- Efficient rational proofs with strong utility-gap guarantees (Q1617659) (← links)
- Scalable zero knowledge via cycles of elliptic curves (Q1688401) (← links)
- The hunting of the SNARK (Q1698394) (← links)
- SPARKs: succinct parallelizable arguments of knowledge (Q2055636) (← links)
- Spartan: efficient and general-purpose zkSNARKs without trusted setup (Q2104239) (← links)
- Succinct non-interactive arguments via linear interactive proofs (Q2136170) (← links)
- Asymptotically quasi-optimal cryptography (Q2170004) (← links)
- Linear-size constant-query IOPs for delegating computation (Q2175951) (← links)
- Efficient multivariate low-degree tests via interactive oracle proofs of proximity for polynomial codes (Q2692970) (← links)
- Optimal Proximity Proofs Revisited (Q2794513) (← links)
- Quasi-Linear Size Zero Knowledge from Linear-Algebraic PCPs (Q2799089) (← links)
- Efficient Probabilistically Checkable Debates (Q3088122) (← links)
- Local Reductions (Q3448833) (← links)
- Optimizing a Certified Proof Checker for a Large-Scale Computer-Generated Proof (Q3453106) (← links)
- A Randomized Algorithm for BBCSPs in the Prover-Verifier Model (Q3525105) (← links)
- (Q4527017) (← links)
- On axis-parallel tests for tensor product codes (Q5002642) (← links)
- Fast Reed-Solomon Interactive Oracle Proofs of Proximity (Q5002680) (← links)
- On axis-parallel tests for tensor product codes (Q5140839) (← links)
- Computational Integrity with a Public Random String from Quasi-Linear PCPs (Q5270376) (← links)
- Sublinear Zero-Knowledge Arguments for RAM Programs (Q5738888) (← links)
- Ligero: lightweight sublinear arguments without a trusted setup (Q6063128) (← links)
- Parallelizable delegation from LWE (Q6114288) (← links)
- A new approach to efficient non-malleable zero-knowledge (Q6166959) (← links)
- Scalable and transparent proofs over all large fields, via elliptic curves. ECFFT. II (Q6169368) (← links)
- Public-coin, complexity-preserving, succinct arguments of knowledge for NP from collision-resistance (Q6637522) (← links)
- Constant-size zk-SNARKs in ROM from falsifiable assumptions (Q6637561) (← links)
