scientific article; zbMATH DE number 7650353
From MaRDI portal
Publication:5875697
Cited in
(33)- \textsc{Fractal}: post-quantum and transparent recursive proofs from holography
- Time- and space-efficient arguments from groups of unknown order
- High-threshold AVSS with optimal communication complexity
- A PCP theorem for interactive proofs and applications
- Efficient multivariate low-degree tests via interactive oracle proofs of proximity for polynomial codes
- On interactive oracle proofs for Boolean R1CS statements
- Speed-stacking: fast sublinear zero-knowledge proofs for disjunctions
- Ligero: lightweight sublinear arguments without a trusted setup
- Scalable and transparent proofs over all large fields, via elliptic curves. ECFFT. II
- \textsf{Bingo}: adaptivity and asynchrony in verifiable secret sharing and distributed key generation
- DEEP-FRI: Sampling outside the box improves soundness
- Efficient transparent polynomial commitments for zk-SNARKs
- Fiat-Shamir security of FRI and related SNARKs
- Distributed-prover interactive proofs
- From polynomial IOP and commitments to non-malleable zkSNARKs
- FRIDA: data availability sampling from FRI
- On soundness notions for interactive oracle proofs
- Zero-knowledge IOPs approaching witness length
- BaseFold: efficient field-agnostic polynomial commitment schemes from foldable codes
- Field-agnostic SNARKs from expand-accumulate codes
- STIR: Reed-Solomon proximity testing with fewer queries
- How to prove statements obliviously?
- On the concrete security of non-interactive FRI
- \textsc{Arc}: accumulation for Reed-Solomon codes
- Bivariate proximity test-based asynchronous verifiable secret sharing
- WHIR: Reed-Solomon proximity testing with super-fast verification
- Blaze: fast SNARKs from interleaved RAA codes
- Local proofs approaching the witness length
- Proximity gaps for Reed-Solomon codes
- Linear-time accumulation schemes
- Query-optimal IOPPs for linear-time encodable codes
- How to prove post-quantum security for succinct non-interactive reductions
- Foundations of data availability sampling
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5875697)
