Caiqin Dong

Caiqin Dong

Auto-generated profile, based on publicly available information

Caiqin Dong

College of Information Science and Technology/College of Cyber Security, National Joint Engineering Research Center of Network Security Detection and Protection Technology, Guangdong Key Laboratory of Data Security and Privacy Preserving, Jinan University, Guangzhou, Guangdong, China

Research Focus & Metrics

Academic Career Length

5Years (2022-Present)

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

Representative Publications

View All Publications
5 April 2023 in IEEE Transactions on Dependable and Secure Computing
Verified
Journal Article
Closed access
CDCaiqin Dong
Caiqin Dong
JWJian Weng
Jian Weng
Ming LiMing Li
Ming Li
JLJia-Nan Liu
Jia-Nan Liu
Zhiquan LiuZhiquan Liu
Zhiquan Liu
SYShui Yu
Shui Yu
Federated learning (FL) trains a model over multiple datasets by collecting the local models rather than raw data, which can help facilitate distributed data analysis in many real-world applications. Since the model parameters can leak information about the training datasets, it is necessary to preserve the privacy of the FL participants' local models. Furthermore, FL is vulnerable to poisoning attacks which can significantly decrease the model utility. To settle the above issues, we propose a privacy-preserving and Byzantine-robust FL scheme $\Pi _{\rm{P2Brofl}}$ that maintains robustness in the presence of poisoning attacks and preserves the privacy of local models simultaneously. Specifically, $\Pi _{\rm{P2Brofl}}$ leverages three-party computation (3PC) to securely achieve a Byzantine-robust aggregation method. To improve the efficiency of privacy-preserving local model selection and aggregation, we propose a maliciously secure top- $k$ protocol $\Pi _{\rm{top}-k}$ that has low communication overhead. Moreover, we present an efficient maliciously secure shuffling protocol $\Pi _{\rm{shuffle}}$ since secure shuffling is necessary for our secure top- $k$ protocol. The security proof of the scheme is given and experiments on real-world datasets are conducted in this paper. When the proportion of Byzantine participants is 50%, the error rate of the model only increases by 1.05% while it increases by 23.78% without using our protection.

17 May 2023 in IEEE Transactions on Dependable and Secure Computing
Verified
Journal Article
Closed access
YCYudan Cheng
Yudan Cheng
JMJianfeng Ma
Jianfeng Ma
Zhiquan LiuZhiquan Liu
Zhiquan Liu
ZLZhetao Li
Zhetao Li
YWYongdong Wu
Yongdong Wu
RLRunchuan Li
Runchuan Li
In mobile crowdsensing (MCS), truth discovery (TD) plays an important role in sensing task completion. Most of the existing studies focus on the privacy preservation of mobile users, and the reliability of mobile users is evaluated by their weights which are calculated based on the submitted sensing data. However, if mobile users are unreliable, the submitted sensing data and their weights are also unreliable, which may influence the accuracy of the ground truths of sensing tasks. Therefore, this paper proposes a privacy-preserving and reputation-based truth discovery framework named PRTD which can generate the ground truths of sensing tasks with high accuracy while preserving privacy. Specifically, we first preserve sensing data privacy, weight privacy, and reputation value privacy by utilizing the Paillier algorithm and Pedersen commitment. Then, to verify whether the reputation values of mobile users are tampered with and select mobile users that satisfy the corresponding reputation requirements, we design a privacy-preserving reputation verification algorithm based on reputation commitment and zero-knowledge proof and propose a concept of reliability level to select mobile users. Finally, a general TD algorithm with reliability level is presented to improve the accuracy of the ground truths of sensing tasks. Moreover, theoretical analysis and performance evaluation are conducted, and the evaluation results demonstrate that the PRTD framework outperforms the existing TD frameworks in several evaluation metrics in the synthetic dataset and real-world dataset.

18 February 2022 in IEEE Transactions on Dependable and Secure Computing
Verified
Journal Article
Closed access
CDCaiqin Dong
Caiqin Dong
JWJian Weng
Jian Weng
JLJia-Nan Liu
Jia-Nan Liu
AYAnjia Yang
Anjia Yang
Zhiquan LiuZhiquan Liu
Zhiquan Liu
JMJianfeng Ma
Jianfeng Ma
Genome-Wide Association Study (GWAS) aims at detecting the association between diseases and Single-Nucleotide Polymorphisms (SNPs) with statistical techniques and has great potential for disease diagnosis. To obtain high-quality results, GWAS requires large-scale genomic data containing individuals' privacy information. Thus, how to improve the efficiency of GWAS while protecting the privacy of genomic data becomes a critical challenge. In this paper, we propose a secure and efficient GWAS scheme. By using secure three-party computation, we present a series of protocols, i.e., Secure Quality Control, Secure Principle Component Analysis, Secure Cochran-Armitage trend test, and Secure Logistic Regression, to cover the most significant procedures of secure GWAS. In these protocols, a new comparison protocol is designed to reduce communication and improve efficiency. Furthermore, by extending the above comparison protocol to be maliciously secure and utilizing other technologies, e.g., consistency check, we extend the whole GWAS scheme to malicious security with rationally additional overhead. Experimental results demonstrate that our protocols achieve about 33% performance improvement than the state-of-art secure GWAS scheme using two-party computation in terms of runtime and communication in the semi-honest setting. The cost of our scheme in the malicious setting is around 1.5X than that in the semi-honest setting.