TBDD: A New Trust-based, DRL-driven Framework for Blockchain Sharding in IoT
- URL: http://arxiv.org/abs/2401.00632v1
- Date: Mon, 1 Jan 2024 01:57:28 GMT
- Title: TBDD: A New Trust-based, DRL-driven Framework for Blockchain Sharding in IoT
- Authors: Zixu Zhang, Guangsheng Yu, Caijun Sun, Xu Wang, Ying Wang, Ming Zhang, Wei Ni, Ren Ping Liu, Andrew Reeves, Nektarios Georgalas,
- Abstract summary: Integrating sharded blockchain with IoT presents a solution for trust issues and optimized data flow.
Deep Reinforcement Learning adeptly handles dynamic, complex systems and multi-dimensional optimization.
textscTbDd discerns node types and performs targeted resharding against potential threats.
- Score: 25.15169926146292
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: Integrating sharded blockchain with IoT presents a solution for trust issues and optimized data flow. Sharding boosts blockchain scalability by dividing its nodes into parallel shards, yet it's vulnerable to the $1\%$ attacks where dishonest nodes target a shard to corrupt the entire blockchain. Balancing security with scalability is pivotal for such systems. Deep Reinforcement Learning (DRL) adeptly handles dynamic, complex systems and multi-dimensional optimization. This paper introduces a Trust-based and DRL-driven (\textsc{TbDd}) framework, crafted to counter shard collusion risks and dynamically adjust node allocation, enhancing throughput while maintaining network security. With a comprehensive trust evaluation mechanism, \textsc{TbDd} discerns node types and performs targeted resharding against potential threats. The model maximizes tolerance for dishonest nodes, optimizes node movement frequency, ensures even node distribution in shards, and balances sharding risks. Rigorous evaluations prove \textsc{TbDd}'s superiority over conventional random-, community-, and trust-based sharding methods in shard risk equilibrium and reducing cross-shard transactions.
Related papers
- The Latency Price of Threshold Cryptosystem in Blockchains [52.359230560289745]
We study the interplay between threshold cryptography and a class of blockchains that use Byzantine-fault tolerant (BFT) consensus protocols.
Existing approaches for threshold cryptosystems introduce a latency overhead of at least one message delay for running the threshold cryptographic protocol.
We propose a mechanism to eliminate this overhead for blockchain-native threshold cryptosystems with tight thresholds.
arXiv Detail & Related papers (2024-07-16T20:53:04Z) - Optimal Sharding for Scalable Blockchains with Deconstructed SMR [6.432440366479941]
Arete is an optimally scalable blockchain sharding protocol designed to resolve a size-security dilemma.
The key idea of Arete is to improve the security resilience/threshold of shards by dividing the blockchain's State Machine Replication (SMR) process itself.
We implement Arete and evaluate it on a geo-distributed AWS environment, showing that Arete outperforms the state-of-the-art sharding protocol.
arXiv Detail & Related papers (2024-06-12T14:23:53Z) - Enhancing Trust and Privacy in Distributed Networks: A Comprehensive Survey on Blockchain-based Federated Learning [51.13534069758711]
Decentralized approaches like blockchain offer a compelling solution by implementing a consensus mechanism among multiple entities.
Federated Learning (FL) enables participants to collaboratively train models while safeguarding data privacy.
This paper investigates the synergy between blockchain's security features and FL's privacy-preserving model training capabilities.
arXiv Detail & Related papers (2024-03-28T07:08:26Z) - Graph Attention Network-based Block Propagation with Optimal AoI and Reputation in Web 3.0 [59.94605620983965]
We design a Graph Attention Network (GAT)-based reliable block propagation optimization framework for blockchain-enabled Web 3.0.
To achieve the reliability of block propagation, we introduce a reputation mechanism based on the subjective logic model.
Considering that the GAT possesses the excellent ability to process graph-structured data, we utilize the GAT with reinforcement learning to obtain the optimal block propagation trajectory.
arXiv Detail & Related papers (2024-03-20T01:58:38Z) - Kronos: A Secure and Generic Sharding Blockchain Consensus with Optimized Overhead [17.387814385763622]
Sharding enhances blockchain scalability by dividing the network into shards, each managing specific unspent transaction outputs or accounts.
Cross-shard transactions pose a critical challenge to the security and efficiency of sharding blockchains.
We present Kronos, a secure sharding blockchain consensus achieving optimized overhead.
arXiv Detail & Related papers (2024-03-06T12:26:04Z) - MRL-PoS: A Multi-agent Reinforcement Learning based Proof of Stake Consensus Algorithm for Blockchain [0.18641315013048293]
This paper introduces MRL-PoS, a Proof-of-Stake consensus algorithm based on multi-agent reinforcement learning.
It incorporates a system of rewards and penalties to eliminate malicious nodes and incentivize honest ones.
arXiv Detail & Related papers (2023-12-14T16:58:18Z) - Scalable and Adaptively Secure Any-Trust Distributed Key Generation and All-hands Checkpointing [3.1771413727096154]
We propose a practical DKG for DLog-based cryptosystems, which achieves (quasi-)linear and communication per-node cost with the help of a common coin.
Our protocol is secure against adaptive adversaries, which can corrupt less than half of all nodes.
We present a generic transformer that enables us to efficiently deploy a conventional distributed protocol like our DKG, even when the participants have different weights.
arXiv Detail & Related papers (2023-11-16T06:05:01Z) - RecAGT: Shard Testable Codes with Adaptive Group Testing for Malicious Nodes Identification in Sharding Permissioned Blockchain [8.178194928962311]
We propose RecAGT, a novel identification scheme aimed at reducing communication overhead and identifying potential malicious nodes.
First, shard testable codes are designed to encode the original data in case of a leak of confidential data.
Second, a new identity proof protocol is presented as evidence against malicious behavior.
Third, adaptive group testing is chosen to identify malicious nodes.
arXiv Detail & Related papers (2023-11-05T07:43:48Z) - Blockchain Assisted Decentralized Federated Learning (BLADE-FL):
Performance Analysis and Resource Allocation [119.19061102064497]
We propose a decentralized FL framework by integrating blockchain into FL, namely, blockchain assisted decentralized federated learning (BLADE-FL)
In a round of the proposed BLADE-FL, each client broadcasts its trained model to other clients, competes to generate a block based on the received models, and then aggregates the models from the generated block before its local training of the next round.
We explore the impact of lazy clients on the learning performance of BLADE-FL, and characterize the relationship among the optimal K, the learning parameters, and the proportion of lazy clients.
arXiv Detail & Related papers (2021-01-18T07:19:08Z) - Blockchain Assisted Decentralized Federated Learning (BLADE-FL) with
Lazy Clients [124.48732110742623]
We propose a novel framework by integrating blockchain into Federated Learning (FL)
BLADE-FL has a good performance in terms of privacy preservation, tamper resistance, and effective cooperation of learning.
It gives rise to a new problem of training deficiency, caused by lazy clients who plagiarize others' trained models and add artificial noises to conceal their cheating behaviors.
arXiv Detail & Related papers (2020-12-02T12:18:27Z) - Byzantine-resilient Decentralized Stochastic Gradient Descent [85.15773446094576]
We present an in-depth study towards the Byzantine resilience of decentralized learning systems.
We propose UBAR, a novel algorithm to enhance decentralized learning with Byzantine Fault Tolerance.
arXiv Detail & Related papers (2020-02-20T05:11:04Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.