zksk: A Library for Composable Zero-Knowledge Proofs
Not on the map. Why?
Abstract (arXiv)
Zero-knowledge proofs are an essential building block in many privacy-preserving systems. However, implementing these proofs is tedious and error-prone. In this paper, we present zksk, a well-documented Python library for defining and computing sigma protocols: the most popular class of zero-knowledge proofs. In zksk, proofs compose: programmers can convert smaller proofs into building blocks that then can be combined into bigger proofs. zksk features a modern Python-based domain-specific language. This makes possible to define proofs without learning a new custom language, and to benefit from the rich Python syntax and ecosystem. The library is available at https://github.com/spring-epfl/zksk
Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). First posted on arXiv 6 Nov 2019.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2026: 1.
1 paper.
- 2026End-to-End Verifiable and Robust Federated Learningcited by 0
- 2026End-to-End Verifiable and Robust Federated Learning14 Sep 2026