A Rust workspace containing multiple crates for producing proofs-of-possession (PoPs) based on ECDSA over P256 curve.
This workspace currently contains the following crates:
- rok – An implementation of Reductions of Knowledge as defined in [1].
- r1csipa – An implementation of an R1CS to IPA (Inner Product Argument) transformation with zero-knowledge support that supports committed inputs based on this crate.
- ecdsa-pops – Implementations of PoPs.
- pop-circuit-ffa – An implementations of an arithmetic circuit based on the foreighn-field-arithmetic techniques of [2] used for ECDSA proof-of-possession.
This project is provided "as is" and is intended for educational and experimental purposes only. The library has not been audited. It is not production-ready and may contain bugs or incomplete features. Use at your own risk.
The authors and contributors are not responsible for any damage, loss of data, or other issues that may arise from using this software.
MIT
[1]. A. Kothapalli, B. Parno, Algebraic Reductions of Knowledge, Crypto 2023. eprint
[2]. M. Ambrona, D. Firsov, I. Querejeta-Azurmendi, Efficient Foreign-Field Arithmetic in PLONK, Cryptology ePrint Archive. eprint