all InfoSec news
A Game-theoretic Approach for Provably-Uniform Random Number Generation in Decentralized Networks. (arXiv:2309.11250v1 [cs.CR])
cs.CR updates on arXiv.org arxiv.org
Many protocols in distributed computing rely on a source of randomness,
usually called a random beacon, both for their applicability and security. This
is especially true for proof-of-stake blockchain protocols in which the next
miner or set of miners have to be chosen randomly and each party's likelihood
to be selected is in proportion to their stake in the cryptocurrency.
Current random beacons used in proof-of-stake protocols, such as Ouroboros
and Algorand, have two fundamental limitations: Either (i)~they rely on …
beacon blockchain called computing decentralized distributed distributed computing game miner miners networks party proof protocols random randomness security stake