Open Fiono11 opened 4 years ago
Yes, doing so is a straightforward sequential trusted setup. Each stage proves correctness using E::pairing(params.powers_of*_g[i],params.h) = E::pairing(params.powers_of*_g[i+1],E::G2Affine::prime_subgroup_generator())
etc, although Schnorr DLEQ proofs sound faster.
I'm sorry, I didn't understand. Can you explain in a simpler way, please?
Yes, one can essentially just modify the Powers of Tau setup to make this work.
Can you explain it, please?
Instead of a trusted dealer generating the UniversalParams, can they be generated in a distributed way?