Pages that link to "Item:Q2986889"
From MaRDI portal
The following pages link to Fast reductions from RAMs to delegatable succinct constraint satisfaction problems (Q2986889):
Displaying 14 items.
- Shorter arithmetization of nondeterministic computations (Q496013) (← links)
- Local reduction (Q1641001) (← links)
- Scalable zero knowledge via cycles of elliptic curves (Q1688401) (← links)
- Spartan: efficient and general-purpose zkSNARKs without trusted setup (Q2104239) (← links)
- \textsf{Halo Infinite}: proof-carrying data from additive polynomial commitments (Q2120097) (← links)
- Succinct non-interactive arguments via linear interactive proofs (Q2136170) (← links)
- Preprocessing succinct non-interactive arguments for rank-1 constraint satisfiability from holographic proofs (Q2163394) (← links)
- Linear-size constant-query IOPs for delegating computation (Q2175951) (← links)
- Quasi-Linear Size Zero Knowledge from Linear-Algebraic PCPs (Q2799089) (← links)
- Local Reductions (Q3448833) (← links)
- Computational Integrity with a Public Random String from Quasi-Linear PCPs (Q5270376) (← links)
- Fiat-Shamir security of FRI and related SNARKs (Q6562558) (← links)
- Polynomial IOPs for memory consistency checks in zero-knowledge virtual machines (Q6562561) (← links)
- On soundness notions for interactive oracle proofs (Q6655868) (← links)
