EUVIMEDEUVIMED entdecken
Open Access · CC BY 4.0

Sharding-Based Proof-of-Stake Blockchain Protocols: Key Components & Probabilistic Security Analysis

Abdelatif Hafid iD, Abdelhakim Senhaji Hafid, Dimitrios Makrakis

Sensors · 04.03.2023 · 23 (5) · 2819

DOI: 10.3390/s23052819 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Sensors, online erschienen am 04.03.2023. Verfasst von Abdelatif Hafid und 2 weiteren Autor:innen. Beteiligte Einrichtung: Department of Computer Science and Operations Research, Université de Montréal, Montreal, QC H3T 1J4, Canada. Die Arbeit wurde bisher 17-mal zitiert (Crossref) und nennt 24 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0).

AbstractSchlagwörterBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Blockchain technology has been gaining great interest from a variety of sectors including healthcare, supply chain, and cryptocurrencies. However, Blockchain suffers from a limited ability to scale (i.e., low throughput and high latency). Several solutions have been proposed to tackle this. In particular, sharding has proved to be one of the most promising solutions to Blockchain’s scalability issue. Sharding can be divided into two major categories: (1) Sharding-based Proof-of-Work (PoW) Blockchain protocols, and (2) Sharding-based Proof-of-Stake (PoS) Blockchain protocols. The two categories achieve good performances (i.e., good throughput with a reasonable latency), but raise security issues. This article focuses on the second category. In this paper, we start by introducing the key components of sharding-based PoS Blockchain protocols. We then briefly introduce two consensus mechanisms, namely PoS and practical Byzantine Fault Tolerance (pBFT), and discuss their use and limitations in the context of sharding-based Blockchain protocols. Next, we provide a probabilistic model to analyze the security of these protocols. More specifically, we compute the probability of committing a faulty block and measure the security by computing the number of years to fail. We achieve a number of years to fail of approximately 4000 in a network of 4000 nodes, 10 shards, and a shard resiliency of 33%.

Schlagwörter

Stichwörter der Autor:innen

blockchainmalicious nodespractical Byzantine fault toleranceprobabilistic analysisproof of stakesecurity analysissharding-based blockchain protocols

Autor:innen und Institutionen

  • Department of Computer Science and Operations Research, Université de Montréal, Montreal, QC H3T 1J4, Canada.
  • School of Electrical Engineering and Computer Science, University of Ottawa, Ottawa, ON K1N 6N5, Canada.

ORCID-Profile: Abdelatif Hafid

Zitieren

APA

Hafid, A., Hafid, A. S., & Makrakis, D. (2023). Sharding-Based Proof-of-Stake Blockchain Protocols: Key Components & Probabilistic Security Analysis. Sensors, 23(5), 2819. https://doi.org/10.3390/s23052819

Vancouver

Hafid A, Hafid AS, Makrakis D. Sharding-Based Proof-of-Stake Blockchain Protocols: Key Components & Probabilistic Security Analysis. Sensors. 2023;23(5):2819. doi:10.3390/s23052819

BibTeX
@article{Hafid2023,
  author = {Hafid, Abdelatif and Hafid, Abdelhakim Senhaji and Makrakis, Dimitrios},
  title = {Sharding-Based Proof-of-Stake Blockchain Protocols: Key Components & Probabilistic Security Analysis},
  journal = {Sensors},
  year = {2023},
  volume = {23},
  number = {5},
  pages = {2819},
  doi = {10.3390/s23052819}
}
Kostenlos starten →