Fast-to-finalize Nakamoto-like consensus

Shuyang Tang, Sherman S.M. Chow, Zhiqiang Liu, Joseph K. Liu

Research output: Chapter in Book/Report/Conference proceedingConference PaperResearch

Abstract

As the fundamental component of blockchains, proof-of-work (PoW) scheme has been widely leveraged to provide consensus for maintaining a distributed public ledger. However, the long confirmation time, and hence the slow finality rate, is far from satisfactory. Alternative paradigms with performance improvement emerge. Nevertheless, there are fewer attempts in modifying the PoW mechanism itself. We find that the slow finality rate in PoW is caused by using only one bit to measure the computational power, namely, whether the attained hash value is smaller than a given target. In this paper, we first propose Demo-of-Work (DoW), a generalized PoW which assigns the computational work with a score depending on the hash value. We also treat the bitcoin blockchain as a global “clock” to attain synchronization for ensuring that each participant takes part in DoW for roughly the same time interval for ensuring fairness. With these two tools, we construct an alternative blockchain called AB-chain which provides a significantly faster finality rate when compared with the existing PoW-based blockchains, without sacrificing communication complexity or fairness.

Original languageEnglish
Title of host publicationInformation Security and Privacy
Subtitle of host publication24th Australasian Conference, ACISP 2019 Christchurch, New Zealand, July 3–5, 2019 Proceedings
EditorsJulian Jang-Jaccard, Fuchun Guo
Place of PublicationCham Switzerland
PublisherSpringer
Pages271-288
Number of pages18
ISBN (Electronic)9783030215484
ISBN (Print)9783030215477
DOIs
Publication statusPublished - 2019
EventAustralasian Conference on Information Security and Privacy 2019 - Christchurch, New Zealand
Duration: 3 Jul 20195 Jul 2019
Conference number: 24th
https://acisp19.canterbury.ac.nz/

Publication series

NameLecture Notes in Computer Science
PublisherSpringer
Volume11547
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

ConferenceAustralasian Conference on Information Security and Privacy 2019
Abbreviated titleACISP 2019
CountryNew Zealand
CityChristchurch
Period3/07/195/07/19
Internet address

Keywords

  • Blockchain
  • Consensus
  • Cryptocurrency
  • Proof-of-work

Cite this

Tang, S., Chow, S. S. M., Liu, Z., & Liu, J. K. (2019). Fast-to-finalize Nakamoto-like consensus. In J. Jang-Jaccard, & F. Guo (Eds.), Information Security and Privacy: 24th Australasian Conference, ACISP 2019 Christchurch, New Zealand, July 3–5, 2019 Proceedings (pp. 271-288). (Lecture Notes in Computer Science ; Vol. 11547 ). Cham Switzerland: Springer. https://doi.org/10.1007/978-3-030-21548-4_15
Tang, Shuyang ; Chow, Sherman S.M. ; Liu, Zhiqiang ; Liu, Joseph K. / Fast-to-finalize Nakamoto-like consensus. Information Security and Privacy: 24th Australasian Conference, ACISP 2019 Christchurch, New Zealand, July 3–5, 2019 Proceedings. editor / Julian Jang-Jaccard ; Fuchun Guo. Cham Switzerland : Springer, 2019. pp. 271-288 (Lecture Notes in Computer Science ).
@inproceedings{f1a7fcae89c64a5db3e2d42f0e10a981,
title = "Fast-to-finalize Nakamoto-like consensus",
abstract = "As the fundamental component of blockchains, proof-of-work (PoW) scheme has been widely leveraged to provide consensus for maintaining a distributed public ledger. However, the long confirmation time, and hence the slow finality rate, is far from satisfactory. Alternative paradigms with performance improvement emerge. Nevertheless, there are fewer attempts in modifying the PoW mechanism itself. We find that the slow finality rate in PoW is caused by using only one bit to measure the computational power, namely, whether the attained hash value is smaller than a given target. In this paper, we first propose Demo-of-Work (DoW), a generalized PoW which assigns the computational work with a score depending on the hash value. We also treat the bitcoin blockchain as a global “clock” to attain synchronization for ensuring that each participant takes part in DoW for roughly the same time interval for ensuring fairness. With these two tools, we construct an alternative blockchain called AB-chain which provides a significantly faster finality rate when compared with the existing PoW-based blockchains, without sacrificing communication complexity or fairness.",
keywords = "Blockchain, Consensus, Cryptocurrency, Proof-of-work",
author = "Shuyang Tang and Chow, {Sherman S.M.} and Zhiqiang Liu and Liu, {Joseph K.}",
year = "2019",
doi = "10.1007/978-3-030-21548-4_15",
language = "English",
isbn = "9783030215477",
series = "Lecture Notes in Computer Science",
publisher = "Springer",
pages = "271--288",
editor = "Julian Jang-Jaccard and Fuchun Guo",
booktitle = "Information Security and Privacy",

}

Tang, S, Chow, SSM, Liu, Z & Liu, JK 2019, Fast-to-finalize Nakamoto-like consensus. in J Jang-Jaccard & F Guo (eds), Information Security and Privacy: 24th Australasian Conference, ACISP 2019 Christchurch, New Zealand, July 3–5, 2019 Proceedings. Lecture Notes in Computer Science , vol. 11547 , Springer, Cham Switzerland, pp. 271-288, Australasian Conference on Information Security and Privacy 2019, Christchurch, New Zealand, 3/07/19. https://doi.org/10.1007/978-3-030-21548-4_15

Fast-to-finalize Nakamoto-like consensus. / Tang, Shuyang; Chow, Sherman S.M.; Liu, Zhiqiang; Liu, Joseph K.

Information Security and Privacy: 24th Australasian Conference, ACISP 2019 Christchurch, New Zealand, July 3–5, 2019 Proceedings. ed. / Julian Jang-Jaccard; Fuchun Guo. Cham Switzerland : Springer, 2019. p. 271-288 (Lecture Notes in Computer Science ; Vol. 11547 ).

Research output: Chapter in Book/Report/Conference proceedingConference PaperResearch

TY - GEN

T1 - Fast-to-finalize Nakamoto-like consensus

AU - Tang, Shuyang

AU - Chow, Sherman S.M.

AU - Liu, Zhiqiang

AU - Liu, Joseph K.

PY - 2019

Y1 - 2019

N2 - As the fundamental component of blockchains, proof-of-work (PoW) scheme has been widely leveraged to provide consensus for maintaining a distributed public ledger. However, the long confirmation time, and hence the slow finality rate, is far from satisfactory. Alternative paradigms with performance improvement emerge. Nevertheless, there are fewer attempts in modifying the PoW mechanism itself. We find that the slow finality rate in PoW is caused by using only one bit to measure the computational power, namely, whether the attained hash value is smaller than a given target. In this paper, we first propose Demo-of-Work (DoW), a generalized PoW which assigns the computational work with a score depending on the hash value. We also treat the bitcoin blockchain as a global “clock” to attain synchronization for ensuring that each participant takes part in DoW for roughly the same time interval for ensuring fairness. With these two tools, we construct an alternative blockchain called AB-chain which provides a significantly faster finality rate when compared with the existing PoW-based blockchains, without sacrificing communication complexity or fairness.

AB - As the fundamental component of blockchains, proof-of-work (PoW) scheme has been widely leveraged to provide consensus for maintaining a distributed public ledger. However, the long confirmation time, and hence the slow finality rate, is far from satisfactory. Alternative paradigms with performance improvement emerge. Nevertheless, there are fewer attempts in modifying the PoW mechanism itself. We find that the slow finality rate in PoW is caused by using only one bit to measure the computational power, namely, whether the attained hash value is smaller than a given target. In this paper, we first propose Demo-of-Work (DoW), a generalized PoW which assigns the computational work with a score depending on the hash value. We also treat the bitcoin blockchain as a global “clock” to attain synchronization for ensuring that each participant takes part in DoW for roughly the same time interval for ensuring fairness. With these two tools, we construct an alternative blockchain called AB-chain which provides a significantly faster finality rate when compared with the existing PoW-based blockchains, without sacrificing communication complexity or fairness.

KW - Blockchain

KW - Consensus

KW - Cryptocurrency

KW - Proof-of-work

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

U2 - 10.1007/978-3-030-21548-4_15

DO - 10.1007/978-3-030-21548-4_15

M3 - Conference Paper

SN - 9783030215477

T3 - Lecture Notes in Computer Science

SP - 271

EP - 288

BT - Information Security and Privacy

A2 - Jang-Jaccard, Julian

A2 - Guo, Fuchun

PB - Springer

CY - Cham Switzerland

ER -

Tang S, Chow SSM, Liu Z, Liu JK. Fast-to-finalize Nakamoto-like consensus. In Jang-Jaccard J, Guo F, editors, Information Security and Privacy: 24th Australasian Conference, ACISP 2019 Christchurch, New Zealand, July 3–5, 2019 Proceedings. Cham Switzerland: Springer. 2019. p. 271-288. (Lecture Notes in Computer Science ). https://doi.org/10.1007/978-3-030-21548-4_15