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
..
tests	DKG Blame (#196)	2023-01-01 01:54:18 -05:00
encryption.rs	DKG Blame (#196)	2023-01-01 01:54:18 -05:00
frost.rs	Offer a multi-DLEq proof which simply merges challenges for n underlying proofs	2023-01-01 09:16:09 -05:00
lib.rs	DKG Blame (#196)	2023-01-01 01:54:18 -05:00
promote.rs	DKG Blame (#196)	2023-01-01 01:54:18 -05:00