Yongquan Cui
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Yongquan Cui has a total of 18 co-authors. Here are the top co-authors by number of shared publications:
- Songfeng Lu
Huazhong University of Science and Technology
3 shared publications - Xueming Tang
Hubei Key Laboratory of Distributed System Security, Hubei Engineering Research Center on Big Data Security, School of Cyber Science and Engineering, Huazhong University of Science and Technology, Wuhan, China
2 shared publications - Zhi Lu
Huazhong University of Science and Technology
2 shared publications Congying Dou
School of Computer Science and Technology, Huazhong University of Science and Technology, Wuhan 430074, China
1 shared publicationFan Hong
Huazhong University of Science and Technology, China
1 shared publication- Guozhou Jiang
College of Physics and Electronic Science, Hubei Engineering Research Center for Micronano Optoelectronic Devices and Integration,Hubei Key Laboratory of Optoelectronic Conversion Materials and Devices Hubei Normal University, Huangshi, People’s Republic of China
1 shared publication
Latest Publications
- 16 April 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Emerging Topics in Computing
- Vol. 14 (2) , 528-542
Practical and Robust Privacy-Preserving K-Means Clustering Protocols With GPU Acceleration
Privacy-preserving machine learning allows for the protection of the original data's privacy while training models. In recent years, researchers have implemented machine learning algorithms using secure multi-party computation (MPC) techniques, with clustering being one of the key applications. However, current privacy-preserving clustering algorithms still face challenges regarding execution speed and communication overhead. In this paper, we propose a new three-party GPU-accelerated privacy-preserving K-means clustering algorithm aimed at improving computational efficiency in distributed settings. We design a three-party K-means algorithm and optimize subprotocols such as the truncation protocol and the constant-round comparison protocol to reduce communication latency. Additionally, we leverage the powerful capabilities of Graphics Processing Units (GPUs) to enhance the execution efficiency of the algorithm, particularly for intensive distance computation and centroid updates. Finally, we propose a privacy-preserving clustering quality evaluation protocol to address the parameter selection issue (determining the optimal number of clusters $K$) in privacy-preserving K-means. Experimental results on the synthetic datasets demonstrate that our method achieves a $137\times$–$221\times$ improvement in efficiency compared to the CPU-based protocol of Mohassel et al., and a $5.7\times$–$11.2\times$ speedup over the CPU-based state-of-the-art implementation by Wei et al..
- 16 April 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Emerging Topics in Computing
- Vol. 14 (2) , 528-542
Practical and Robust Privacy-Preserving K-Means Clustering Protocols With GPU Acceleration
Privacy-preserving machine learning allows for the protection of the original data's privacy while training models. In recent years, researchers have implemented machine learning algorithms using secure multi-party computation (MPC) techniques, with clustering being one of the key applications. However, current privacy-preserving clustering algorithms still face challenges regarding execution speed and communication overhead. In this paper, we propose a new three-party GPU-accelerated privacy-preserving K-means clustering algorithm aimed at improving computational efficiency in distributed settings. We design a three-party K-means algorithm and optimize subprotocols such as the truncation protocol and the constant-round comparison protocol to reduce communication latency. Additionally, we leverage the powerful capabilities of Graphics Processing Units (GPUs) to enhance the execution efficiency of the algorithm, particularly for intensive distance computation and centroid updates. Finally, we propose a privacy-preserving clustering quality evaluation protocol to address the parameter selection issue (determining the optimal number of clusters $K$) in privacy-preserving K-means. Experimental results on the synthetic datasets demonstrate that our method achieves a $137\times$–$221\times$ improvement in efficiency compared to the CPU-based protocol of Mohassel et al., and a $5.7\times$–$11.2\times$ speedup over the CPU-based state-of-the-art implementation by Wei et al..
- 20 May 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Forensics and Security
- Vol. 19 (15566013) , 5575-5590
Split Aggregation: Lightweight Privacy-Preserving Federated Learning Resistant to Byzantine Attacks
Federated Learning (FL), a distributed learning paradigm optimizing communication costs and enhancing privacy by uploading gradients instead of raw data, now confronts security challenges. It is particularly vulnerable to Byzantine poisoning attacks and potential privacy breaches via inference attacks. While homomorphic encryption and secure multi-party computation have been employed to design robust FL mechanisms, these predominantly rely on Euclidean distance or median-based metrics and often fall short in comprehensively defending against advanced poisoning attacks, such as adaptive attacks. Addressing this issue, our study introduces “Split-Aggregation”, a lightweight privacy-preserving FL solution capable of withstanding adaptive attacks. This method maintains a computational complexity of $O(dkN+k^{3})$ and a communication overhead of $O(dN)$ , performing comparably to FedAvg when $k=10$ . Here, d represents the gradient dimension, N the number of users, and k the rank chosen during random singular value decomposition. Additionally, we utilize adaptive weight coefficients to mitigate gradient descent issues in honest users caused by non-independent and identically distributed (Non-IID) data. The proposed method’s security and robustness are theoretically proven, with its complexity thoroughly analyzed. Experimental results demonstrate that at $k=10$ , this method surpasses the top-1 accuracy of current state-of-the-art robust privacy-preserving FL approaches. Moreover, opting for a smaller k significantly boosts efficiency with only marginal compromises in accuracy.
- 20 May 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Forensics and Security
- Vol. 19 (15566013) , 5575-5590
Split Aggregation: Lightweight Privacy-Preserving Federated Learning Resistant to Byzantine Attacks
Federated Learning (FL), a distributed learning paradigm optimizing communication costs and enhancing privacy by uploading gradients instead of raw data, now confronts security challenges. It is particularly vulnerable to Byzantine poisoning attacks and potential privacy breaches via inference attacks. While homomorphic encryption and secure multi-party computation have been employed to design robust FL mechanisms, these predominantly rely on Euclidean distance or median-based metrics and often fall short in comprehensively defending against advanced poisoning attacks, such as adaptive attacks. Addressing this issue, our study introduces “Split-Aggregation”, a lightweight privacy-preserving FL solution capable of withstanding adaptive attacks. This method maintains a computational complexity of $O(dkN+k^{3})$ and a communication overhead of $O(dN)$ , performing comparably to FedAvg when $k=10$ . Here, d represents the gradient dimension, N the number of users, and k the rank chosen during random singular value decomposition. Additionally, we utilize adaptive weight coefficients to mitigate gradient descent issues in honest users caused by non-independent and identically distributed (Non-IID) data. The proposed method’s security and robustness are theoretically proven, with its complexity thoroughly analyzed. Experimental results demonstrate that at $k=10$ , this method surpasses the top-1 accuracy of current state-of-the-art robust privacy-preserving FL approaches. Moreover, opting for a smaller k significantly boosts efficiency with only marginal compromises in accuracy.
- Open Access
- 20 March 2020
- Published by Springer Nature in Scientific Reports
- Vol. 10 (1) , 1-11
Quantum Search on Encrypted Data Based on Quantum Homomorphic Encryption
We propose a homomorphic search protocol based on quantum homomorphic encryption, in which a client Alice with limited quantum ability can give her encrypted data to a powerful but untrusted quantum server and let the server search for her without decryption. By outsourcing the interactive key-update process to a trusted key center, Alice only needs to prepare and encrypt her original data and to decrypt the ciphered search result in linear time. Besides, we also present a compact and perfectly secure quantum homomorphic evaluation protocol for Clifford circuits, where the decryption key can be calculated by Alice with polynomial overhead with respect to the key length.
- 20 March 2020
- Published by Springer Nature in Scientific Reports
- Vol. 10 (1) , 1-11
Open AccessQuantum Search on Encrypted Data Based on Quantum Homomorphic Encryption
We propose a homomorphic search protocol based on quantum homomorphic encryption, in which a client Alice with limited quantum ability can give her encrypted data to a powerful but untrusted quantum server and let the server search for her without decryption. By outsourcing the interactive key-update process to a trusted key center, Alice only needs to prepare and encrypt her original data and to decrypt the ciphered search result in linear time. Besides, we also present a compact and perfectly secure quantum homomorphic evaluation protocol for Clifford circuits, where the decryption key can be calculated by Alice with polynomial overhead with respect to the key length.
- Open Access
- 5 February 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 6, 9059-9069
Equilibrium Index and Core Node Set of New Social Networks
In the last fifteen years, the network-based new media has greatly promoted the development of social networks, therefore it becomes the main form of social composition. Research on social networks commenced a long time ago and revealed meaningful features of the old social network. However, in the new social networks, group members are almost 24-hours online and can exchange various information that cannot be dynamically handled or described by the most of the existing studies. In this paper, we construct a formula to calculate the amount of the data dissemination of a node. Thereafter, we present participation equilibrium index formula and maximum equilibrium index formula that can measure the dynamic equilibrium of social networks even for different topics. With these formulas, we define λ-set and core node set of a social group and also present algorithms to work out the two sets. To evaluate our theory and method, we have developed SN-Python-I that can filter and calculate the amount of data exchanged by any node in any group. Based on a contract signed in 2013 with Ali and Tencent, we are permitted to track 300 actual groups for the past three years. Real data of those group reveals that equilibrium index as well as λ-set and core node set of social network change with the time, ages, topics and classification of the groups. What´s more, monthly equilibrium index can also indicate life stages of a group. Those significant properties and rules have not yet been revealed by traditional social network models.
- 5 February 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 6, 9059-9069
Open AccessEquilibrium Index and Core Node Set of New Social Networks
In the last fifteen years, the network-based new media has greatly promoted the development of social networks, therefore it becomes the main form of social composition. Research on social networks commenced a long time ago and revealed meaningful features of the old social network. However, in the new social networks, group members are almost 24-hours online and can exchange various information that cannot be dynamically handled or described by the most of the existing studies. In this paper, we construct a formula to calculate the amount of the data dissemination of a node. Thereafter, we present participation equilibrium index formula and maximum equilibrium index formula that can measure the dynamic equilibrium of social networks even for different topics. With these formulas, we define λ-set and core node set of a social group and also present algorithms to work out the two sets. To evaluate our theory and method, we have developed SN-Python-I that can filter and calculate the amount of data exchanged by any node in any group. Based on a contract signed in 2013 with Ali and Tencent, we are permitted to track 300 actual groups for the past three years. Real data of those group reveals that equilibrium index as well as λ-set and core node set of social network change with the time, ages, topics and classification of the groups. What´s more, monthly equilibrium index can also indicate life stages of a group. Those significant properties and rules have not yet been revealed by traditional social network models.
- Open Access
- 1 March 2014
- Published by SAGE Publications in International Journal of Distributed Sensor Networks
- Vol. 10 (3) , 473151
A Collaboratively Hidden Location Privacy Scheme for VANETs
Communication messages in vehicular ad hoc networks (VANETs) can be used to locate and track vehicles, and this can lead to threats on location privacy of vehicle users. In this paper, we address the problem of privacy and liability in VANETs. We propose a scheme that provides location privacy by utilizing a variant of ring signature. It allows a vehicle to form a ring arbitrarily with nearby vehicles and sign its messages anonymously, so that it can hide itself in the surrounding vehicles. When solving a dispute, the real signer will be responsible for what it has signed as the anonymity is revocable by the authority.
- 1 March 2014
- Published by SAGE Publications in International Journal of Distributed Sensor Networks
- Vol. 10 (3) , 473151
Open AccessA Collaboratively Hidden Location Privacy Scheme for VANETs
Communication messages in vehicular ad hoc networks (VANETs) can be used to locate and track vehicles, and this can lead to threats on location privacy of vehicle users. In this paper, we address the problem of privacy and liability in VANETs. We propose a scheme that provides location privacy by utilizing a variant of ring signature. It allows a vehicle to form a ring arbitrarily with nearby vehicles and sign its messages anonymously, so that it can hide itself in the surrounding vehicles. When solving a dispute, the real signer will be responsible for what it has signed as the anonymity is revocable by the authority.
- 1 January 2006
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 23795352,p. 86-89
Administrative Usage Control Model for Secure Interoperability
The secure interaction between two or more administrative domains is a major concern. IRBAC2000 is a model that quickly establishes a flexible policy for dynamic role translation from foreign domains to local. A-IRBAC2000 mode utilizes RBAC to manage dynamic role translation between foreign and local domains. We will see that these mechanisms have significant shortcomings. We propose an improved administrative usage control model named AUCON to overcome the weakness of previous models. AUCON provides administrates user-role assignment for local and foreign domain with unified method. It provides flexible enough mechanism to distinguish users of foreign and local domain and can enforce more strict control for foreign user. While retaining the advantage of traditional RBAC model, AUCON model is being implemented in experiment system
- 1 January 2006
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 23795352,p. 86-89
Administrative Usage Control Model for Secure Interoperability
The secure interaction between two or more administrative domains is a major concern. IRBAC2000 is a model that quickly establishes a flexible policy for dynamic role translation from foreign domains to local. A-IRBAC2000 mode utilizes RBAC to manage dynamic role translation between foreign and local domains. We will see that these mechanisms have significant shortcomings. We propose an improved administrative usage control model named AUCON to overcome the weakness of previous models. AUCON provides administrates user-role assignment for local and foreign domain with unified method. It provides flexible enough mechanism to distinguish users of foreign and local domain and can enforce more strict control for foreign user. While retaining the advantage of traditional RBAC model, AUCON model is being implemented in experiment system