Cryptology ePrint Archive: Report 2016/228

On a decentralized trustless pseudo-random number generation algorithm

Serguei Popov

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.

Category / Keywords: public randomness, collusion, algorithm works w.h.p.

Original Publication (with minor differences): Journal of Mathematical Cryptology, Volume 11, Issue 1 (Mar 2017), pp.37-44

Date: received 1 Mar 2016, last revised 19 Mar 2017

Contact author: popov at ime unicamp br

Available format(s): PDF | BibTeX Citation

Note: Minor revisions.

Version: 20170319:124641 (All versions of this report)

Short URL:

Discussion forum: Show discussion | Start new discussion

[ Cryptology ePrint archive ]