Paper 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.

Note: Minor revisions.

Metadata
Available format(s)
PDF
Publication info
Published elsewhere. Minor revision. Journal of Mathematical Cryptology, Volume 11, Issue 1 (Mar 2017), pp.37-44
DOI
10.1515/jmc-2016-0019
Keywords
public randomnesscollusionalgorithm works w.h.p.
Contact author(s)
popov @ ime unicamp br
History
2017-03-19: last of 2 revisions
2016-03-01: received
See all versions
Short URL
https://ia.cr/2016/228
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2016/228,
      author = {Serguei Popov},
      title = {On a decentralized trustless pseudo-random number generation algorithm},
      howpublished = {Cryptology ePrint Archive, Paper 2016/228},
      year = {2016},
      doi = {10.1515/jmc-2016-0019},
      note = {\url{https://eprint.iacr.org/2016/228}},
      url = {https://eprint.iacr.org/2016/228}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.