PltcRB:a practical distributed randomness beacon with optimal amortized communication complexity

作     者：Zheyi WU Haolin LIU Lei WANG 

作者机构：School of Electronic Information and Electrical Engineering Shanghai Jiao Tong University 

出 版 物：《Science China(Information Sciences)》 (中国科学:信息科学(英文版))

年 卷 期：2025年第68卷第2期

页      面：269-284页

核心收录：

学科分类：12[管理学] 1201[管理学-管理科学与工程(可授管理学、工学学位)] 0839[工学-网络空间安全] 08[工学] 081201[工学-计算机系统结构] 0812[工学-计算机科学与技术（可授工学、理学学位）] 

基　　金：supported by National Key Research and Development of China (Grant No.2019YFB2101600) 

主　　题：timed commitment randomness beacon random number optimal communication complexity permissionlessłinebreak setting 

摘      要：The distributed randomness beacon(DRB) is a crucial tool for continuously generating unpredictable, bias-resistant,and publicly verifiable random numbers on a regular basis. This is particularly useful for applications such as lotteries, electronic voting, and cryptographic parameter generation. However, existing studies either require complex communication or rely on a public bulletin board to meet security requirements. This brings a performance bottleneck when dealing with a large number of participants. This paper introduces a novel DRB protocol PltcRB based on timed commitments, eliminating the need for a public bulletin board. Our approach achieves optimal communication complexity of O(n) while maintaining the desired properties of a DRB protocol. The computation complexity is also O(n) when n is larger than the security parameter κ. These results demonstrate the practicality and performance of PltcRB, supported by our experimental analysis under various configurations.