Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userFedChain: Secure Proof-of-Stake-based Framework for Federated-blockchain Systems
135
0
0.0
(
0
)
Added by
Cong Nguyen
Publication date
2021
fields
Informatics Engineering
and research's language is
English
Ask ChatGPT about the research
No Arabic abstract
In this paper, we propose FedChain, a novel framework for federated-blockchain systems, to enable effective transferring of tokens between different blockchain networks. Particularly, we first introduce a federated-blockchain system together with a cross-chain transfer protocol to facilitate the secure and decentralized transfer of tokens between chains. We then develop a novel PoS-based consensus mechanism for FedChain, which can satisfy strict security requirements, prevent various blockchain-specific attacks, and achieve a more desirable performance compared to those of other existing consensus mechanisms. Moreover, a Stackelberg game model is developed to examine and address the problem of centralization in the FedChain system. Furthermore, the game model can enhance the security and performance of FedChain. By analyzing interactions between the stakeholders and chain operators, we can prove the uniqueness of the Stackelberg equilibrium and find the exact formula for this equilibrium. These results are especially important for the stakeholders to determine their best investment strategies and for the chain operators to design the optimal policy to maximize their benefits and security protection for FedChain. Simulations results then clearly show that the FedChain framework can help stakeholders to maximize their profits and the chain operators to design appropriate parameters to enhance FedChains security and performance.
rate research
Read More
In the fifth-generation (5G) networks and the beyond, communication latency and network bandwidth will be no more bottleneck to mobile users. Thus, almost every mobile device can participate in the distributed learning. That is, the availability issue of distributed learning can be eliminated. However, the model safety will become a challenge. This is because the distributed learning system is prone to suffering from byzantine attacks during the stages of updating model parameters and aggregating gradients amongst multiple learning participants. Therefore, to provide the byzantine-resilience for distributed learning in 5G era, this article proposes a secure computing framework based on the sharding-technique of blockchain, namely PIRATE. A case-study shows how the proposed PIRATE contributes to the distributed learning. Finally, we also envision some open issues and challenges based on the proposed byzantine-resilient learning framework.
The future of healthcare systems is being shaped by incorporating emerged technological innovations to drive new models for patient care. By acquiring, integrating, analyzing, and exchanging medical data at different system levels, new practices can be introduced, offering a radical improvement to healthcare services. This paper presents a novel smart and secure Healthcare system (ssHealth), which, leveraging advances in edge computing and blockchain technologies, permits epidemics discovering, remote monitoring, and fast emergency response. The proposed system also allows for secure medical data exchange among local healthcare entities, thus realizing the integration of multiple national and international entities and enabling the correlation of critical medical events for, e.g., emerging epidemics management and control. In particular, we develop a blockchain-based architecture and enable a flexible configuration thereof, which optimize medical data sharing between different health entities and fulfil the diverse levels of Quality of Service (QoS) that ssHealth may require. Finally, we highlight the benefits of the proposed ssHealth system and possible directions for future research.
Mining in the blockchain requires high computing power to solve the hash puzzle for example proof-of-work puzzle. It takes high cost to achieve the calculation of this problem in devices of IOT, especially the mobile devices of IOT. It consequently restricts the application of blockchain in mobile environment. However, edge computing can be utilized to solve the problem for insufficient computing power of mobile devices in IOT. Edge servers can recruit many mobile devices to contribute computing power together to mining and share the reward of mining with these recruited mobile devices. In this paper, we propose an incentivizing mechanism based on edge computing for mobile blockchain. We design a two-stage Stackelberg Game to jointly optimize the reward of edge servers and recruited mobile devices. The edge server as the leader sets the expected fee for the recruited mobile devices in Stage I. The mobile device as a follower provides its computing power to mine according to the expected fee in Stage. It proves that this game can obtain a uniqueness Nash Equilibrium solution under the same or different expected fee. In the simulation experiment, we obtain a result curve of the profit for the edge server with the different ratio between the computing power from the edge server and mobile devices. In addition, the proposed scheme has been compared with the MDG scheme for the profit of the edge server. The experimental results show that the profit of the proposed scheme is more than that of the MDG scheme under the same total computing power.
The operation of future intelligent transportation systems (ITSs), communications infrastructure (CI), and power grids (PGs) will be highly interdependent. In particular, autonomous connected vehicles require CI resources to operate, and, thus, communication failures can result in non-optimality in the ITS flow in terms of traffic jams and fuel consumption. Similarly, CI components, e.g., base stations (BSs) can be impacted by failures in the electric grid that is powering them. Thus, malicious attacks on the PG can lead to failures in both the CI and the ITSs. To this end, in this paper, the security of an ITS against indirect attacks carried out through the PG is studied in an interdependent PG-CI-ITS scenario. To defend against such attacks, the administrator of the interdependent critical infrastructure can allocate backup power sources (BPSs) at every BS to compensate for the power loss caused by the attacker. However, due to budget limitations, the administrator must consider the importance of each BS in light of the PG risk of failure, while allocating the BPSs. In this regard, a rigorous analytical framework is proposed to model the interdependencies between the ITS, CI, and PG. Next, a one-to-one relationship between the PG components and ITS streets is derived in order to capture the effect of the PG components failure on the optimality of the traffic flow in the streets. Moreover, the problem of BPS allocation is formulated using a Stackelberg game framework and the Stackelberg equilibrium (SE) of the game is characterized. Simulation results show that the derived SE outperforms any other BPS allocation strategy and can be scalable in linear time with respect to the size of the interdependent infrastructure.
Device failure detection is one of most essential problems in industrial internet of things (IIoT). However, in conventional IIoT device failure detection, client devices need to upload raw data to the central server for model training, which might lead to disclosure of sensitive business data. Therefore, in this paper, to ensure client data privacy, we propose a blockchain-based federated learning approach for device failure detection in IIoT. First, we present a platform architecture of blockchain-based federated learning systems for failure detection in IIoT, which enables verifiable integrity of client data. In the architecture, each client periodically creates a Merkle tree in which each leaf node represents a client data record, and stores the tree root on a blockchain. Further, to address the data heterogeneity issue in IIoT failure detection, we propose a novel centroid distance weighted federated averaging (CDW_FedAvg) algorithm taking into account the distance between positive class and negative class of each client dataset. In addition, to motivate clients to participate in federated learning, a smart contact based incentive mechanism is designed depending on the size and the centroid distance of client data used in local model training. A prototype of the proposed architecture is implemented with our industry partner, and evaluated in terms of feasibility, accuracy and performance. The results show that the approach is feasible, and has satisfactory accuracy and performance.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
