Abstract | ||
---|---|---|
Randomness beacons are services that periodically emit a random number, allowing users to agree on the same random outcome without trusting anyone: ideally, the randomness beacon is secure (cannot be influenced) and transparent (can be monitored by users). Hence, such randomness beacons can serve as an important primitive for smart contracts in a variety of contexts. In this paper we aim to bridge the gap between theory and practice of public beacon design inspired by the unicorn protocol of Lenstra and Wesolowski using verifiable delay functions. We first present a structured security analysis, based on which we design, implement, and evaluate a trustworthy and efficient randomness beacon allowing users to join at any time. We then compare different implementation and deployment options on distributed ledgers, and report on a Ethereum smart contract-based lottery using our beacon. |
Year | DOI | Venue |
---|---|---|
2019 | 10.1109/Blockchain.2019.00022 | 2019 IEEE International Conference on Blockchain (Blockchain) |
Keywords | Field | DocType |
Random beacon, transparency, smart contract | Beacon,Software deployment,Computer security,Computer science,Lottery,Security analysis,Verifiable secret sharing,Smart contract,Scalability,Randomness | Conference |
ISBN | Citations | PageRank |
978-1-7281-4694-2 | 0 | 0.34 |
References | Authors | |
0 | 7 |
Name | Order | Citations | PageRank |
---|---|---|---|
Samvid Dharanikot | 1 | 0 | 0.34 |
Michael Toft Jensen | 2 | 0 | 0.34 |
Sebastian Rom Kristensen | 3 | 0 | 0.34 |
Mathias Sass Michno | 4 | 0 | 0.34 |
Yvonne Anne Pignolet | 5 | 118 | 21.26 |
René R. Hansen | 6 | 19 | 3.55 |
Stefan Schmid | 7 | 559 | 71.98 |