On Extractability of the KZG Family of Polynomial Commitment Schemes
Open Access
- 17 August 2025
- book chapter
- Published by Springer Nature
- p. 584-616
Abstract
No abstract availableKeywords
This publication has 31 references indexed in Scilit:
- HyperPlonk: Plonk with Linear-Time Prover and High-Degree Custom Gates2023
- Dory: Efficient, Transparent Arguments for Generalised Inner Products and Polynomial Commitments2021
- A Compressed $\varSigma $-Protocol Theory for Lattices2021
- Halo Infinite: Proof-Carrying Data from Additive Polynomial Commitments2021
- Spartan: Efficient and General-Purpose zkSNARKs Without Trusted Setup2020
- Marlin: Preprocessing zkSNARKs with Universal and Updatable SRS2020
- Transparent SNARKs from DARK Compilers2020
- Shorter Pairing-Based Arguments Under Standard Assumptions2019
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems2000
- Lower Bounds for Discrete Logarithms and Related Problems1997