Kuan Fan

Dr. Kuan Fan


Research Focus & Metrics

Academic Career Length

8Years (2019-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
19 April 2019 in IEEE Transactions on Industrial Informatics
Verified
Journal Article
Closed access
XSXin Su
Xin Su
KFKuan Fan
Kuan Fan
WSWenbo Shi
Wenbo Shi
Privacy-preserving distributed data fusion is a pretreatment process in data mining involving security models. In this paper, we present a method of implementing multi-party data fusion, wherein redundant attributes of a same set of individuals are stored by multiple parties. In particular, the merged data does not suffer from background attacks or other reasoning attacks, and individual attributes are not leaked. To achieve this, we present three algorithms that satisfy K-Anonymous and differential privacy. Experimental results on real data sets suggest that the proposed algorithm can effectively preserve information in data mining tasks.

5 August 2021 in PLOS ONE
Verified
Journal Article
Open access
PDF file
ZHZhengyu Hu
Zhengyu Hu
WLWenrui Liu
Wenrui Liu
SLShengchen Ling
Shengchen Ling
KFKuan Fan
Kuan Fan
In order to solve the problem of unbalanced workload of employees in parallel flow shop scheduling, a method of job standard balance is proposed to describe the work balance of employees. The minimum delay time of completion and the imbalance of employee work are taken as the two goals of the model. A bi-objective nonlinear integer programming model is proposed. NSGA-II-EDSP, NSGA-II-KES, and NSGA-II-QKES heuristic rule algorithms are designed to solve the problem. A number of computational experiments of different sizes are conducted, and compared with solutions generated by NSGA-II. The experimental results show the advantages of the proposed model and method, which error is reduced 14.56%, 15.16% and 15.67%.

1 November 2019 in Thin-Walled Structures
Verified
Journal Article
Closed access
KFKuan Fan
Kuan Fan
JZJiani Zeng
Jiani Zeng
ZHZhengdong Huang
Zhengdong Huang
QLQinghua Liu
Qinghua Liu

8 May 2025 in IEEE Transactions on Consumer Electronics
Verified
Journal Article
Closed access
MLMingxi Liu
Mingxi Liu
KFKuan Fan
Kuan Fan
NLNing Lu
Ning Lu
WSWenbo Shi
Wenbo Shi
Mohammed AlenaziMohammed Alenazi
Mohammed Alenazi
SKSaru Kumari
Saru Kumari
By integrating multi-cloud (MC) storage with the “edge-to-cloud” architecture of consumer IoT, the metaverse paradigm achieves enhanced efficiency in real-time data collection and interactive virtual feedback. However, data stored across multiple clouds is vulnerable to tampering and theft due to the inherent insecurity of cloud computing, and cloud service providers, driven by economic interests, may conceal data losses. Existing data integrity auditing techniques fail to ensure prompt and reliable verification for distributed data in the MC-enabled metaverse paradigm, limiting their effectiveness in eliminating erroneous data swiftly. To address these challenges, we propose E-MAEL (Efficient Multi-cloud Data Auditing with Error Localization) for IoT devices in the metaverse. We design an MC self-auditing framework based on blockchain to eliminate audit delays caused by third-party auditors. A variable-length auditing protocol based on Schnorr is introduced, reducing computation overhead by up to 21% compared to schemes relying on bilinear pairing and RSA assumptions. We develop a single-round error localization strategy based on symmetric unbalanced block design, enabling efficient identification and removal of erroneous data while resisting collusion attacks. A dynamic reputation update strategy using convex functions is proposed, providing robust reputation management for MCs and effectively penalizing audit errors. Theoretical security analyses and experimental results demonstrate the effectiveness of EMAEL in improving computational efficiency and enhancing reliability in MC auditing systems.

15 June 2025 in Electronics
Verified
Journal Article
Open access
PDF file
KFKuan Fan
Kuan Fan
QLQingdong Liu
Qingdong Liu
CLChuchu Liu
Chuchu Liu
NLNing Lu
Ning Lu
WSWenbo Shi
Wenbo Shi
With the rapid advancement in artificial intelligence, autonomous driving has emerged as a prominent research frontier. Autonomous vehicles rely on high-precision high-definition map data, necessitating timely map updates by map companies to accurately reflect road conditions. This paper proposes an efficient and fair map-data-sharing mechanism for vehicular networks. To encourage vehicles to share data, we introduce a reputation unit to resolve the cold-start issue for new vehicles, effectively distinguishing legitimate new vehicles from malicious attackers. Considering both the budget constraints of map companies and heterogeneous data collection capabilities of vehicles, we design a fair incentive mechanism based on the proposed reputation unit and a reverse auction algorithm, achieving an optimal balance between data quality and procurement costs. Furthermore, the scheme has been developed to facilitate mutual authentication between vehicles and Roadside Unit(RSU), thereby ensuring the security of shared data. In order to address the issue of redundant authentication in overlapping RSU coverage areas, we construct a Merkle hash tree structure using a set of anonymous certificates, enabling single-round identity verification to enhance authentication efficiency. A security analysis demonstrates the robustness of the scheme, while performance evaluations and the experimental results validate its effectiveness and practicality.

9 September 2026 in Applied Sciences
Verified
Journal Article
Open access
PDF file
Zhen LuanZhen Luan
Zhen Luan
JDJiahui Du
Jiahui Du
KFKuan Fan
Kuan Fan
Account-based state sharding improves blockchain parallelism by distributing account states and transaction execution across physical shards, but effective placement must preserve transaction locality without concentrating processing demand on a small number of shards. This paper presents LB-Louvain, a coarse-to-fine account-partitioning heuristic in which standard Louvain first extracts logical communities, followed by load-aware community-to-shard assignment and restricted boundary-account refinement. In controlled BlockEmulator experiments using 300,000 replayed Ethereum transactions and five repeated system runs per configuration, relative to CLPA, the complete LB-Louvain pipeline reduces the mean cross-shard transaction ratio by approximately 2.1%, increases active throughput by approximately 19.7%, and reduces average confirmation latency by approximately 9.4%. Component-wise ablation confirms complementary roles for load-aware assignment and boundary refinement. The evaluated behavior remains stable over β∈[1,4], while partition-only profiling keeps the measured partition computation below 100 ms across the tested 50,000–300,000 transaction prefixes and 4–24 physical shards. An auxiliary migration experiment further shows that Fine-Grained activation reduces the observed migration-deferred set by approximately 39.8% relative to Full Locking while maintaining comparable throughput and confirmation latency. Broader archived experiments with Monoxide and CLPA are retained separately from the controlled revision results.