A System for Scalable Decentralized Random Number Generation

Thanh Nguyen-Van, TienTrien Le, Tuan Nguyen-Anh, Minh-Phuoc Nguyen-Ho, Tuong Nguyen-Van, Minh-Quoc Le-Tran, Quang Nhat Le, Harry Pham, Khuong Nguyen-An
{"title":"A System for Scalable Decentralized Random Number Generation","authors":"Thanh Nguyen-Van, TienTrien Le, Tuan Nguyen-Anh, Minh-Phuoc Nguyen-Ho, Tuong Nguyen-Van, Minh-Quoc Le-Tran, Quang Nhat Le, Harry Pham, Khuong Nguyen-An","doi":"10.1109/EDOCW.2019.00028","DOIUrl":null,"url":null,"abstract":"Generating public randomness has been significantly demanding and also challenging, especially after the introduction of the Blockchain Technology. Lotteries, smart contracts, and random audits are examples where the reliability of the randomness source is a vital factor. We demonstrate a system of random number generation service for generating fair, tamper-resistant, and verifiable random numbers. Our protocol together with this system is an R&D project aiming at providing a decentralized solution to random number generation by leveraging the blockchain technology along with long-lasting cryptographic primitives including homomorphic encryption, verifiable random functions. The system decentralizes the process of generating random numbers by combining each party's favored value to obtain the final random numbers. Our novel idea is to force each party to encrypt his contribution before making it public. With the help of homomorphic encryption, all encrypted contribution can be combined without performing any decryption. The solution has achieved the properties of unpredictability, tamper-resistance, and public-verifiability. In addition, it only offers a linear overall complexity with respect to the number of parties on the network, which permits great scalability.","PeriodicalId":246655,"journal":{"name":"2019 IEEE 23rd International Enterprise Distributed Object Computing Workshop (EDOCW)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 IEEE 23rd International Enterprise Distributed Object Computing Workshop (EDOCW)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/EDOCW.2019.00028","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 5

Abstract

Generating public randomness has been significantly demanding and also challenging, especially after the introduction of the Blockchain Technology. Lotteries, smart contracts, and random audits are examples where the reliability of the randomness source is a vital factor. We demonstrate a system of random number generation service for generating fair, tamper-resistant, and verifiable random numbers. Our protocol together with this system is an R&D project aiming at providing a decentralized solution to random number generation by leveraging the blockchain technology along with long-lasting cryptographic primitives including homomorphic encryption, verifiable random functions. The system decentralizes the process of generating random numbers by combining each party's favored value to obtain the final random numbers. Our novel idea is to force each party to encrypt his contribution before making it public. With the help of homomorphic encryption, all encrypted contribution can be combined without performing any decryption. The solution has achieved the properties of unpredictability, tamper-resistance, and public-verifiability. In addition, it only offers a linear overall complexity with respect to the number of parties on the network, which permits great scalability.
一种可扩展分散随机数生成系统
产生公共随机性是非常苛刻和具有挑战性的,特别是在引入区块链技术之后。彩票、智能合约和随机审计都是随机性来源的可靠性至关重要的例子。我们演示了一个随机数生成服务系统,用于生成公平、防篡改和可验证的随机数。我们的协议和该系统是一个研发项目,旨在通过利用区块链技术以及包括同态加密、可验证随机函数在内的持久加密原语,为随机数生成提供分散的解决方案。该系统将生成随机数的过程去中心化,将各方喜欢的值组合起来,得到最终的随机数。我们的新想法是迫使每一方在公开之前对其贡献进行加密。借助同态加密,可以在不执行任何解密的情况下组合所有加密的贡献。该解决方案具有不可预测性、防篡改性和可公开验证性。此外,它只提供相对于网络上各方数量的线性总体复杂性,这允许很大的可扩展性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信