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.

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

obfuscated committee election #51

Open
arcolife opened this issue Jul 21, 2018 · 1 comment
Open

obfuscated committee election #51

arcolife opened this issue Jul 21, 2018 · 1 comment
Assignees
Labels
A-level non trivial issues with high difficulty or repo maintainers bug Something isn't working question Further information is requested R-level Research group leads
Milestone

Comments

@arcolife
Copy link
Collaborator

arcolife commented Jul 21, 2018

WIP

todo: update from internal

cc/ @hzh1982 let's hold another meeting with you, @panghalamit and Elon (add his github?) asap, then I'll update it here after common agreement.

@arcolife arcolife added the R-level Research group leads label Jul 21, 2018
@arcolife arcolife added this to the Alpha 2 milestone Jul 21, 2018
@arcolife arcolife added bug Something isn't working question Further information is requested A-level non trivial issues with high difficulty or repo maintainers labels Jul 21, 2018
@panghalamit
Copy link

panghalamit commented Aug 3, 2018

Requirements of selection procedure.

  1. Next committee should be selected before its daily operation begin.

  2. Every committee member should know about other committee member and Non-members should not know about the committee members until its operations begin.

  3. Selection procedure must be resistant to sybil attacks.

  4. 3 could be achieved by using PoW puzzles. 2 is only possible, if in an ideal scenario, all members are able to secretly determine their membership and verify membership of other members without conveying it to non members.
    This could be partially achieved by VRFs. VRFs can enable "secretly determine their membership" and "verify membership". Since anyone with the public key of prover can verify their membership, non-members can also determine who committee members are. So one way to achieve obfuscation is prover multicasts the information only to verifiers which is not possible as they dont know committee members.
    Way around is to possibly send it to have a rendevouz. Where every committee member sends its information. and then it send to other members. Rendevouz could be previous committee.
    Fruit miners determine their eligibility and send it to rendevouz with VRF proof.
    Let me know of all the questions related to its implementation and security holes that come to mind.

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
A-level non trivial issues with high difficulty or repo maintainers bug Something isn't working question Further information is requested R-level Research group leads
Projects
None yet
Development

No branches or pull requests

3 participants