Recursive proof composition from accumulation schemes
From MaRDI portal
Publication:2119035
DOI10.1007/978-3-030-64378-2_1zbMath1485.94132OpenAlexW3113554767MaRDI QIDQ2119035
Nicholas Spooner, Pratyush Mishra, Benedikt Bünz, Alessandro Chiesa
Publication date: 23 March 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-64378-2_1
Related Items (18)
\textsf{Halo Infinite}: proof-carrying data from additive polynomial commitments ⋮ Proof-carrying data without succinct arguments ⋮ Time- and space-efficient arguments from groups of unknown order ⋮ On succinct non-interactive arguments in relativized worlds ⋮ An optimized inner product argument with more application scenarios ⋮ Plumo: an ultralight blockchain client ⋮ Witness-succinct universally-composable SNARKs ⋮ Proof-carrying data from arithmetized random oracles ⋮ On Valiant's conjecture. Impossibility of incrementally verifiable computation from random oracles ⋮ A survey of elliptic curves for proof systems ⋮ Ligero: lightweight sublinear arguments without a trusted setup ⋮ MyOPE: malicious security for oblivious polynomial evaluation ⋮ Maliciously secure massively parallel computation for all-but-one corruptions ⋮ Proofs for inner pairing products and applications ⋮ Nova: recursive zero-knowledge arguments from folding schemes ⋮ On black-box constructions of time and space efficient sublinear arguments from symmetric-key primitives ⋮ Revisiting cycles of pairing-friendly elliptic curves ⋮ Fully-succinct publicly verifiable delegation from constant-size assumptions
Uses Software
This page was built for publication: Recursive proof composition from accumulation schemes
