serai/crypto/frost
Luke Parker eeca440fa7
Offer a multi-DLEq proof which simply merges challenges for n underlying proofs
This converts proofs from 2n elements to 1+n.

Moves FROST over to it. Additionally, for FROST's binomial nonces, provides
a single DLEq proof (2, not 1+2 elements) by proving the discrete log equality
of their aggregate (with an appropriate binding factor). This may be split back
up depending on later commentary...
2023-01-01 09:16:09 -05:00
..
src Offer a multi-DLEq proof which simply merges challenges for n underlying proofs 2023-01-01 09:16:09 -05:00
Cargo.toml Move verify_share to return batch-verifiable statements 2022-12-13 20:31:00 -05:00
LICENSE Rename sign folder to crypto 2022-05-03 00:46:50 -04:00
README.md Create a dedicated crate for the DKG (#141) 2022-10-29 03:54:42 -05:00

Modular FROST

A modular implementation of FROST for any curve with a ff/group API. Additionally, custom algorithms may be specified so any signature reducible to Schnorr-like may be used with FROST.

A Schnorr algorithm is provided, of the form (R, s) where s = r + cx, which allows specifying the challenge format. This is intended to easily allow integrating with existing systems.

This library offers ciphersuites compatible with the IETF draft. Currently, version 11 is supported.