Sok: Distributed randomness beacons
发表信息
作者
- Kevin Choi
- Aathira Manoj
- Joseph Bonneau
笔记
Motivated and inspired by the emergence of blockchains, many new protocols have recently been proposed for generating publicly verifiable randomness in a distributed yet secure fashion. These protocols work under different setups and assumptions, use various cryptographic tools, and entail unique trade-offs and characteristics. In this paper, we systematize the design of distributed randomness beacons (DRBs) as well as the cryptographic building blocks they rely on. We evaluate protocols on two key security properties, unbiasability and unpredictability, and discuss common attack vectors for predicting or biasing the beacon output and the countermeasures employed by protocols. We also compare protocols by communication and computational efficiency. Finally, we provide insights on the applicability of different protocols in various deployment scenarios and highlight possible directions for further research.
在区块链的推动和启发下，近期出现了许多新的协议，用于以分布式且安全的方式生成可公开验证的随机性。这些协议在不同的设置和假设条件下运行，使用各种密码学工具，并具有独特的权衡和特征。本文系统地总结了分布式随机信标(Distributed Randomness Beacons, DRBs)的设计以及它们所依赖的密码学基础构件。
我们从两个关键安全属性——不可偏差性(unbiasability)和不可预测性(unpredictability)——对这些协议进行评估，并讨论了预测或偏置信标输出的常见攻击向量，以及协议采用的相应对策。我们还从通信和计算效率的角度对协议进行了比较。
最后，我们就不同协议在各种部署场景中的适用性提供了见解，并指出了未来研究的可能方向。