Fortuna: A Game-theoretic Protocol to Generate Secret Randomness on the Blockchain

In this work, we consider the problem of decentralized generation of secret random numbers. This is similar to classical random number generation (RNG) on the blockchain, except that the final result should only be known to a particular client. More formally a client, Cassie, requests a secret random number r, kickstarting a decentralized RNG in which anyone on the network can contribute to the creation of r. As in traditional RNG, r should be unpredictable and tamper-proof. However, unlike traditional RNG, r is not publicized and in the end only Cassie will know its value. Additionally, if/when she chooses, Cassie can reveal r and provide a proof that it was indeed produced by our protocol.One of the main applications of secret RNG is to provide efficient and verifiable randomness for online gambling. If Cassie operates a casino, she can request a single secret number each day and use it as a seed for a pseudo-random number generator that determines all betting outcomes. At the end of the day, she can prove that this seed was generated through a decentralized and tamper-proof process, demonstrating that the results were fair and not manipulated.Both RNG and secret RNG have been widely studied in the literature. Existing protocols often allow anyone on the network to contribute an input and then aggregate all inputs together, e.g. using xor, to generate r. This ensures that as long as at least one participant is honest and samples their share from the uniform distribution, r is also uniformly-distributed. While having at least one honest participant has now become a standard assumption in this area, there are no game-theoretic incentives for honesty. In all previous secret RNG protocols, a participant can simply contribute a default value, such as zero, as their input and still receive the same rewards as an honest participant who submits uniform random shares.In this work, we integrate a game-theoretic reward framework into our secret RNG protocol, ensuring that the only equilibrium of the game is when all participants submit uniformly random shares. Thus, honesty is not just assumed but also incentivized.

Institutions

Publication Details

Published
2025-06-02
DOI
https://doi.org/10.1109/icbc64466.2025.11114573
Primary Topic
Ocular Diseases and Behçet’s Syndrome
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Fortuna: A Game-theoretic Protocol to Generate Secret Randomness on the Blockchain

Ocular Diseases and Behçet’s Syndrome
article

Fortuna: A Game-theoretic Protocol to Generate Secret Randomness on the Blockchain

article en

Abstract

In this work, we consider the problem of decentralized generation of secret random numbers. This is similar to classical random number generation (RNG) on the blockchain, except that the final result should only be known to a particular client. More formally a client, Cassie, requests a secret random number r, kickstarting a decentralized RNG in which anyone on the network can contribute to the creation of r. As in traditional RNG, r should be unpredictable and tamper-proof. However, unlike traditional RNG, r is not publicized and in the end only Cassie will know its value. Additionally, if/when she chooses, Cassie can reveal r and provide a proof that it was indeed produced by our protocol.One of the main applications of secret RNG is to provide efficient and verifiable randomness for online gambling. If Cassie operates a casino, she can request a single secret number each day and use it as a seed for a pseudo-random number generator that determines all betting outcomes. At the end of the day, she can prove that this seed was generated through a decentralized and tamper-proof process, demonstrating that the results were fair and not manipulated.Both RNG and secret RNG have been widely studied in the literature. Existing protocols often allow anyone on the network to contribute an input and then aggregate all inputs together, e.g. using xor, to generate r. This ensures that as long as at least one participant is honest and samples their share from the uniform distribution, r is also uniformly-distributed. While having at least one honest participant has now become a standard assumption in this area, there are no game-theoretic incentives for honesty. In all previous secret RNG protocols, a participant can simply contribute a default value, such as zero, as their input and still receive the same rewards as an honest participant who submits uniform random shares.In this work, we integrate a game-theoretic reward framework into our secret RNG protocol, ensuring that the only equilibrium of the game is when all participants submit uniformly random shares. Thus, honesty is not just assumed but also incentivized.

University of Oxford (GB), Technical University of Munich (DE)
Openalex Percentile: Top 37%
Ocular Diseases and Behçet’s Syndrome
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Fortuna: A Game-theoretic Protocol to Generate Secret Randomness on the Blockchain · (2025) | TGRS Research Map | TGRS