Search International and National Patent Collections
Some content of this application is unavailable at the moment.
If this situation persists, please contact us atFeedback&Contact
1. (WO2019216949) SYBIL-RESISTANT IDENTITY GENERATION
Note: Text based on automatic Optical Character Recognition processes. Please use the PDF version for legal matters

WHAT IS CLAIMED IS:

1 . A method comprising:

performing, by a node in a plurality of nodes, an identity set generation process;

determining, by the node, a leader node;

diffusing, by the node, an identity set to the plurality of nodes; and determining, by the node, a majority set including identities occurring in at least one half of the identity sets, wherein the leader node diffuses the majority set of the leader node to the plurality of nodes.

2. The method of claim 1 , wherein determining the leader node further comprises:

determining, by the node, a smallest hash value of a plurality of hash values received from the plurality of nodes;

determining, by the node, an identity of the identity set associated with the smallest hash value; and

selecting, by the node, a second node associated with the smallest hash value to be the leader node.

3. The method of claim 2, wherein the node is the second node.

4. The method of claim 1 further comprising:

receiving, by the node, the majority set from the leader node; verifying, by the node, the majority set of the leader node; and updating, by the node, the identity set based on the majority set of the leader node.

5. The method of claim 1 , wherein verifying the majority set of the leader node further comprises:

determining, by the node, that the majority set includes identities occurring in at least one half of the identity sets.

6. The method of claim 1 , wherein performing the identity set generation process further comprises:

generating, by the node, a public key, a private key, and a random challenge string;

transmitting, by the node, the random challenge string to the plurality of nodes;

receiving, by the node, a plurality of random challenge strings from the plurality of nodes;

generating, by the node, a challenge set comprising the plurality of random challenge strings and the random challenge string;

determining, by the node, a nonce that solves a proof of work; transmitting, by the node, a tuple comprising the public key, the nonce, a hash value from the proof of work, and the challenge set to the plurality of nodes;

receiving, by the node, a plurality of tuples from the plurality of nodes; and verifying, by the node, the plurality of tuples, wherein if a tuple of the plurality of tuples is valid then storing a public key associated with the tuple in an identity set.

7. The method of claim 6, wherein the random challenge string comprises k bits, and wherein each node of the plurality of nodes generates a different random challenge string.

8. The method of claim 6, wherein inputs to the proof of work include the public key, the challenge set, and the nonce.

9. The method of claim 8, wherein determining the nonce that solves the proof of work further comprises:

determining, by the node, the hash value which is an output of the proof of work; and

determining, by the node, that the hash value is less than a predetermined difficulty parameter.

10. The method of claim 1 further comprising:

splitting, by the node, the identity set into buckets, wherein each bucket is processed in a round.

1 1 . A node comprising:

a processor;

a memory device; and

a computer-readable medium coupled to the processor, the computer-readable medium comprising code executable by the processor for implementing a method comprising:

performing, by a node in a plurality of nodes, an identity generation set process;

determining a leader node;

diffusing an identity set to the plurality of nodes; and

determining a majority set including identities occurring in at least one half of the identity sets, wherein the leader node diffuses the majority set of the leader node to the plurality of nodes.

12. The node of claim 1 1 , wherein determining the leader node further comprises:

determining a smallest hash value of a plurality of hash values received from the plurality of nodes;

determining an identity of the identity set associated with the smallest hash value; and

selecting a second node associated with the smallest hash value to be the leader node.

13. The node of claim 12, wherein the node is the second node.

14. The node of claim 1 1 , wherein the method further comprises:

receiving the majority set from the leader node;

verifying the majority set of the leader node; and

updating the identity set based on the majority set of the leader node.

15. The node of claim 11 , wherein verifying the majority set of the leader node further comprises:

determining that the majority set includes identities occurring in at least one half of the identity sets.

16. The node of claim 11 , wherein performing the identity set generation process further comprises:

generating a public key, a private key, and a random challenge string; transmitting the random challenge string to the plurality of nodes;

receiving, by the node, a plurality of random challenge strings from the plurality of nodes;

generating a challenge set comprising the plurality of random challenge strings and the random challenge string;

determining a nonce that solves a proof of work;

transmitting a tuple comprising the public key, the nonce, a hash value from the proof of work, and the challenge set to the plurality of nodes;

receiving a plurality of tuples from the plurality of nodes; and verifying the plurality of tuples, wherein if a tuple of the plurality of tuples is valid then storing a public key associate with the tuple in an identity set.

17. The node of claim 16, wherein the random challenge string comprises k bits, and wherein each node of the plurality of nodes generates a different random challenge string.

18. The node of claim 16, wherein inputs to the proof of work include the public key, the challenge set, and the nonce.

19. The node of claim 18, wherein determining the nonce that solves the proof of work further comprises:

determining the hash value which is an output of the proof of work; and

determining that the hash value is less than a predetermined difficulty parameter.

20. The node of claim 11 , wherein the method further comprises: splitting, by the node, the identity set into buckets, wherein each bucket is processed in a round.