TY - GEN
T1 - Breaking Blockchain's Communication Barrier with Coded Computation
AU - Wang, Canran
AU - Raviv, Netanel
N1 - Publisher Copyright:
© 2022 IEEE.
PY - 2022/1/1
Y1 - 2022/1/1
N2 - Although blockchain, the supporting technology of various cryptocurrencies, has offered a potentially effective framework for numerous decentralized trust management systems, its performance is still sub-optimal in real-world networks. With limited bandwidth, the communication complexity for nodes to process a block scales with the growing network size and hence becomes the limiting factor of blockchain's performance.In this paper, we suggest a re-design of existing blockchain systems, which addresses the issue of the communication burden. First, by employing techniques from Coded Computation, our scheme guarantees correct verification of transactions while reducing the communication complexity dramatically such that it grows logarithmically with network size. Second, by adopting techniques from Information Dispersal and State Machine Replication, our design is provably resilient to Byzantine faults under standard cryptographic assumptions.1
AB - Although blockchain, the supporting technology of various cryptocurrencies, has offered a potentially effective framework for numerous decentralized trust management systems, its performance is still sub-optimal in real-world networks. With limited bandwidth, the communication complexity for nodes to process a block scales with the growing network size and hence becomes the limiting factor of blockchain's performance.In this paper, we suggest a re-design of existing blockchain systems, which addresses the issue of the communication burden. First, by employing techniques from Coded Computation, our scheme guarantees correct verification of transactions while reducing the communication complexity dramatically such that it grows logarithmically with network size. Second, by adopting techniques from Information Dispersal and State Machine Replication, our design is provably resilient to Byzantine faults under standard cryptographic assumptions.1
UR - http://www.scopus.com/inward/record.url?scp=85136487489&partnerID=8YFLogxK
U2 - 10.1109/ITW54588.2022.9965835
DO - 10.1109/ITW54588.2022.9965835
M3 - Conference contribution
AN - SCOPUS:85136487489
T3 - 2022 IEEE Information Theory Workshop, ITW 2022
SP - 744
EP - 749
BT - 2022 IEEE Information Theory Workshop, ITW 2022
PB - Institute of Electrical and Electronics Engineers
T2 - 2022 IEEE Information Theory Workshop, ITW 2022
Y2 - 1 November 2022 through 9 November 2022
ER -