Efficient Dynamic Proof of Retrievability (NDSS 2023)
-
Updated
Feb 12, 2024 - C
Efficient Dynamic Proof of Retrievability (NDSS 2023)
KZG10 polynomial commitment scheme providing constant-size cryptographic commitments and evaluation opening proofs over pairing groups.
Kate-Zaverucha-Goldberg (KZG) polynomial commitment evaluator with evaluation proofs
Kate-Zaverucha-Goldberg (KZG) polynomial commitment evaluator with evaluation proofs
KZG10 polynomial commitment scheme providing constant-size cryptographic commitments and evaluation opening proofs over pairing groups.
Distributed Key Generation Algorithm via Joint-Feldman's VSS in Rust.
From-scratch Rust implementation of WHIR/BaseFold multilinear polynomial commitment schemes (learning exercise)
Browser-based polynomial commitment demo — KZG on BLS12-381, IPA, and FRI committing to the same polynomial, plus a multi-party powers-of-tau ceremony. Every contributor secretly keeps their toxic waste, the transcript still verifies, and the reconstructed trapdoor forges an opening the pairing accepts.
KZG polynomial commitments over bls12-381 in JavaScript
Boolean-kernel basis: native evaluation-form FRI folding, a multilinear PCS, post-quantum security, Lean 4 formalisation (no sorry)
Kronecker-FRI: hash-based multilinear polynomial commitment from a coefficient-extraction identity — paper, proofs, Rust
To associate your repository with the polynomial-commitment topic, visit your repo's landing page and select "manage topics."