The following pages link to (Q5875697):
Displayed 10 items.
- \textsc{Fractal}: post-quantum and transparent recursive proofs from holography (Q2055643) (← links)
- Time- and space-efficient arguments from groups of unknown order (Q2139631) (← links)
- High-threshold AVSS with optimal communication complexity (Q2147255) (← links)
- A PCP theorem for interactive proofs and applications (Q2170038) (← links)
- Efficient multivariate low-degree tests via interactive oracle proofs of proximity for polynomial codes (Q2692970) (← links)
- On interactive oracle proofs for Boolean R1CS statements (Q6045202) (← links)
- Speed-stacking: fast sublinear zero-knowledge proofs for disjunctions (Q6061364) (← links)
- Ligero: lightweight sublinear arguments without a trusted setup (Q6063128) (← links)
- Scalable and transparent proofs over all large fields, via elliptic curves. ECFFT. II (Q6169368) (← links)
- \textsf{Bingo}: adaptivity and asynchrony in verifiable secret sharing and distributed key generation (Q6186586) (← links)