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
..
ciphersuite	Have transcripted versions specify their minor version pre-1.0	2022-12-27 00:49:31 -05:00
dalek-ff-group	Add a dedicated crate for testing ff/group implementors	2022-12-24 15:09:09 -05:00
dkg	Offer a multi-DLEq proof which simply merges challenges for n underlying proofs	2023-01-01 09:16:09 -05:00
dleq	Offer a multi-DLEq proof which simply merges challenges for n underlying proofs	2023-01-01 09:16:09 -05:00
ed448	Add test vectors for Ciphersuite::hash_to_F	2022-12-25 02:50:10 -05:00
ff-group-tests	Run latest nightly clippy	2023-01-01 04:18:23 -05:00
frost	Offer a multi-DLEq proof which simply merges challenges for n underlying proofs	2023-01-01 09:16:09 -05:00
multiexp	Restore type complexity checks in CI	2022-12-01 17:50:52 -05:00
schnorr	Move verify_share to return batch-verifiable statements	2022-12-13 20:31:00 -05:00
transcript	DKG Blame (#196)	2023-01-01 01:54:18 -05:00