Lin Cong

Dr. Lin Cong


Research Focus & Metrics

Academic Career Length

3Years (2024-Present)

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

Representative Publications

View All Publications
26 January 2025 in Applied Sciences
Verified
Journal Article
Open access
PDF file
HCHaolan Cheng
Haolan Cheng
CQChenyi Qiang
Chenyi Qiang
LCLin Cong
Lin Cong
JXJingze Xiao
Jingze Xiao
LLLiu Liu
Liu Liu
CLChunli Lv
Chunli Lv
Data privacy protection is increasingly critical in fields like healthcare and finance, yet existing methods, such as Fully Homomorphic Encryption (FHE), differential privacy (DP), and federated learning (FL), face limitations like high computational complexity, noise interference, and communication overhead. This paper proposes a novel data obfuscation method based on probability density and information entropy, leveraging a probability density extraction module for global data distribution modeling and an information entropy fusion module for dynamically adjusting the obfuscation intensity. In medical image classification, the method achieved precision, recall, and accuracy of 0.93, 0.89, and 0.91, respectively, with a throughput of 57 FPS, significantly outperforming FHE (0.82, 23 FPS) and DP (0.84, 25 FPS). Similarly, in financial prediction tasks, it achieved precision, recall, and accuracy of 0.95, 0.91, and 0.93, with a throughput of 54 FPS, surpassing traditional approaches. These results highlight the method’s ability to balance privacy protection and task performance effectively, offering a robust solution for advancing privacy-preserving technologies.

19 November 2024 in Applied Sciences
Verified
Journal Article
Open access
PDF file
ZZZizhe Zhou
Zizhe Zhou
YWYaqi Wang
Yaqi Wang
LCLin Cong
Lin Cong
YSYujing Song
Yujing Song
TLTianyue Li
Tianyue Li
CLChunli Lv
Chunli Lv
This paper addresses the critical challenge of secure computing in the context of deep learning, focusing on the pressing need for effective data privacy protection during transmission and storage, particularly in sensitive fields such as finance and healthcare. To tackle this issue, we propose a novel deep learning model that integrates a hash tree structure with a skip attention mechanism. The hash tree is employed to ensure data integrity and security, enabling the rapid verification of data changes, while the skip attention mechanism enhances computational efficiency by allowing the model to selectively focus on important features, thus minimizing unnecessary processing. The primary objective of our research is to develop a secure computing model that not only safeguards data privacy but also optimizes feature extraction capabilities. Our experimental results on the CIFAR-10 dataset demonstrate significant improvements over traditional models, achieving a precision of 0.94, a recall of 0.89, an accuracy of 0.92, and an F1-score of 0.91, notably outperforming standard self-attention and CBAM. Additionally, the visualization of results confirms that our approach effectively balances efficient feature extraction with robust data privacy protection. This research contributes a new framework for secure computing, addressing both the security and efficiency concerns prevalent in current methodologies.