Efficient Dynamic Proof of Retrievability (NDSS 2023)
-
Updated
Feb 12, 2024 - C
Efficient Dynamic Proof of Retrievability (NDSS 2023)
Distributed Key Generation Algorithm via Joint-Feldman's VSS in Rust.
KZG polynomial commitments over bls12-381 in JavaScript
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.
Add a description, image, and links to the polynomial-commitment topic page so that developers can more easily learn about it.
To associate your repository with the polynomial-commitment topic, visit your repo's landing page and select "manage topics."