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

作　　者：Zheyi WU Haolin LIU Lei WANG 

机构地区：[1]School of Electronic Information and Electrical Engineering,Shanghai Jiao Tong University,Shanghai 200240,China

出　　处：《Science China(Information Sciences)》2025年第2期265-280,共16页中国科学(信息科学)(英文版)

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

摘　　要：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.

关 键 词：timed commitment randomness beacon random number optimal communication complexity permissionless setting 

分 类 号：TP3[自动化与计算机技术—计算机科学与技术]