Scalable Network-Coded PBFT Consensus Algorithm

Beongjun Choi; Jy Yong Sohn; Dong Jun Han; Jaekyun Moon

doi:10.1109/ISIT.2019.8849573

Scalable Network-Coded PBFT Consensus Algorithm

Beongjun Choi, Jy Yong Sohn, Dong Jun Han, Jaekyun Moon

Department of Applied Statistics

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

19 Citations (Scopus)

Abstract

We suggest a general framework for network-coded Practical Byzantine Fault Tolerant (PBFT) consensus for enabling agreement among distributed nodes under Byzantine attacks. The suggested protocol generalizes existing replication and sharding schemes which are frequently used for consensus in current blockchain systems. Using the proposed algorithm, it is possible to reach a consensus when the available bandwidth is considerably smaller on individual links compared to that required for conventional schemes. It is shown that there exists an upper bound on the number of nodes that can participate in the protocol, given a maximum bandwidth constraint across all pairwise links. Furthermore, the protocol that achieves the upper bound is provided by using a set of constant weight codes.

Original language	English
Title of host publication	2019 IEEE International Symposium on Information Theory, ISIT 2019 - Proceedings
Publisher	Institute of Electrical and Electronics Engineers Inc.
Pages	857-861
Number of pages	5
ISBN (Electronic)	9781538692912
DOIs	https://doi.org/10.1109/ISIT.2019.8849573
Publication status	Published - 2019 Jul
Event	2019 IEEE International Symposium on Information Theory, ISIT 2019 - Paris, France Duration: 2019 Jul 7 → 2019 Jul 12

Publication series

Name	IEEE International Symposium on Information Theory - Proceedings
Volume	2019-July
ISSN (Print)	2157-8095

Conference

Conference	2019 IEEE International Symposium on Information Theory, ISIT 2019
Country/Territory	France
City	Paris
Period	19/7/7 → 19/7/12

Bibliographical note

Publisher Copyright:
© 2019 IEEE.

All Science Journal Classification (ASJC) codes

Theoretical Computer Science
Information Systems
Modelling and Simulation
Applied Mathematics

Access to Document

10.1109/ISIT.2019.8849573

Cite this

Choi, B., Sohn, J. Y., Han, D. J., & Moon, J. (2019). Scalable Network-Coded PBFT Consensus Algorithm. In 2019 IEEE International Symposium on Information Theory, ISIT 2019 - Proceedings (pp. 857-861). Article 8849573 (IEEE International Symposium on Information Theory - Proceedings; Vol. 2019-July). Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/ISIT.2019.8849573

@inproceedings{e48385aad7c2408bad5d94f222203dad,

title = "Scalable Network-Coded PBFT Consensus Algorithm",

abstract = "We suggest a general framework for network-coded Practical Byzantine Fault Tolerant (PBFT) consensus for enabling agreement among distributed nodes under Byzantine attacks. The suggested protocol generalizes existing replication and sharding schemes which are frequently used for consensus in current blockchain systems. Using the proposed algorithm, it is possible to reach a consensus when the available bandwidth is considerably smaller on individual links compared to that required for conventional schemes. It is shown that there exists an upper bound on the number of nodes that can participate in the protocol, given a maximum bandwidth constraint across all pairwise links. Furthermore, the protocol that achieves the upper bound is provided by using a set of constant weight codes.",

author = "Beongjun Choi and Sohn, {Jy Yong} and Han, {Dong Jun} and Jaekyun Moon",

note = "Publisher Copyright: {\textcopyright} 2019 IEEE.; 2019 IEEE International Symposium on Information Theory, ISIT 2019 ; Conference date: 07-07-2019 Through 12-07-2019",

year = "2019",

month = jul,

doi = "10.1109/ISIT.2019.8849573",

language = "English",

series = "IEEE International Symposium on Information Theory - Proceedings",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

pages = "857--861",

booktitle = "2019 IEEE International Symposium on Information Theory, ISIT 2019 - Proceedings",

address = "United States",

}

Choi, B, Sohn, JY, Han, DJ & Moon, J 2019, Scalable Network-Coded PBFT Consensus Algorithm. in 2019 IEEE International Symposium on Information Theory, ISIT 2019 - Proceedings., 8849573, IEEE International Symposium on Information Theory - Proceedings, vol. 2019-July, Institute of Electrical and Electronics Engineers Inc., pp. 857-861, 2019 IEEE International Symposium on Information Theory, ISIT 2019, Paris, France, 19/7/7. https://doi.org/10.1109/ISIT.2019.8849573

Scalable Network-Coded PBFT Consensus Algorithm. / Choi, Beongjun; Sohn, Jy Yong; Han, Dong Jun et al.
2019 IEEE International Symposium on Information Theory, ISIT 2019 - Proceedings. Institute of Electrical and Electronics Engineers Inc., 2019. p. 857-861 8849573 (IEEE International Symposium on Information Theory - Proceedings; Vol. 2019-July).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

TY - GEN

T1 - Scalable Network-Coded PBFT Consensus Algorithm

AU - Choi, Beongjun

AU - Sohn, Jy Yong

AU - Han, Dong Jun

AU - Moon, Jaekyun

PY - 2019/7

Y1 - 2019/7

N2 - We suggest a general framework for network-coded Practical Byzantine Fault Tolerant (PBFT) consensus for enabling agreement among distributed nodes under Byzantine attacks. The suggested protocol generalizes existing replication and sharding schemes which are frequently used for consensus in current blockchain systems. Using the proposed algorithm, it is possible to reach a consensus when the available bandwidth is considerably smaller on individual links compared to that required for conventional schemes. It is shown that there exists an upper bound on the number of nodes that can participate in the protocol, given a maximum bandwidth constraint across all pairwise links. Furthermore, the protocol that achieves the upper bound is provided by using a set of constant weight codes.

AB - We suggest a general framework for network-coded Practical Byzantine Fault Tolerant (PBFT) consensus for enabling agreement among distributed nodes under Byzantine attacks. The suggested protocol generalizes existing replication and sharding schemes which are frequently used for consensus in current blockchain systems. Using the proposed algorithm, it is possible to reach a consensus when the available bandwidth is considerably smaller on individual links compared to that required for conventional schemes. It is shown that there exists an upper bound on the number of nodes that can participate in the protocol, given a maximum bandwidth constraint across all pairwise links. Furthermore, the protocol that achieves the upper bound is provided by using a set of constant weight codes.

UR - http://www.scopus.com/inward/record.url?scp=85073166221&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85073166221&partnerID=8YFLogxK

U2 - 10.1109/ISIT.2019.8849573

DO - 10.1109/ISIT.2019.8849573

M3 - Conference contribution

AN - SCOPUS:85073166221

T3 - IEEE International Symposium on Information Theory - Proceedings

SP - 857

EP - 861

BT - 2019 IEEE International Symposium on Information Theory, ISIT 2019 - Proceedings

PB - Institute of Electrical and Electronics Engineers Inc.

T2 - 2019 IEEE International Symposium on Information Theory, ISIT 2019

Y2 - 7 July 2019 through 12 July 2019

ER -

Scalable Network-Coded PBFT Consensus Algorithm

Abstract

Publication series

Conference

Bibliographical note

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this