Struct bls_amcl::multi_sig_slow::MultiSignature

pub struct MultiSignature {}

Methods

impl MultiSignature

pub fn from_sigs<'a, T, I>(sigs_and_ver_keys: T) -> Signature where
    T: IntoIterator<Item = &'a I>,
    T::IntoIter: Clone,
    I: AsRef<VerKey> + AsRef<Signature> + 'a, 

The aggregator needs to know of all the signer before it can generate the aggregate signature. Takes individual signatures from each of the signers and their verkey and aggregates the signatures. For each signature s_i from signer with verkey v_i calculate a_i = hashed_verkey_for_aggregation(vk_i, [vk_1, vk_2,...vk_n]) a_si = s_i * a_i Add all a_si. An alternate construction is (as described in the paper) to let signer compute s_i * a_i and the aggregator simply adds each signer's output. In that model, signer does more work but in the implemented model, aggregator does more work and the same signer implementation can be used by signers of "slow" and "fast" implementation.

pub fn verify<'a, T, K>(
    sig: &Signature,
    msg: &[u8],
    ver_keys: T,
    params: &Params
) -> bool where
    T: IntoIterator<Item = &'a K>,
    T::IntoIter: Clone,
    K: AsRef<VerKey> + 'a, 

An aggregate VerKey is created from ver_keys. When verifying signature using the same set of keys frequently generate a verkey once and then use Signature::verify