On a decentralized trustless pseudo-random number generation algorithm
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 gener...
Main Author: | Popov Serguei |
---|---|
Format: | Article |
Language: | English |
Published: |
De Gruyter
2017-03-01
|
Series: | Journal of Mathematical Cryptology |
Subjects: | |
Online Access: | https://doi.org/10.1515/jmc-2016-0019 |
Similar Items
-
Globally convergent three-term conjugate gradient projection methods for solving nonlinear monotone equations
by: Mompati S. Koorapetse, et al.
Published: (2018-05-01) -
A three-term Polak-Ribière-Polyak derivative-free method and its application to image restoration
by: Abdulkarim Hassan Ibrahim, et al.
Published: (2021-09-01) -
A Dai–Liao conjugate gradient method via modified secant equation for system of nonlinear equations
by: M. Y. Waziri, et al.
Published: (2019-07-01) -
Quadratic convergence of monotone iterates for semilinear elliptic obstacle problems
by: Jinping Zeng, et al.
Published: (2017-09-01) -
Strong convergence inertial projection algorithm with self-adaptive step size rule for pseudomonotone variational inequalities in Hilbert spaces
by: Wairojjana Nopparat, et al.
Published: (2021-05-01)