PoSAT: Proof-of-Work Availability andUnpredictability, without the Work
PoSAT: Proof-of-Work Availability andUnpredictability, without the Work
复制标题
PoSAT:工作量证明的可用性和不可预测性,无需工作
DOI:
10.1007/978-3-662-64331-0_6
复制
发表时间:
2020
期刊:
影响因子:
--
通讯作者:
David Tse
中科院分区:
文献类型:
--
作者:
Soubhik Deb;Sreeram Kannan;David Tse
An important feature of Proof-of-Work (PoW) blockchains is full dynamic availability, allowing miners to go online and offline while requiring only 50% of the online miners to be honest.
Existing Proof-of-stake (PoS), Proof-of-Space and related protocols are able to achieve this property only partially, either putting the additional assumption that adversary nodes to be online from the beginning and no new adversary nodes come online afterwards, or use additional trust assumptions for newly joining nodes.We propose a new PoS protocol PoSAT which can provably achieve dynamic availability fully without any additional assumptions. The protocol is based on the longest chain and uses a Verifiable Delay Function for the block proposal lottery to provide an arrow of time. The security analysis of the protocol draws on the recently proposed technique of Nakamoto blocks as well as the theory of branching random walks. An additional feature of PoSAT is the complete unpredictability of who will get to propose a block next, even by the winner itself. This unpredictability is at the same level of PoW protocols, and is stronger than that of existing PoS protocols using Verifiable Random Functions.
DOI:
10.1145/3372297.3417290
发表时间:
2020
期刊:
CCS '20: Proceedings of the 2020 ACM SIGSAC Conference on Computer and Communications Security
影响因子:
--
作者:
Dembo, Amir;Kannan, Sreeram;Tas, Ertem Nusret;Tse, David;Viswanath, Pramod;Wang, Xuechao;Zeitouni, Ofer
通讯作者:
Zeitouni, Ofer
DOI:
10.1007/978-3-030-64375-1_12
发表时间:
2020
期刊:
Theory of Cryptography (TCC 2020
影响因子:
--
作者:
Fitzi, Matthias;Gazi, Peter;Kiayias, Aggelos;Russell, Alexander
通讯作者:
Russell, Alexander