| Crates.io | dlog-sigma-primitives |
| lib.rs | dlog-sigma-primitives |
| version | 0.1.0 |
| created_at | 2025-10-28 08:49:40.018392+00 |
| updated_at | 2025-10-28 08:49:40.018392+00 |
| description | Collection of cryptographic primitives built on top of Elliptic Curve groups, with a focus on Zero-Knowledge Proofs. |
| homepage | |
| repository | https://github.com/aleph-fbk/pet-crypto-primitives-rs |
| max_upload_size | |
| id | 1904384 |
| size | 201,561 |
This library provides a collection of cryptographic primitives built on top of Elliptic Curve groups, taking advantage of the abstraction defined in dlog-group.
It includes support for the Modified ElGamal encryption scheme JCJ02, in both its standard and exponential variants. Additionally, it implements Pedersen Commitments TPP91 and a variety of Zero-Knowledge proofs (ZKPs) for discrete logarithm relations, made non-interactive using the Fiat-Shamir heuristic FS86 with the help of the well known merlin crate to construct transcripts and derive challenge values.
The library offers a wide range of proofs, from simple building blocks such as proving that the plaintext in an ElGamal ciphertext is zero to more advanced constructions, like designated verifier proofs.
This project has not been independently audited. Correctness and resistance to side-channel attacks are not guaranteed. The software is not ready for production use. Use at your own risk.
Licensed under either of Apache License Version 2.0, or MIT license.
This work has been supported by the joint laboratory between the Bruno Kessler Foundation (FBK) and the Italian Government Printing Office and Mint (IPZS).