Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom

Can this scheme be made distributed? #6

Open
Fiono11 opened this issue Dec 6, 2019 · 4 comments
Open

Can this scheme be made distributed? #6

Fiono11 opened this issue Dec 6, 2019 · 4 comments

Comments

@Fiono11
Copy link

Fiono11 commented Dec 6, 2019

Instead of a trusted dealer generating the UniversalParams, can they be generated in a distributed way?
@burdges
Copy link
Contributor

burdges commented Dec 6, 2019

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.

@Fiono11
Copy link
Author

Fiono11 commented Dec 6, 2019

I'm sorry, I didn't understand. Can you explain in a simpler way, please?

@Pratyush
Copy link
Member

Pratyush commented Dec 6, 2019

Yes, one can essentially just modify the Powers of Tau setup to make this work.

@Fiono11
Copy link
Author

Fiono11 commented Dec 6, 2019

Can you explain it, please?

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Assignees
No one assigned
Labels
None yet
Projects
None yet
Milestone
No milestone
Development

No branches or pull requests
3 participants
@burdges @Pratyush @Fiono11