Loading...

Improving the Scalability of Blockchain Systems

Azimi, Navid | 2022

115 Viewed
  1. Type of Document: M.Sc. Thesis
  2. Language: Farsi
  3. Document No: 55735 (05)
  4. University: Sharif University of Technology
  5. Department: Electrical Engineering
  6. Advisor(s): Eghlidos, Taraneh; Mohajeri, Javad
  7. Abstract:
  8. Blockchain systems are considered a subclass of distributed systems and have drawn a lot of attention from academia in recent years. The deployment of these systems in various contexts has been the focus of extensive studies. Because of their design, which places a strong focus on security and decentralization, blockchain systems have some challenges. The most prominent challenge is the one that involves scalability. A blockchain's scalability refers to its capacity to achieve a target throughput and solid performance in confirming transactions with an ever-increasing workload or number of nodes in the network. A solid performance suggests that the blockchain system can sustain its efficiency at a reasonable level without compromising other important features, such as security and decentralization, which are considered its inherent characteristics. This thesis compares various approaches that have been suggested to improve the scalability of blockchain systems in different layers. By taking into account the first layer approaches' focus on designing a network, data structure, or a new consensus protocol with inherently high performance and low latency, we will demonstrate that proposing a scheme in the first layer is an appropriate method to make the blockchain systems scalable. The overall architecture of the proposed scheme is based on the Bitcoin-NG protocol. We attempted to improve the network performance by decoupling the leader nodes selection mechanism from transaction processing. Additionally, to address the bootstrapping problem and prevent eclipse attacks, our proposed scheme will make use of salted distributed hash tables. The primary blocks broadcast of the proposed method requires O(n) messages, similar to bitcoin, and the transaction blocks broadcast have a complexity of O(n√n), where n is the number of network nodes. Furthermore, by using Nakamoto's longest chain, our scheme can withstand a byzantine attacker who has less than 50% of the network's total processing power, providing the utmost level of security. Moreover, the proposed scheme can be used in applications that have limited hardware resources or bandwidth, like the Internet of Things devices
  9. Keywords:
  10. Blockchain ; Scalability ; Consensus ; Bitcoin ; Distributed Hash Table

 Digital Object List

 Bookmark

No TOC