Rational Protocols and Attacks in Blockchain System

Li, Tao; Chen, Yuling; Wang, Yanli; Wang, Yilei; Zhao, Minghao; Zhu, Haojia; Tian, Youliang; Yu, Xiaomei; Yang, Yixian

doi:10.1155/2020/8839047

Cited by 69 publications

(53 citation statements)

References 39 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Game theory is generally utilized to analyze the attacks in blockchain system since the latter highly correlates economic scenarios. [18][19][20] Eyal elaborately discusses a more complex scenario, where two pools attack each other by sponsoring BWA. 21 The Nash equilibrium (NE) is mutual BWA for each pool.…”

Section: Related Workmentioning

confidence: 99%

Semi‐selfish mining based on hidden Markov decision process

Wang

Yang

et al. 2021

Int J Intell Syst

Self Cite

View full text Add to dashboard Cite

Selfish mining attacks sabotage the blockchain systems by utilizing the vulnerabilities of consensus mechanism. The attackers' main target is to obtain higher revenues compared with honest parties. More specifically, the essence of selfish mining is to waste the power of honest parties by generating a private chain. However, these attacks are not practical due to high forking rate. The honest parties may quit the blockchain system once they detect the abnormal forking rate, which impairs their revenues. While selfish mining attacks make no sense anymore with the honest parties' departure. Therefore, selfish miners need to restrain when launch selfish mining attacks such that the forking rate is not preposterously higher than normal level. The crux is how to illustrate the attacks toward the view of honest parties, who are blind to the private chain. Generally, previous works, especially those using Markov decision processes, stress on the increment of attackers' revenues, while overlooking the detection on forking rate. In this paper, we propose, to maintain the benefit from selfish mining, an improved selfish mining based on hidden Markov decision processes (SMHMDP). To reduce the forking rate, we also relax the behaviors of selfish miners (also known as semi-selfish miners), who mine on the private chain, to mine on public chain with a small

show abstract

Section: Related Workmentioning

confidence: 99%

Semi‐selfish mining based on hidden Markov decision process

Wang

Yang

et al. 2021

Int J Intell Syst

Self Cite

View full text Add to dashboard Cite

show abstract

“…These studies considered geographically distributed cloud data centers and applied workload migration techniques to minimize the energy of running tasks inside the system. Dynamic application partitioning with failure and resource constraint-enabled schemes were suggested in these studies [21][22][23][24][25][26][27]. The studies considered fine-grained and coarse-grained healthcare workloads in their models.…”

Section: Security Schemes In Application Partitioningmentioning

confidence: 99%

“…To the best of our knowledge, dynamic application partitioning and task scheduling of biosensor healthcare workflow in secure mobile edge clouds has not been studied yet. Closely related studies [1,3,5,9,[21][22][23][24][25][26][27] have focused on dynamic application partitioning and minimizing the energy use of mobile devices. These studies only considered bandwidth and resource constraints.…”

Section: Security Schemes In Application Partitioningmentioning

confidence: 99%

Dynamic Application Partitioning and Task-Scheduling Secure Schemes for Biosensor Healthcare Workload in Mobile Edge Cloud

Lakhan

Grønli

et al. 2021

Electronics

View full text Add to dashboard Cite

Currently, the use of biosensor-enabled mobile healthcare workflow applications in mobile edge-cloud-enabled systems is increasing progressively. These applications are heavyweight and divided between a thin client mobile device and a thick server edge cloud for execution. Application partitioning is a mechanism in which applications are divided based on resource and energy parameters. However, existing application-partitioning schemes widely ignore security aspects for healthcare applications. This study devises a dynamic application-partitioning workload task-scheduling-secure (DAPWTS) algorithm framework that consists of different schemes, such as min-cut algorithm, searching node, energy-enabled scheduling, failure scheduling, and security schemes. The goal is to minimize the energy consumption of nodes and divide the application between local nodes and edge nodes by applying the secure min-cut algorithm. Furthermore, the study devises the secure-min-cut algorithm, which aims to migrate data between nodes in a secure form during application partitioning in the system. After partitioning the applications, the node-search algorithm searches optimally to run applications under their deadlines. The energy and failure schemes maintain the energy consumption of the nodes and the failure of the system. Simulation results show that DAPWTS outperforms existing baseline approaches by 30% in terms of energy consumption, deadline, and failure of applications in the system.

show abstract

“…In 2008, Bitcoin was proposed by Satoshi Nakamoto in "Bitcoin: A Peer-to-Peer Electronic Cash System" [14], marking the emergence of blockchain technology. As the *Correspondence: ylchen3@gzu.edu.cn 1 State Key Laboratory of Public Big Data,College of Computer Science and Technology, Guizhou University, Guiyang 550025, China 4 Blockchain Laboratory of Agricultural Vegetables, Weifang University of Science and Technology, Weifang 262700, China Full list of author information is available at the end of the article underlying technology of Bitcoin, blockchain has received extensive attention [15][16][17][18]. Blockchain is a distributed database technology that has the characteristics of decentralization [19][20][21], traceability, tamper-proof, collective maintenance, etc.…”

Section: Introductionmentioning

confidence: 99%

A blockchain index structure based on subchain query

Xing

Chen

et al. 2021

J Cloud Comp

Self Cite

View full text Add to dashboard Cite

Blockchain technology has the characteristics of decentralization and tamper resistance, which can store data safely and reduce the cost of trust effectively. However, the existing blockchain system has weak performance in data management, and only supports traversal queries with transaction hashes as keywords. The query method based on the account transaction trace chain (ATTC) improves the query efficiency of historical transactions of the account. However, the efficiency of querying accounts with longer transaction chains has not been effectively improved. Given the inefficiency and single method of the ATTC index in the query, we propose a subchain-based account transaction chain (SCATC) index structure. First, the account transaction chain is divided into subchains, and the last block of each subchain is connected by a hash pointer. The block-by-block query mode in ATTC is converted to the subchain-by-subchain query mode, which shortens the query path. Multiple transactions of the same account in the same block are merged and stored, which simplifies the construction cost of the index and saves storage resources. then, the construction algorithm and query algorithm is given for the SCATC index structure. Simulation analysis shows that the SCATC index structure significantly improves query efficiency.

show abstract

Rational Protocols and Attacks in Blockchain System

Cited by 69 publications

References 39 publications

Semi‐selfish mining based on hidden Markov decision process

Semi‐selfish mining based on hidden Markov decision process

Dynamic Application Partitioning and Task-Scheduling Secure Schemes for Biosensor Healthcare Workload in Mobile Edge Cloud

A blockchain index structure based on subchain query

Contact Info

Product

Resources

About