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

Derun Zhao

dblp:305/0380 · DBLP profile ↗
← Back
3ranked-venue papers
0as first author
3since 2021 · last 2024
—ORCID · none

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

Artificial intelligence and machine learning · 2 · 2 since 2021Systems, architecture and hardware · 1 · 1 since 2021Databases, data management, data science and information retrieval · 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
2 papers
Cryptographic protocols and secure computation · 62% Security and privacy of machine learning · 20% Privacy and data protection · 18%

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

TopicWeightPapersLastEvidence papers
Security and privacy of machine learning
privacy-preserving inference
0.812024
Nimbus: Secure and Efficient Two-Party Inference for Transformers · NeurIPS 2024
Cryptographic protocols and secure computation › secure multiparty computation › secure two-party computation
private transformer inference
0.812024
Nimbus: Secure and Efficient Two-Party Inference for Transformers · NeurIPS 2024
Cryptographic protocols and secure computation › secure arithmetic › secure matrix computation
secure matrix multiplication
0.812024
Nimbus: Secure and Efficient Two-Party Inference for Transformers · NeurIPS 2024
Cryptographic protocols and secure computation › secure multiparty computation
secure two-party computation
0.812024
Nimbus: Secure and Efficient Two-Party Inference for Transformers · NeurIPS 2024
Privacy and data protection
privacy-preserving machine learning
0.712023
SecretFlow-SPU: A Performant and User-Friendly Framework for Privacy-Preserving Machine Learning · USENIX ATC 2023

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

two-party computation · 0.8softmax · 0.8polynomial approximation · 0.8GELU · 0.8
YearPublicationVenuePosition
2024 Nimbus: Secure and Efficient Two-Party Inference for Transformers
abstract
Transformer models have gained significant attention due to their power in machine learning tasks. Their extensive deployment has raised concerns about the potential leakage of sensitive information during inference. However, when being applied to Transformers, existing approaches based on secure two-party computation (2PC) bring about efficiency limitations in two folds: (1) resource-intensive matrix multiplications in linear layers, and (2) complex non-linear activation functions like $\mathsf{GELU}$ and $\mathsf{Softmax}$. This work presents a new two-party inference framework $\mathsf{Nimbus}$ for Transformer models. Specifically, we propose a new 2PC paradigm to securely compute matrix multiplications based on an outer-product insight, which achieves $2.9\times \sim 12.5\times$ performance improvements compared to the state-of-the-art (SOTA) protocol. Furthermore, through a new observation of utilizing the input distribution, we propose an approach of low-degree polynomial approximation for $\mathsf{GELU}$ and $\mathsf{Softmax}$, which improves the performance of the SOTA polynomial approximation by $2.9\times \sim 4.0\times$, where the average accuracy loss of our approach is 0.08\% compared to the non-2PC inference without privacy. Compared with the SOTA two-party inference, $\mathsf{Nimbus}$ improves the end-to-end performance of $BERT_{base}$ inference by $2.7\times \sim 4.7\times$ across different network settings.
Zhengyi Li 0002, Kang Yang 0002, Haoqi Wu, Xiao Wang 0012, Yu Yu 0001, Derun Zhao, Yancheng Zheng, Minyi Guo, Jingwen Leng
NeurIPS8
2023 SecretFlow-SPU: A Performant and User-Friendly Framework for Privacy-Preserving Machine Learning
Junming Ma, Yancheng Zheng, Derun Zhao, Haoqi Wu, Wenjing Fang, Chaofan Yu, Benyu Zhang, Lei Wang 0152
USENIX ATC4
2021 Large-scale Secure XGB for Vertical Federated Learning
abstract
Privacy-preserving machine learning has drawn increasingly attention recently, especially with kinds of privacy regulations come into force. Under such situation, Federated Learning (FL) appears to facilitate privacy-preserving joint modeling among multiple parties. Although many federated algorithms have been extensively studied, there is still a lack of secure and practical gradient tree boosting models (e.g., XGB) in literature. In this paper, we aim to build large-scale secure XGB under vertically federated learning setting. We guarantee data privacy from three aspects. Specifically, (1) we employ secure multi-party computation techniques to avoid leaking intermediate information during training, (2) we store the output model in a distributed manner in order to minimize information release, and (3) we provide a novel algorithm for secure XGB predict with the distributed model. Furthermore, by proposing secure permutation protocols, we can improve the training efficiency and make the framework scale to large dataset. We conduct extensive experiments on both public datasets and real-world datasets, and the results demonstrate that our proposed XGB models provide not only competitive accuracy but also practical performance.
Wenjing Fang, Derun Zhao, Chaochao Chen 0001, Chaofan Yu, Li Wang 0056, Lei Wang 0152, Jun Zhou 0011, Benyu Zhang
CIKM2