all InfoSec news
Security of Blockchains at Capacity. (arXiv:2303.09113v1 [cs.CR])
cs.CR updates on arXiv.org arxiv.org
Given a network of nodes with certain communication and computation
capacities, what is the maximum rate at which a blockchain can run securely? We
study this question for proof-of-work (PoW) and proof-of-stake (PoS) longest
chain protocols under a 'bounded bandwidth' model which captures queuing and
processing delays due to high block rate relative to capacity, bursty release
of adversarial blocks, and in PoS, spamming due to equivocations.
We demonstrate that security of both PoW and PoS longest chain, when
operating …
adversarial bandwidth block blockchain blockchains communication computation high network nodes pos pow protocols question rate relative release run security spamming study under what is work