Pages that link to "Item:Q5002680"
From MaRDI portal
The following pages link to Fast Reed-Solomon Interactive Oracle Proofs of Proximity (Q5002680):
Displaying 44 items.
- Transparent SNARKs from DARK compilers (Q2055634) (← links)
- \textsc{Fractal}: post-quantum and transparent recursive proofs from holography (Q2055643) (← links)
- Practical product proofs for lattice commitments (Q2096537) (← links)
- \textsf{Halo Infinite}: proof-carrying data from additive polynomial commitments (Q2120097) (← links)
- Time- and space-efficient arguments from groups of unknown order (Q2139631) (← links)
- Does Fiat-Shamir require a cryptographic hash function? (Q2139639) (← links)
- High-threshold AVSS with optimal communication complexity (Q2147255) (← links)
- Preprocessing succinct non-interactive arguments for rank-1 constraint satisfiability from holographic proofs (Q2163394) (← links)
- A PCP theorem for interactive proofs and applications (Q2170038) (← links)
- Gemini: elastic SNARKs for diverse environments (Q2170056) (← links)
- Linear-size constant-query IOPs for delegating computation (Q2175951) (← links)
- On the (In)security of Kilian-based SNARGs (Q2175953) (← links)
- Efficient multivariate low-degree tests via interactive oracle proofs of proximity for polynomial codes (Q2692970) (← links)
- Optimal Proximity Proofs Revisited (Q2794513) (← links)
- Worst-case to average case reductions for the distance to a code (Q5121912) (← links)
- On interactive oracle proofs for Boolean R1CS statements (Q6045202) (← links)
- Ligero: lightweight sublinear arguments without a trusted setup (Q6063128) (← links)
- On black-box constructions of time and space efficient sublinear arguments from symmetric-key primitives (Q6169365) (← links)
- Scalable and transparent proofs over all large fields, via elliptic curves. ECFFT. II (Q6169368) (← links)
- Efficient isogeny proofs using generic techniques (Q6535120) (← links)
- Fiat-Shamir security of FRI and related SNARKs (Q6562558) (← links)
- Your reputation's safe with me: framing-free distributed zero-knowledge proofs (Q6581782) (← links)
- Distributed-prover interactive proofs (Q6581784) (← links)
- Generalized special-sound interactive proofs and their knowledge soundness (Q6582226) (← links)
- Towards zero knowledge argument for double discrete logarithm with constant cost (Q6615217) (← links)
- eSTARK: extending STARKs with arguments (Q6632059) (← links)
- Concurrently secure blind Schnorr signatures (Q6636502) (← 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)
- SLAP: succinct lattice-based polynomial commitments from standard assumptions (Q6637716) (← links)
- \textsc{Zeromorph}: zero-knowledge multilinear-evaluation proofs from homomorphic univariate commitments (Q6639502) (← links)
- Loquat: a SNARK-friendly post-quantum signature based on the Legendre PRF with applications in ring and aggregate signatures (Q6648186) (← links)
- FRIDA: data availability sampling from FRI (Q6652989) (← links)
- CDS composition of multi-round protocols (Q6653053) (← links)
- On soundness notions for interactive oracle proofs (Q6655868) (← links)
- Zero-knowledge IOPs approaching witness length (Q6660294) (← links)
- BaseFold: efficient field-agnostic polynomial commitment schemes from foldable codes (Q6660296) (← links)
- Polynomial commitments from lattices: post-quantum security, fast verification and transparent setup (Q6660298) (← links)
- Greyhound: fast polynomial commitments from lattices (Q6660299) (← links)
- Field-agnostic SNARKs from expand-accumulate codes (Q6660301) (← links)
- STIR: Reed-Solomon proximity testing with fewer queries (Q6660306) (← links)
- Concretely efficient lattice-based polynomial commitment from standard assumptions (Q6660308) (← links)
- How to prove statements obliviously? (Q6660309) (← links)
- On the concrete security of non-interactive FRI (Q6660394) (← links)
