Xueqin Liang

dblp:189/5945 · DBLP profile ↗
← Back
13ranked-venue papers
8as first author
10since 2021 · last 2025
0000-0002-0335-1768ORCID · verified

Domains — the database's venue-derived domains; a paper can count in several

Systems, architecture and hardware · 5 · 4 first-author · 4 since 2021Computer networks · 4 · 1 first-author · 4 since 2021Applied, interdisciplinary, general and emerging computing · 2 · 2 first-author · 1 since 2021Security and privacy · 1 · 1 first-authorDatabases, data management, data science and information retrieval · 1 · 1 since 2021
YearPublicationVenuePosition
2025 Are Relay Chains Practically Deployable? Trusted Behavior Dynamics via Evolutionary Games
Xueqin Liang, Ruoyu Yin, Panpan Han, Zheng Yan 0002
ICA3PP (4)1
2025 TriDA: Triangular Fuzzy Double Auction for Efficient and Accurate Task-Worker Matching in Blockchain-Based Crowdsourcing
Xueqin Liang, Jingwen Shao, Panpan Han, Zheng Yan 0002
ICA3PP (4)1
2024 Introduction to the Special Issue on Recent Advances of Blockchain Evolution: Architecture and Performance
abstract
No abstract available.
Xueqin Liang, Xiaokang Wang 0001, Chonggang Wang, Witold Pedrycz
Distributed Ledger Technol. Res. Pract.1
2024 A survey on fuzz testing technologies for industrial control protocols
Zheng Yan 0002, Xueqin Liang
J. Netw. Comput. Appl.3
2023 Edge-Enabled Blockchain-Based V2X Scheme for Secure Communication Within the Smart City Development
abstract
As the high-mobility nature of the vehicles results in frequent leaving and joining the transportation network, real-time data must be collected and shared in a timely manner. In such a transportation network, malicious vehicles can disrupt services and create serious issues, such as deadlocks and accidents. The blockchain is a technology that ensures traceability, consistency, and security in transportation networks. In this study, we integrated edge computing and blockchain technology to improve the optimal utilization of resources, especially in terms of computing, communication, security, and storage. We propose a novel, edge-integrated, blockchain-based vehicle platoon security scheme. For the vehicle platoon, we developed the security architecture, implemented smart contracts for practical network scenarios in network simulator version 3, and integrated them with the simulation urban mobility traffic control interface API. We exhaustively simulated all the scenarios and analyzed the communication performance metrics, such as throughput, delay, and jitter, and the security performance metrics, such as mean squared error, communication, and computational cost. The performance results demonstrate that the developed scheme can solve security-related issues more effectively and efficiently in smart cities.
Suresh Chavhan, Sachin Kumar 0001, Prayag Tiwari, Xueqin Liang, Ikhyun Lee, Khan Muhammad 0001
IEEE Internet Things J.4
2023 SecDedup: Secure data deduplication with dynamic auditing in the cloud
Zheng Yan 0002, Xueqin Liang, Xixun Yu
Inf. Sci.3
2023 A survey on privacy preservation techniques for blockchain interoperability
Ruoyu Yin, Zheng Yan 0002, Xueqin Liang, Haomeng Xie, Zhiguo Wan
J. Syst. Archit.3
2022 A Two-layer Game-based Incentive Mechanism for Decentralized Crowdsourcing
abstract
Decentralized crowdsourcing removes the dependence on a trusted centralized platform based on blockchain and ensures system stability through the consensus of miners. The lack of centralized supervision requires all kinds of system nodes to voluntarily participate while their behaviors are profit-driven and unpredictable, thus introducing challenges to system performance. Moreover, the nodes in a decentralized crowdsourcing system inherently observe little information about the system status; therefore, it is difficult for them to discover and adopt theoretically optimal strategies. Current literature still lacks an effective mechanism to motivate the participation of all types of nodes. To this end, this paper employs a two-layer game model to simulate the interactions in the decentralized crowdsourcing system for investigating the participation willingness of different system nodes. Specifically, we apply a Stackelberg game to model the interactions of a crowdsourcing requester and other nodes, where the requester decides its reward policy and the others respond by selecting their roles to play. In addition, the interaction of the bounded rational other nodes is further represented as an evolutionary game. After analyzing the game model, we further design an incentive mechanism to maximize the requester utility while motivating other nodes to actively participate in the crowdsourcing. Through experimental simulations, we verify the effectiveness of the proposed incentive mechanism.
Xueqin Liang, Zheng Yan 0002
GLOBECOM2
2022 GAIMMO: A Grade-Driven Auction-Based Incentive Mechanism With Multiple Objectives for Crowdsourcing Managed by Blockchain
abstract
Blockchain has been applied for decentralized crowdsourcing management by deploying a number of miners to reach a consensus on crowdsourced task allocation and payment decision. In a blockchain-based crowdsourcing system (BCS), incentive becomes essential to motivate the participation and cooperation of all system entities. However, existing literature scarcely investigates how to motivate heterogeneous crowdsourcers, workers, and miners simultaneously toward satisfying multiple objectives without the support of centralized management. In this article, we propose GAIMMO, a novel grade-driven auction-based incentive mechanism for BCS with multiple objectives in mind: crowdsourcer utility maximization, social welfare maximization, social grade maximization, and social cost minimization. Concretely, we propose a grade-based task sorting (GTS) algorithm to determine the service priority of heterogeneous crowdsourcers in order to motivate their cooperative behaviors, which consequently maximizes crowdsourcer utility when combining with the carefully designed utility functions of other system entities. We propose a grade-based utility function of workers and employ a hierarchical premium-based task assignment (PTA) algorithm to realize social welfare maximization, social grade maximization, and social cost minimization. We further propose a fixed-grade-sum and grade-based reward-sharing (FGSGRS) method to encourage fast block generation and motivate high-grade miners without damaging the profits of the crowdsourcers. We conduct simulation-based experiments to show the effectiveness and advance of our proposed incentive mechanism in stimulating the participation willingness of high-grade system entities and achieving the multiple objectives.
Xueqin Liang, Zheng Yan 0002, Raimo Kantola
IEEE Internet Things J.1
2021 Investigating the Adoption of Hybrid Encrypted Cloud Data Deduplication With Game Theory
abstract
Encrypted data deduplication, along with different preferences in data access control, brings the birth of hybrid encrypted cloud data deduplication (H-DEDU for short). However, whether H-DEDU can be successfully deployed in practice has not been seriously investigated. Obviously, the adoption of H-DEDU depends on whether it can bring economic benefits to all stakeholders. But existing economic models of cloud storage fail to support H-DEDU due to complicated interactions among stakeholders. In this article, we establish a formal economic model of H-DEDU by formulating the utilities of all involved stakeholders, i.e., data holders, data owners, and Cloud Storage Providers (CSPs). Then, we construct a multi-stage Stackelberg game, which consists of Holder Participation Game, Owner Online Game, and CSP Pricing Game, to capture the interactions among all system stakeholders. We further analyze the conditions of the existence of a sub-game perfect Nash Equilibrium and propose a gradient-based algorithm to help the stakeholders choose near-optimal strategies. Extensive experiments show the feasibility of the proposed algorithm in achieving the Nash Equilibrium of the Stackelberg game. Additionally, we investigate the effects of parameters related to CSP, data owners and data holders on H-DEDU adoption. Our study advises all stakeholders the best strategies to adopt H-DEDU.
Xueqin Liang, Zheng Yan 0002, Robert H. Deng
IEEE Trans. Parallel Distributed Syst.1
2020 Game theoretical study on client-controlled cloud data deduplication
Xueqin Liang, Zheng Yan 0002, Robert H. Deng
Comput. Secur.1
2019 A survey on game theoretical methods in Human-Machine Networks
abstract
A number of information and resource sharing systems arise and become popular with the rapid development of communication technologies and mobile smart devices. The interactions between humans and machines are intense and their synergistic reactions have attracted special attention for the reason of forming so called Human–Machine Networks (HMN). HMNs refer to these networks where humans and machines work together to provide synergistic effects on their payoffs. Game theory, which can capture the interactions among players dexterously, has been widely used in solving various problems in HMN systems from the view of economics. In this paper, we extensively review the literature about game theoretical methods in HMNs, in particular focusing on its typical systems such as crowdsourcing, an elemental HMN and Internet of Things (IoT), a hybrid HMN, as well as Bitcoin. We propose a series of requirements to evaluate existing work. For reviewing and analyzing each system, we specify application purposes, players, strategies, game models and equilibria based on our proposed requirements. In the sequel, we identify a number of common and distinct open issues in HMNs and point out future research directions.
Xueqin Liang, Zheng Yan 0002
Future Gener. Comput. Syst.1
2019 Game Theoretical Analysis on Encrypted Cloud Data Deduplication
abstract
Duplicated data storage wastes memory resources and brings extra data-management load and cost to cloud service providers (CSPs). Various feasible schemes to deduplicate encrypted cloud data have been reported. However, their successful deployment in practice depends on whether all system players or stakeholders are willing to accept and execute them in a cooperative way, which was scarcely investigated in the previous literature. In this paper, we employ a noncooperative game to model the interactions in a client-side server-controlled deduplication scheme (S-DEDU) and construct an incentive mechanism based on payment discount to motivate its final acceptance. The experimental results based on a real-world dataset demonstrate the individual rationality, incentive compatibility, profitability, and robustness of our incentive mechanism.
Xueqin Liang, Zheng Yan 0002, Xiaofeng Chen 0001, Laurence T. Yang, Wenjing Lou, Y. Thomas Hou 0001
IEEE Trans. Ind. Informatics1