Photo from academic.microsoft.com
Abstract We construct an algorithm that permits a large group of individuals to reach consensus on a random number, without having to rely on any third parties. The algorithm works… Click to show full abstract
Abstract We construct an algorithm that permits a large group of individuals to reach consensus on a random number, without having to rely on any third parties. The algorithm works with high probability if there are less than 50 of colluding parties in the group. We describe also some modifications and generalizations of the algorithm.
Keywords:
pseudo random;
number;
trustless pseudo;
random number;
number generation;
decentralized trustless
Journal Title: Journal of Mathematical Cryptology
Year Published: 2017
Link to full text (if available)
Share on Social Media: Sign Up to like & get
recommendations!
Journal Title: Journal of Mathematical Cryptology
Year Published: 2017
Link to full text (if available)
Share on Social Media: Sign Up to like & get
recommendations!