R AND C HAIN : A Scalable and Fair Decentralised Randomness Beacon
R AND C HAIN : A Scalable and Fair Decentralised Randomness Beacon
复制标题
DOI：
--
复制
发表时间：
2021
期刊：
影响因子：
--
通讯作者：
Runchao Han;Haoyu Lin;Jiangshan Yu
中科院分区：
文献类型：
--
作者：
Runchao Han;Haoyu Lin;Jiangshan Yu
- 我们提出了R AND C海恩，一种分散的随机性信标（DRB），它是第一个实现可扩展性（即，大量参与者可以加入）和公平性（即，每个参与者在决定随机输出时控制可比较的功率）。与现有的DRB不同，其中参与者是协作的，即，将它们的局部熵聚集到单个输出中，R AND C海恩中的参与者是竞争性的，即，相互竞争以产生下一个输出。竞争性的设计减少了至少O（n2）到O（n）的通信复杂度没有可信方，打破了现有的DRB的可扩展性限制。为了构建R AND C海恩，我们引入了顺序工作量证明（SeqPoW），这是一个加密难题，需要随机和不可预测的顺序步骤来解决。我们实现了R AND C海恩，并在多达1024个节点上评估了其性能，与最先进的DRB RandHerd（S& P '18）和HydRand（S& P' 20）相比，证明了其优越性（每个节点200 KB/s的恒定带宽下每个输出1.3秒）。
—We propose R AND C HAIN , a Decentralised Random-ness Beacon (DRB) that is the first to achieve both scalability (i.e., a large number of participants can join) and fairness (i.e., each participant controls comparable power on deciding random outputs). Unlike existing DRBs where participants are collaborative , i.e., aggregating their local entropy into a single output, participants in R AND C HAIN are competitive , i.e., competing with each other to generate the next output. The competitive design reduces the communication complexity from at least O ( n 2 ) to O ( n ) without trusted party, breaking the scalability limit in existing DRBs. To build R AND C HAIN , we introduce Sequential Proof-of-Work (SeqPoW) , a cryptographic puzzle that takes a random and unpredictable number of sequential steps to solve. We implement R AND C HAIN and evaluate its performance on up to 1024 nodes, demonstrating its superiority (1.3 seconds per output with a constant bandwidth of 200KB/s per node) compared to state-of-the-art DRBs RandHerd (S&P’18) and HydRand (S&P’20).