Kun Niu

Kun Niu

Auto-generated profile, based on publicly available information

Kun Niu

Guizhou University

Research Focus & Metrics

Academic Career Length

6Years (2021-Present)

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

Representative Publications

View All Publications
28 January 2022 in Wireless Communications and Mobile Computing
Verified
Journal Article
Open access
PDF file
XYXun Yang
Xun Yang
WTWeijie Tan
Weijie Tan
CPChai Peng
Chai Peng
SXShuwen Xiang
Shuwen Xiang
KNKun Niu
Kun Niu
Federated learning (FL) is an emerging collaborative machine learning method. In FL processing, the data quality shared by users directly affects the accuracy of the federated learning model, and how to encourage more data owners to share data is crucial. In other words, how to design a good incentive mechanism is the key problem in FL. In this paper, we propose an incentive mechanism based on the enhanced Shapley value method for FL. In the proposed mechanism, the enhanced Shapley value method is proposed to measure income distribution, which takes multiple influence factors as weights. The analytic hierarchy process (AHP) is used to find the corresponding weight value of the influence factors. Finally, the numerical experiments are carried to verify the performance of the proposed incentive mechanism. The results show that compared with the Shapley value method considering the single factor, the income distribution of all participants can better reflect multiple factor contribution when using the enhanced Shapley value method.

28 April 2021 in Security and Communication Networks
Verified
Journal Article
Open access
PDF file
KNKun Niu
Kun Niu
CPChai Peng
Chai Peng
WTWeijie Tan
Weijie Tan
ZZZhou Zhou
Zhou Zhou
YXYi Xu
Yi Xu
Benefiting from the development of smart urban computing, the mobile crowd sensing (MCS) network has emerged as momentous communication technology to sense and collect data. The users upload data for specific sensing tasks, and the server completes the aggregation analysis and submits to the sensing platform. However, users’ privacy may be disclosed, and aggregate results may be unreliable. Those are challenges in the trust computation and privacy protection, especially for sensitive data aggregation with spatial information. To address these problems, a verifiable location-encrypted spatial aggregation computing (LeSAC) scheme is proposed for MCS privacy protection. In order to solve the spatial domain distributed user ciphertext computing, firstly, we propose an enhanced-distance-based interpolation calculation scheme, which participates in delegate evaluator based on Paillier homomorphic encryption. Then, we use aggregation signature of the sensing data to ensure the integrity and security of the data. In addition, security analysis indicates that the LeSAC can achieve the IND-CPA indistinguishability semantic security. The efficiency analysis and simulation results demonstrate the communication and computation overhead of the LeSAC. Meanwhile, we use the real environment sensing data sets to verify availability of proposed scheme, and the loss of accuracy (global RMSE) is only less than 5%, which can meet the application requirements.

23 January 2024
Verified
Book Chapter
Closed access
PDF file
JHJinqiu Hou
Jinqiu Hou
CPChai Peng
Chai Peng
WTWeijie Tan
Weijie Tan
CZChongyi Zhong
Chongyi Zhong
KNKun Niu
Kun Niu
HLHu Li
Hu Li

6 February 2026 in SSRN Electronic Journal
Verified
Preprint
Open access
ZYZe Yang
Ze Yang
YTYouliang Tian
Youliang Tian
KNKun Niu
Kun Niu
MLMengqian Li
Mengqian Li
RSRuixing Song
Ruixing Song
JMJianfeng Ma
Jianfeng Ma
Graph-structured knowledge is crucial for integrating multi-source data in AI-powered systems, yet sharing such data raises severe privacy concerns as topological structures can reveal sensitive relationships. This paper introduces a novel structure-based privacy preservation framework grounded in information theory, formulating the problem across three synergistic layers: structural quantification, correlation analysis, and adaptive anonymization. First, an entropy-based subgraph detection mechanism is proposed to minimize information leakage by reducing inter-community uncertainty, effectively partitioning the graph into cohesive communities with minimal structural disclosure. Second, we propose a structure-based utility similarity metric that enables cross-community clustering by assessing functional roles of nodes, thereby preserving essential data utility for downstream fusion and analysis. The core is a dual-criteria scheme that fuses structural and utility information to co-optimise anonymity and usability. Security analysis confirms dual guarantees of structural availability and privacy. Evaluations on real-world social networks demonstrate highly competitive performance, maintaining approximately 95\% structural utility and community detection accuracy, 90\% structural fidelity, with efficient processing of large-scale graphs (10k nodes, 100k edges) in 39.86s to 72.63s. This work provides an efficient pathway for secure information fusion, enabling safe utilization of graph knowledge without compromising analytical value.