BaseFold: Efficient Field-Agnostic Polynomial Commitment Schemes from Foldable Codes
- 16 August 2024
- book chapter
- Published by Springer Nature
- p. 138-169
Abstract
No abstract availableKeywords
This publication has 24 references indexed in Scilit:
- HyperPlonk: Plonk with Linear-Time Prover and High-Degree Custom Gates2023
- Scalable and Transparent Proofs over All Large Fields, via Elliptic Curves2022
- Orion: Zero Knowledge Proof with Linear Prover Time2022
- Gemini: Elastic SNARKs for Diverse Environments2022
- Linear-Time Arguments with Sublinear Verification from Tensor Codes2020
- Marlin: Preprocessing zkSNARKs with Universal and Updatable SRS2020
- Transparent SNARKs from DARK Compilers2020
- Interactive Oracle Proofs2016
- Signatures of Correct Computation2013
- Constant-Size Commitments to Polynomials and Their Applications2010