TY - GEN
T1 - BanFEL
T2 - 3rd IEEE Conference on Dependable and Secure Computing, DSC 2019
AU - Li, Jiasheng
AU - Zhang, Zijian
AU - Li, Meng
N1 - Publisher Copyright:
© 2019 IEEE.
PY - 2019/11
Y1 - 2019/11
N2 - Lottery is a game with many people's dreams. But corruptions of lottery centers make the lottery unfair. To address this unfair issue, fair lottery schemes have been studied for several years. In these schemes, delay functions or aggregation protocols can be used to generate the winning numbers fairly. However, to the best of our knowledge, none of the existing schemes can achieve the winning number generated randomly, while the randomness can be verified fairly. In this article, we first propose a [B]lockchain based sm[a]rt co[n]tract for [F]air and [E]fficient [L]ottery (BanFEL) scheme. We further present a winning number random generation smart contract, by which players submit the purchased numbers and the non-tampering property is protected. Security analysis and experiments show that the fairness of BanFEL is protected better than the existing works. Meanwhile, the verification cost of this scheme are at least 0.03s lower than the traditional Grumbach's scheme between 1000 and 10000 players.
AB - Lottery is a game with many people's dreams. But corruptions of lottery centers make the lottery unfair. To address this unfair issue, fair lottery schemes have been studied for several years. In these schemes, delay functions or aggregation protocols can be used to generate the winning numbers fairly. However, to the best of our knowledge, none of the existing schemes can achieve the winning number generated randomly, while the randomness can be verified fairly. In this article, we first propose a [B]lockchain based sm[a]rt co[n]tract for [F]air and [E]fficient [L]ottery (BanFEL) scheme. We further present a winning number random generation smart contract, by which players submit the purchased numbers and the non-tampering property is protected. Security analysis and experiments show that the fairness of BanFEL is protected better than the existing works. Meanwhile, the verification cost of this scheme are at least 0.03s lower than the traditional Grumbach's scheme between 1000 and 10000 players.
KW - blockchain
KW - fair lotteries
KW - publicly verifiable lotteries
UR - https://www.scopus.com/pages/publications/85078021956
U2 - 10.1109/DSC47296.2019.8937559
DO - 10.1109/DSC47296.2019.8937559
M3 - Conference contribution
AN - SCOPUS:85078021956
T3 - 2019 IEEE Conference on Dependable and Secure Computing, DSC 2019 - Proceedings
BT - 2019 IEEE Conference on Dependable and Secure Computing, DSC 2019 - Proceedings
PB - Institute of Electrical and Electronics Engineers Inc.
Y2 - 18 November 2019 through 20 November 2019
ER -