Shuai Ma

Shuai Ma

Auto-generated profile, based on publicly available information

Shuai Ma

SKLCCSE Lab, Beihang University, Beijing, China

Research Focus & Metrics

Academic Career Length

16Years (2011-Present)

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

Representative Publications

View All Publications
1 January 2024
Verified
Conference Paper
Open access
PDF file
XXXiaohan Xu
Xiaohan Xu
CTChongyang Tao
Chongyang Tao
TSTao Shen
Tao Shen
CXCan Xu
Can Xu
HXHongbo Xu
Hongbo Xu
SMShuai Ma
Shuai Ma
Xiaohan Xu, Chongyang Tao, Tao Shen, Can Xu, Hongbo Xu, Guodong Long, Jian-Guang Lou, Shuai Ma. Proceedings of the 2024 Conference on Empirical Methods in Natural Language Processing. 2024.

5 January 2024 in IEEE Transactions on Dependable and Secure Computing
Verified
Journal Article
Closed access
RXRunhua Xu
Runhua Xu
BLBo Li
Bo Li
Li ChaoLi Chao
Li Chao
JJJames B. D. Joshi
James B. D. Joshi
SMShuai Ma
Shuai Ma
JDJin Dong
Jin Dong
Federated learning is a computing paradigm that enhances privacy by enabling multiple parties to collaboratively train a machine learning model without revealing personal data. However, current research indicates that traditional federated learning platforms are unable to ensure privacy due to privacy leaks caused by the interchange of gradients. To achieve privacy-preserving federated learning, integrating secure aggregation mechanisms is essential. Unfortunately, existing solutions are vulnerable to recently demonstrated inference attacks such as the disaggregation attack. This paper proposes TAPFed , an approach for achieving privacy-preserving federated learning in the context of multiple decentralized aggregators with malicious actors. TAPFed uses a proposed threshold functional encryption scheme and allows for a certain number of malicious aggregators while maintaining security and privacy. We provide formal security and privacy analyses of TAPFed and compare it to various baselines through experimental evaluation. Our results show that TAPFed offers equivalent performance in terms of model quality compared to state-of-the-art approaches while reducing transmission overhead by 29%-45% across different model training scenarios. Most importantly, TAPFed can defend against recently demonstrated inference attacks caused by curious aggregators, which the majority of existing approaches are susceptible to.

1 January 2024
Verified
Conference Paper
Open access
PDF file
ZLZhen Li
Zhen Li
XXXiaohan Xu
Xiaohan Xu
TSTao Shen
Tao Shen
CXCan Xu
Can Xu
JGJia-Chen Gu
Jia-Chen Gu
SMShuai Ma
Shuai Ma
Zhen Li, Xiaohan Xu, Tao Shen, Can Xu, Jia-Chen Gu, Yuxuan Lai, Chongyang Tao, Shuai Ma. Proceedings of the 2024 Conference on Empirical Methods in Natural Language Processing. 2024.

3 November 2020 in IEEE Transactions on Dependable and Secure Computing
Verified
Journal Article
Closed access
CNChaoyue Niu
Chaoyue Niu
FWFan Wu
Fan Wu
STShaojie Tang
Shaojie Tang
SMShuai Ma
Shuai Ma
GCGuihai Chen
Guihai Chen
The ubiquitous needs for extracting insights from data are driving the emergence of service providers to offer predictions given the inputs from customers. During this process, it is important and highly nontrivial for the service providers to generate proofs of honest predictions without leaking the key parameters of their trained models. In addition, the customers are usually unwilling to reveal their sensitive inputs. In this paper, we proposed MVP, which enables Machine learning prediction in a Verifiable and Privacy preserving fashion. MVP features the properties of polynomial decomposition and prime-order bilinear groups to simultaneously facilitate oblivious evaluation and batch outcome verification while maintaining function privacy and input privacy. We further instantiated MVP with Support Vector Machines (SVMs) and extensively evaluated its performance for the spam detection task on three practical Short Message Service (SMS) datasets. Our analysis and evaluation results reveal that MVP achieves the desired properties while incurring low computation and communication overhead.

27 September 2020 in arXiv
Verified
Preprint
Open access
PDF file
SRShuo Ren
Shuo Ren
DGDaya Guo
Daya Guo
SLShuai Lu
Shuai Lu
LZLong Zhou
Long Zhou
SLShujie Liu
Shujie Liu
SMShuai Ma
Shuai Ma
Evaluation metrics play a vital role in the growth of an area as it defines the standard of distinguishing between good and bad models. In the area of code synthesis, the commonly used evaluation metric is BLEU or perfect accuracy, but they are not suitable enough to evaluate codes, because BLEU is originally designed to evaluate the natural language, neglecting important syntactic and semantic features of codes, and perfect accuracy is too strict thus it underestimates different outputs with the same semantic logic. To remedy this, we introduce a new automatic evaluation metric, dubbed CodeBLEU. It absorbs the strength of BLEU in the n-gram match and further injects code syntax via abstract syntax trees (AST) and code semantics via data-flow. We conduct experiments by evaluating the correlation coefficient between CodeBLEU and quality scores assigned by the programmers on three code synthesis tasks, i.e., text-to-code, code translation, and code refinement. Experimental results show that our proposed CodeBLEU can achieve a better correlation with programmer assigned scores compared with BLEU and accuracy.

17 July 2019 in Proceedings of the AAAI Conference on Artificial Intelligence
Verified
Journal Article
Open access
PDF file
SRShuo Ren
Shuo Ren
ZZZhirui Zhang
Zhirui Zhang
SLShujie Liu
Shujie Liu
MZMing Zhou
Ming Zhou
SMShuai Ma
Shuai Ma
Without real bilingual corpus available, unsupervised Neural Machine Translation (NMT) typically requires pseudo parallel data generated with the back-translation method for the model training. However, due to weak supervision, the pseudo data inevitably contain noises and errors that will be accumulated and reinforced in the subsequent training process, leading to bad translation performance. To address this issue, we introduce phrase based Statistic Machine Translation (SMT) models which are robust to noisy data, as posterior regularizations to guide the training of unsupervised NMT models in the iterative back-translation process. Our method starts from SMT models built with pre-trained language models and word-level translation tables inferred from cross-lingual embeddings. Then SMT and NMT models are optimized jointly and boost each other incrementally in a unified EM framework. In this way, (1) the negative effect caused by errors in the iterative back-translation process can be alleviated timely by SMT filtering noises from its phrase tables; meanwhile, (2) NMT can compensate for the deficiency of fluency inherent in SMT. Experiments conducted on en-fr and en-de translation tasks show that our method outperforms the strong baseline and achieves new state-of-the-art unsupervised machine translation performance.