Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Anke Xie

dblp:355/1197 · DBLP profile ↗
← Back
4ranked-venue papers
0as first author
4since 2021 · last 2025
0000-0003-2188-8240ORCID · corroborated

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

Computer networks · 2 · 2 since 2021Systems, architecture and hardware · 1 · 1 since 2021Databases, data management, data science and information retrieval · 1 · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Network and information security
1 paper
Blockchain and cryptocurrency security · 50% Cryptographic protocols and secure computation · 50%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Distributed systems · 100%

Topics — the 2 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Blockchain and cryptocurrency security
permissioned blockchain
0.912025
DataFly: A Confidentiality-Preserving Data Migration Across Heterogeneous Blockchains · IEEE Trans. Computers 2025
Distributed systems
consensus
0.312025
DataFly: A Confidentiality-Preserving Data Migration Across Heterogeneous Blockchains · IEEE Trans. Computers 2025

Methods — techniques the papers use, named apart from their topics

integrated signature and public key encryption · 1.7ECDSA · 1.7
YearPublicationVenuePosition
2025 An Efficient and Privacy-Preserving Spatial Crowdsourcing Protocol From Hash Functions for IoT
abstract
The proliferation of smart devices has propelled the advancement of IoT-based spatial crowdsourcing. The issue of location privacy in task allocation for IoT-based spatial crowdsourcing has attracted significant attention. Therefore, the main goals of privacy-preserving spatial crowdsourcing (PriSC) are: 1) achieving better location privacy for both participants and tasks and 2) achieving better allocation performance, i.e., accuracy and average moving distance. The homomorphic encryption-based approaches can achieve these goals, yet they suffer from heavy computation and large communication overhead. Although the differential privacy (DP)-based approaches are very efficient, these approaches leverage allocation performance to achieve better location privacy. Motivated by the deficiencies of these existing approaches, we propose a lightweight hash-based spatial crowdsourcing protocol, which not only protects both task location and participant location from the server but also reduces service providers’ computation and communication overhead. Besides, our design is independent of the concrete hash function and thus can be instantiated by any collision-resistant cryptographic hash function. Experiment results demonstrate that our protocol outperforms related works in terms of accuracy and average moving distance.
Parhat Abla, Wan Fang, Taotao Li, Anke Xie
IEEE Internet Things J.5
2025 DataFly: A Confidentiality-Preserving Data Migration Across Heterogeneous Blockchains
abstract
Permissioned blockchains play a significant role in various application scenarios. Applications built on heterogeneous permissioned blockchains need to migrate data from one chain to another, aiming to keep their competitiveness and security. Thus, data migration across heterogeneous chains is a building block of permissioned blockchains. However, existing data migration protocols across heterogeneous chains are rarely used in practice since data migration technologies are insecure. To this end, we propose a data migration protocol across permissioned blockchains, namedDataFly. We design apeg consensus mechanism, which provides consistent data-migration functionality between any two permissioned blockchains. To preserve the confidentiality of data, we invoke two classical cryptographic methods, i.e., i) ECDSA feature and ii) theintegrated signature and public key encryptionscheme. Through combining those two methods, data can be securely migrated from one permissioned blockchain to another without exposing the migrated data to anyone except associated parties. To demonstrate the practicality ofDataFly, we implement a prototype ofDataFlyusing existing popular permissioned blockchains, i.e., Hyperledger Fabric and private enterprise Ethereum. Measurement results demonstrate thatDataFlyoutperforms related works in terms of transaction latency and gas costs.
Taotao Li, Huawei Huang, Parhat Abla, Qinglin Yang, Anke Xie, Debiao He, Zibin Zheng
IEEE Trans. Computers6
2024 A Blockchain-based carbon emission security accounting scheme
abstract
To solve the problem of climate warming, countries around the world have paid special attention to the construction of carbon governance. Carbon emission accounting is an important policy tool to control the vented CO2. But at present, there are third-party agencies in carbon emission accounting that cannot ensure the fairness and impartiality of accounting, and there may be risks such as illegal use and leakage of sensitive information in the process of carbon emission data transmission. Therefore, We design the blockchain-based carbon emission security accounting scheme (BCESAS) and propose cross-chain verification contract to ensure the efficiency of cross-chain information accounting. In addition, bilinear pairing is used to ensure data integrity, and we encrypt private data using an improved and more secure homomorphic encryption algorithm to ensure that privacy is not leaked during the transfer of carbon emission data, which is more efficent than other homomorphic encryption algorithms. We also use reputation mechanism to regulate the behavior of carbon emission auditors. The theoretical and experimental analysis demonstrates that BCESAS can verify the integrity, correctness and privacy of cross-chain data calculation result effectively, realizing secure and reliable expansion of blockchain.
Yunhua He, Zhihao Zhou 0001, Ke Xiao 0001, Anke Xie, Bin Wu 0011
Comput. Networks5
2023 Cooperative Carrier Aircraft Support Operation Scheduling via Multi-Agent Reinforcement Learning
abstract
Carrier Aircraft support operation is an important component of the carrier aviation support system, and its efficiency is closely related to the aircraft sortie rate. However, the carrier deck faces significant challenges such as limited space, scarce resources and constantly changing environmental conditions. These factors have a profound impact on the aircraft support operations, particularly in complex scenarios, requiring careful and rational scheduling. To solve above problems, we propose a collaborative fast scheduling framework for Multi-Agent support operations, which is based on a distributed partially observable Markov decision process (Dec-POMDP) model. Within this framework, we develop a dynamic scheduling algorithm based on centralized training with decentralized execution framework (CTDE). To evaluate the performance of our approach, we establish a simulation environment for aircraft scheduling and compare our algorithm’s performance with VDN and QMIX in various carrier aircraft scenarios. Experimental results demonstrate that our algorithm outperforms others in terms of both training efficiency and scheduling quality.
Hongjie Hao, Yuan Chi, Rongxin Gao, Anke Xie, Mingliang Xu 0001
MDM5