基于RANDAO的随机数生成:以太坊2.0随机性中的最后揭示者攻击及潜在解决方案
RANDAO-based RNG: Last Revealer Attacks in Ethereum 2.0 Randomness and a Potential Solution
AI总结:
本研究针对以太坊2.0中RANDAO随机数生成方案的最后揭示者攻击,提出基于Shamir秘密共享的改进方案,在有利网络条件下可有效防止该攻击,保障随机性。
摘要:
以太坊2.0是一项重大升级,旨在提升其可扩展性、吞吐量和安全性。在此版本中,RANDAO是用于随机选择提议区块、确认区块并获得奖励的用户的方案。然而,一种被称为“最后揭示者攻击”(LRA)的漏洞通过向随机数生成器(RNG)过程引入偏差,破坏了该方案的随机性。本研究首先再次阐明了这一漏洞。之后,我们提出了一种基于Shamir秘密共享(SSS)的RANDAO方案以缓解LRA。通过我们的分析,所提出的方法在有利的网络条件下能够防止LRA。
英文摘要:
Ethereum 2.0 is a major upgrade to improve its scalability, throughput, and security. In this version, RANDAO is the scheme to randomly select the users who propose, confirm blocks, and get rewards. However, a vulnerability, referred to as the `Last Revealer Attack' (LRA), compromises the randomness of this scheme by introducing bias to the Random Number Generator (RNG) process. This vulnerability is first clarified again in this study. After that, we propose a Shamir's Secret Sharing (SSS)-based RANDAO scheme to mitigate the LRA. Through our analysis, the proposed method can prevent the LRA under favorable network conditions.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。