Reducing forks in the blockchain via probabilistic verification

Bing Liu; Yang Qin; Xiaowen Chu

doi:10.1109/ICDEW.2019.00-42

Reducing forks in the blockchain via probabilistic verification

Bing Liu
, Yang Qin
, Xiaowen Chu

Department of Computer Science

Research output: Chapter in book/report/conference proceeding › Conference proceeding › peer-review

23 Citations (Scopus)

Abstract

Blockchain is a disruptive technique that finds many applications in FinTech, IoT, and token economy. Because of the asynchrony of network, the competition of mining, and the nondeterministic block propagation delay, forks in the blockchain occur frequently which not only waste a lot of computing resources but also result in potential security issues. This paper introduces PvScheme, a probabilistic verification scheme that can effectively reduce the block propagation delay and hence reduce the occurrence of blockchain forks. We further enhance the security of PvScheme to provide reliable block delivery. We also analyze the resistance of PvScheme to fake blocks and double spending attacks. The results of several comparative experiments show that our scheme can indeed reduce forks and improve the blockchain performance.

Original language	English
Title of host publication	Proceedings - 2019 IEEE 35th International Conference on Data Engineering Workshops, ICDEW 2019
Publisher	IEEE
Pages	13-18
Number of pages	6
ISBN (Electronic)	9781728108902
DOIs	https://doi.org/10.1109/ICDEW.2019.00-42
Publication status	Published - Apr 2019
Event	35th IEEE International Conference on Data Engineering Workshops, ICDEW 2019 - Macau, China Duration: 8 Apr 2019 → 12 Apr 2019

Publication series

Name	Proceedings - 2019 IEEE 35th International Conference on Data Engineering Workshops, ICDEW 2019

Conference

Conference	35th IEEE International Conference on Data Engineering Workshops, ICDEW 2019
Country/Territory	China
City	Macau
Period	8/04/19 → 12/04/19

UN SDGs

This output contributes to the following UN Sustainable Development Goals (SDGs)

SDG 8 Decent Work and Economic Growth

User-Defined Keywords

Blockchain
Fork
Performance
Security

Access to Document

10.1109/ICDEW.2019.00-42

Cite this

Liu, B., Qin, Y., & Chu, X. (2019). Reducing forks in the blockchain via probabilistic verification. In Proceedings - 2019 IEEE 35th International Conference on Data Engineering Workshops, ICDEW 2019 (pp. 13-18). Article 8750946 (Proceedings - 2019 IEEE 35th International Conference on Data Engineering Workshops, ICDEW 2019). IEEE. https://doi.org/10.1109/ICDEW.2019.00-42

@inproceedings{7e6fd184af194347a0729baff199bafb,

title = "Reducing forks in the blockchain via probabilistic verification",

abstract = "Blockchain is a disruptive technique that finds many applications in FinTech, IoT, and token economy. Because of the asynchrony of network, the competition of mining, and the nondeterministic block propagation delay, forks in the blockchain occur frequently which not only waste a lot of computing resources but also result in potential security issues. This paper introduces PvScheme, a probabilistic verification scheme that can effectively reduce the block propagation delay and hence reduce the occurrence of blockchain forks. We further enhance the security of PvScheme to provide reliable block delivery. We also analyze the resistance of PvScheme to fake blocks and double spending attacks. The results of several comparative experiments show that our scheme can indeed reduce forks and improve the blockchain performance.",

keywords = "Blockchain, Fork, Performance, Security",

author = "Bing Liu and Yang Qin and Xiaowen Chu",

note = "Funding Information: ACKNOWLEDGMENT This work was supported by the Science and Technology Fundament Research Fund of Shenzhen under grant JCYJ20160318095218091, JCYJ20170307151807788.; 35th IEEE International Conference on Data Engineering Workshops, ICDEW 2019 ; Conference date: 08-04-2019 Through 12-04-2019",

year = "2019",

month = apr,

doi = "10.1109/ICDEW.2019.00-42",

language = "English",

series = "Proceedings - 2019 IEEE 35th International Conference on Data Engineering Workshops, ICDEW 2019",

publisher = "IEEE",

pages = "13--18",

booktitle = "Proceedings - 2019 IEEE 35th International Conference on Data Engineering Workshops, ICDEW 2019",

address = "United States",

}

Liu, B, Qin, Y & Chu, X 2019, Reducing forks in the blockchain via probabilistic verification. in Proceedings - 2019 IEEE 35th International Conference on Data Engineering Workshops, ICDEW 2019., 8750946, Proceedings - 2019 IEEE 35th International Conference on Data Engineering Workshops, ICDEW 2019, IEEE, pp. 13-18, 35th IEEE International Conference on Data Engineering Workshops, ICDEW 2019, Macau, China, 8/04/19. https://doi.org/10.1109/ICDEW.2019.00-42

Reducing forks in the blockchain via probabilistic verification. / Liu, Bing; Qin, Yang; Chu, Xiaowen.
Proceedings - 2019 IEEE 35th International Conference on Data Engineering Workshops, ICDEW 2019. IEEE, 2019. p. 13-18 8750946 (Proceedings - 2019 IEEE 35th International Conference on Data Engineering Workshops, ICDEW 2019).

Research output: Chapter in book/report/conference proceeding › Conference proceeding › peer-review

TY - GEN

T1 - Reducing forks in the blockchain via probabilistic verification

AU - Liu, Bing

AU - Qin, Yang

AU - Chu, Xiaowen

N1 - Funding Information: ACKNOWLEDGMENT This work was supported by the Science and Technology Fundament Research Fund of Shenzhen under grant JCYJ20160318095218091, JCYJ20170307151807788.

PY - 2019/4

Y1 - 2019/4

N2 - Blockchain is a disruptive technique that finds many applications in FinTech, IoT, and token economy. Because of the asynchrony of network, the competition of mining, and the nondeterministic block propagation delay, forks in the blockchain occur frequently which not only waste a lot of computing resources but also result in potential security issues. This paper introduces PvScheme, a probabilistic verification scheme that can effectively reduce the block propagation delay and hence reduce the occurrence of blockchain forks. We further enhance the security of PvScheme to provide reliable block delivery. We also analyze the resistance of PvScheme to fake blocks and double spending attacks. The results of several comparative experiments show that our scheme can indeed reduce forks and improve the blockchain performance.

AB - Blockchain is a disruptive technique that finds many applications in FinTech, IoT, and token economy. Because of the asynchrony of network, the competition of mining, and the nondeterministic block propagation delay, forks in the blockchain occur frequently which not only waste a lot of computing resources but also result in potential security issues. This paper introduces PvScheme, a probabilistic verification scheme that can effectively reduce the block propagation delay and hence reduce the occurrence of blockchain forks. We further enhance the security of PvScheme to provide reliable block delivery. We also analyze the resistance of PvScheme to fake blocks and double spending attacks. The results of several comparative experiments show that our scheme can indeed reduce forks and improve the blockchain performance.

KW - Blockchain

KW - Fork

KW - Performance

KW - Security

UR - https://www.scopus.com/pages/publications/85069158847

U2 - 10.1109/ICDEW.2019.00-42

DO - 10.1109/ICDEW.2019.00-42

M3 - Conference proceeding

AN - SCOPUS:85069158847

T3 - Proceedings - 2019 IEEE 35th International Conference on Data Engineering Workshops, ICDEW 2019

SP - 13

EP - 18

BT - Proceedings - 2019 IEEE 35th International Conference on Data Engineering Workshops, ICDEW 2019

PB - IEEE

T2 - 35th IEEE International Conference on Data Engineering Workshops, ICDEW 2019

Y2 - 8 April 2019 through 12 April 2019

ER -

Reducing forks in the blockchain via probabilistic verification

Abstract

Publication series

Conference

UN SDGs

User-Defined Keywords

Access to Document

Other files and links

Fingerprint

Cite this