A verifiable random function (VRF in short) is a powerful pseudo-random function that provides a non-interactively public verifiable proof for the correctness of its output. Recently, VRFs have found essential applications in blockchain design, such as random beacons and proof-of-stake consensus protocols. To our knowledge, the first generation of blockchain systems used inherently inefficient proof-of-work consensuses, and the research community tried to achieve the same properties by proposing proof-of-stake schemes where resource-intensive proof-of-work is emulated by cryptographic constructions. Unfortunately, those most discussed proof-of-stake consensuses (e.g., Algorand and Ouroborous family) are not future-proof because the building blocks are secure only under the classical hard assumptions; in particular, their designs ignore the advent of quantum computing and its implications. In this paper, we propose a generic compiler to obtain the post-quantum VRF from the simple VRF solution using symmetric-key primitives (e.g., non-interactive zero-knowledge system) with an intrinsic property of quantum-secure. Our novel solution is realized via two efficient zero-knowledge systems ZKBoo and ZKB++, respectively, to validate the compiler correctness. Our proof-of-concept implementation indicates that even today, the overheads introduced by our solution are acceptable in real-world deployments. We also demonstrate potential applications of a quantum-secure VRF, such as quantum-secure decentralized random beacon and lottery-based proof of stake consensus blockchain protocol.
翻译:可核实随机函数(简称 VRF ) 是一种强大的伪随机功能,它提供了一种非互动的、公开的、可核实的证据证明产出的正确性。 最近, VRF 在块链设计中找到了必要的应用, 如随机信标和获取共识的证明协议。 据我们所知, 第一代块链系统使用了内在效率低下的工作证明共识, 研究界试图通过提出一种随机的验收计划来实现同样的特性, 即资源密集的工作证明由加密结构所效仿。 不幸的是, 那些讨论最多的证据获取共识( 例如, Algorand 和 Oweborosous Family) 并不能够防止未来的应用, 因为这些构件只是在传统的硬假设下才安全; 特别是, 它们的设计忽略了量计算及其影响。 在本文中, 我们提议了一个通用的编译器, 以便从简单的 VRFRF 解决方案( 例如, 非互动的零知识应用系统) 中获取资源密集度的证明 。