论文标题
QuickSync:快速同步的基于POS的区块链协议
QuickSync: A Quickly Synchronizing PoS-Based Blockchain Protocol
论文作者
论文摘要
要实现区块链,我们需要一个区块链协议才能遵循所有节点。要设计一个区块链协议,我们需要一个块出版商选择机制和链选择规则。在基于验证证明(POS)的区块链协议中,Block Publisher Selection机制选择了基于节点持有的相对利益来发布下一个块的节点。但是,POS协议(例如Ouroboros V1)可能会面临完全自适应腐败的脆弱性。 在本文中,我们提出了一种新型的基于POS的区块链协议QuickSync,以在改善性能的同时实现完全自适应腐败的安全性。我们提出了一个称为块功率的度量,这是一个为每个块定义的值,它根据块出版商的数字签名从可验证的随机函数的输出得出。通过此指标,我们计算链动力,包括所有有效链的所有块的块功率之和。这些指标是Block Publisher股权的函数,以实现协议的POS方面。链选择规则以最高链功率选择链条作为扩展。因此,该链选择规则确定了上一个块的选定块发布者。当我们使用指标定义链选择规则时,可能会导致针对Sybil攻击的脆弱性。 QuickSync使用使用直方图匹配实现的SYBIL攻击功能。我们证明QuickSync满足了常见的前缀,链的增长和链质量的特性,因此是安全的。我们还表明,它对不同类型的对抗攻击策略具有弹性。我们的分析表明,QuickSync的性能比比特币要比比特币更好的数量级在每秒和时间的交易中的数量级,并且比Ouroboros V1更好,比Ouroboros V1的时间更好。
To implement a blockchain, we need a blockchain protocol for all the nodes to follow. To design a blockchain protocol, we need a block publisher selection mechanism and a chain selection rule. In Proof-of-Stake (PoS) based blockchain protocols, block publisher selection mechanism selects the node to publish the next block based on the relative stake held by the node. However, PoS protocols, such as Ouroboros v1, may face vulnerability to fully adaptive corruptions. In this paper, we propose a novel PoS-based blockchain protocol, QuickSync, to achieve security against fully adaptive corruptions while improving on performance. We propose a metric called block power, a value defined for each block, derived from the output of the verifiable random function based on the digital signature of the block publisher. With this metric, we compute chain power, the sum of block powers of all the blocks comprising the chain, for all the valid chains. These metrics are a function of the block publisher's stake to enable the PoS aspect of the protocol. The chain selection rule selects the chain with the highest chain power as the one to extend. This chain selection rule hence determines the selected block publisher of the previous block. When we use metrics to define the chain selection rule, it may lead to vulnerabilities against Sybil attacks. QuickSync uses a Sybil attack resistant function implemented using histogram matching. We prove that QuickSync satisfies common prefix, chain growth, and chain quality properties and hence it is secure. We also show that it is resilient to different types of adversarial attack strategies. Our analysis demonstrates that QuickSync performs better than Bitcoin by an order of magnitude on both transactions per second and time to finality, and better than Ouroboros v1 by a factor of three on time to finality.