YFYuanqing Feng

Yuanqing Feng

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Yuanqing Feng has a total of 5 co-authors. Here are the top co-authors by number of shared publications:

  • Songfeng Lu

    Huazhong University of Science and Technology

    2 shared publications
  • Tao Bai

    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
  • 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
  • Yongquan Cui

    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

    1 shared publication

Latest Publications

  • Practical and Robust Privacy-Preserving K-Means Clustering Protocols With GPU Acceleration

    by Tao Bai, Yuanqing Feng, Zhi Lu, Xueming Tang, Songfeng Lu, Yongquan Cui

    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..

  • FLAT:An Efficient Federated Learning Scheme with Adaptive Topology and Secure Aggregation

    by Yuanqing Feng, Tao Bai, Zhi Lu, Xueming Tang, Songfeng Lu

    Traditional federated learning requires each agent to send its local model to a central server for aggregation. However, directly transmitting the models to the server can raise privacy concerns, as the server may be able to reconstruct the original training data from the gradients of the agent models. To address this privacy issue, researchers have adopted secure aggregation methods for aggregating the global model. However, current secure aggregation schemes primarily use centralized aggregation concepts and masking techniques, which limit the efficiency of federated learning and hinder the further development of secure aggregation. In this paper, we leverage the concept of decentralization to reduce communication and computation overhead at individual nodes in secure aggregation, thereby improving the efficiency of federated learning. Additionally, we design a FedAvg aggregation algorithm based on secure multi-party computation technology and propose a dropout handling mechanism that differs from traditional secure aggregation methods. Through theoretical analysis, we show that the maximum communication complexity at individual nodes is reduced from O(pn) to $O(p √ n)$. Finally, we conduct experiments to evaluate the proposed scheme and compare it with several baselines. The experimental results show that, in a local area network (LAN) environment, the execution speed of our scheme improves by 2.7×-4.3×, and in a wide area network (WAN) environment, the execution speed improves by 3.5×-3.85×.