Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Mingxin Xu

dblp:115/6830 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
2since 2021 · last 2023
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Security and privacy · 1 · 1 since 2021Applied, interdisciplinary, general and emerging computing · 1 · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Network and information security
1 paper
Privacy and data protection · 60% Cryptographic protocols and secure computation · 20% Security and privacy of machine learning · 20%
Artificial intelligence
1 paper
Efficient and distributed learning · 100%

Topics — the 6 heaviest of 6, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Privacy and data protection › differential privacy › differentially private learning
differentially private training
0.712023
Private, Efficient, and Accurate: Protecting Models Trained by Multi-party Learning with Differential Privacy · SP 2023
Privacy and data protection
differential privacy
0.712023
Private, Efficient, and Accurate: Protecting Models Trained by Multi-party Learning with Differential Privacy · SP 2023
Privacy and data protection › differential privacy › differentially private deep learning
DP-SGD
0.712023
Private, Efficient, and Accurate: Protecting Models Trained by Multi-party Learning with Differential Privacy · SP 2023
Security and privacy of machine learning
multi-party learning
0.712023
Private, Efficient, and Accurate: Protecting Models Trained by Multi-party Learning with Differential Privacy · SP 2023
Cryptographic protocols and secure computation
secure multiparty computation
0.712023
Private, Efficient, and Accurate: Protecting Models Trained by Multi-party Learning with Differential Privacy · SP 2023
Machine learning › Efficient and distributed learning
distributed training
0.212023
Private, Efficient, and Accurate: Protecting Models Trained by Multi-party Learning with Differential Privacy · SP 2023

Methods — techniques the papers use, named apart from their topics

stochastic gradient descent · 1.3model initialization · 1.3feature extraction · 1.3differential privacy · 1.3secure multiparty computation · 0.7secure multi-party computation · 0.7
YearPublicationVenuePosition
2023 Private, Efficient, and Accurate: Protecting Models Trained by Multi-party Learning with Differential Privacy
abstract
Secure multi-party computation-based machine learning, referred to as multi-party learning (MPL for short), has become an important technology to utilize data from multiple parties with privacy preservation. While MPL provides rigorous security guarantees for the computation process, the models trained by MPL are still vulnerable to attacks that solely depend on access to the models. Differential privacy could help to defend against such attacks. However, the accuracy loss brought by differential privacy and the huge communication overhead of secure multi-party computation protocols make it highly challenging to balance the 3-way trade-off between privacy, efficiency, and accuracy.In this paper, we are motivated to resolve the above issue by proposing a solution, referred to as PEA (Private, Efficient, Accurate), which consists of a secure differentially private stochastic gradient descent (DPSGD for short) protocol and two optimization methods. First, we propose a secure DPSGD protocol to enforce DPSGD, which is a popular differentially private machine learning algorithm, in secret sharing-based MPL frameworks. Second, to reduce the accuracy loss led by differential privacy noise and the huge communication overhead of MPL, we propose two optimization methods for the training process of MPL: (1) the data-independent feature extraction method, which aims to simplify the trained model structure; (2) the local data-based global model initialization method, which aims to speed up the convergence of the model training. We implement PEA in two open-source MPL frameworks: TF-Encrypted and Queqiao. The experimental results on various datasets demonstrate the efficiency and effectiveness of PEA. E.g. when ϵ = 2, we can train a differentially private classification model with an accuracy of 88% for CIFAR-10 within 7 minutes under the LAN setting. This result significantly outperforms the one from CryptGPU, one state-of-the-art MPL framework: it costs more than 16 hours to train a non-private deep neural network model on CIFAR-10 with the same accuracy.
Wenqiang Ruan, Mingxin Xu, Wenjing Fang, Li Wang 0056, Lei Wang 0152, Weili Han
SP2
2023 Towards Understanding the fairness of differentially private margin classifiers
Wenqiang Ruan, Mingxin Xu, Yinan Jing, Weili Han
World Wide Web (WWW)2