Succinct Functional Commitments for Circuits from k-$\textsf{Lin}$
Authors:
- 8 May 2024
- book chapter
- Published by Springer Nature
- p. 280-310
Abstract
No abstract availableKeywords
This publication has 46 references indexed in Scilit:
- Dory: Efficient, Transparent Arguments for Generalised Inner Products and Polynomial Commitments2021
- Fully-Succinct Publicly Verifiable Delegation from Constant-Size Assumptions2021
- Somewhere Statistical Soundness, Post-Quantum Security, and SNARGs2021
- Halo Infinite: Proof-Carrying Data from Additive Polynomial Commitments2021
- Succinct Functional Commitment for a Large Class of Arithmetic Circuits2020
- Marlin: Preprocessing zkSNARKs with Universal and Updatable SRS2020
- Transparent SNARKs from DARK Compilers2020
- Fractal: Post-quantum and Transparent Recursive Proofs from Holography2020
- Shorter Pairing-Based Arguments Under Standard Assumptions2019
- Subvector Commitments with Application to Succinct Arguments2019