Efficient and Privacy-Preserving Feature Selection Based on Multiparty Computation

Feature selection is a critical data preprocessing stage that has been proven beneficial in data mining and machine learning applications. As most current works focus on privacy during the training and inference tasks in machine learning, implementing privacy preservation in preprocessing is a powerful complement. In this paper, we present an <underline xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">e</u>fficient and <underline xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">p</u>rivacy-preserving <underline xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">f</u>eature <underline xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">s</u>election protocol (EPFS) based on secure multiparty computation (MPC). We customize a novel method called approximate fixed-point representation to reduce the bitwidth of the sample distribution probability, thereby decreasing communication overhead. We optimize the comparison protocol by reducing the high-order bits of values according to the characteristics of the datasets and design the feature score calculation protocol together with several other MPC-based sub-protocols. We also construct an efficient feature selection workflow to obtain the reduced feature matrix, which avoids the numerous calls of secure comparison and equality test protocols in loops. Experiments on several real-world datasets show that the improved comparison protocol achieves a 29%-53% improvement in runtime and a 6%-32% reduction in communication compared to the general comparison protocol. The optimized feature selection workflow exhibits an upper performance bound, achieving a 38% improvement in runtime compared to prior work. Besides, we implement secure logistic regression training based on the selection features, where the accuracy has improved by an average of 8% compared to training on raw features.

Authors

Institutions

Publication Details

Journal
IEEE Transactions on Information Forensics and Security
Published
2025-01-01
DOI
https://doi.org/10.1109/tifs.2025.3546843
Citations
5
Primary Topic
Privacy-Preserving Technologies in Data
Type
article
Field-Weighted Citation Impact
12.40

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Efficient and Privacy-Preserving Feature Selection Based on Multiparty Computation

Luyao Wang, Lu Zhou, Weibin Wu, Hao Guo
5 citations
IEEE Transactions on Information Forensics and Security
Privacy-Preserving Technologies in Data
12.40
article

Efficient and Privacy-Preserving Feature Selection Based on Multiparty Computation

Luyao Wang, Lu Zhou, Weibin Wu, Hao Guo
article en
5 citations

Abstract

Feature selection is a critical data preprocessing stage that has been proven beneficial in data mining and machine learning applications. As most current works focus on privacy during the training and inference tasks in machine learning, implementing privacy preservation in preprocessing is a powerful complement. In this paper, we present an <underline xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">e</u>fficient and <underline xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">p</u>rivacy-preserving <underline xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">f</u>eature <underline xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">s</u>election protocol (EPFS) based on secure multiparty computation (MPC). We customize a novel method called approximate fixed-point representation to reduce the bitwidth of the sample distribution probability, thereby decreasing communication overhead. We optimize the comparison protocol by reducing the high-order bits of values according to the characteristics of the datasets and design the feature score calculation protocol together with several other MPC-based sub-protocols. We also construct an efficient feature selection workflow to obtain the reduced feature matrix, which avoids the numerous calls of secure comparison and equality test protocols in loops. Experiments on several real-world datasets show that the improved comparison protocol achieves a 29%-53% improvement in runtime and a 6%-32% reduction in communication compared to the general comparison protocol. The optimized feature selection workflow exhibits an upper performance bound, achieving a 38% improvement in runtime compared to prior work. Besides, we implement secure logistic regression training based on the selection features, where the accuracy has improved by an average of 8% compared to training on raw features.

IEEE Transactions on Information Forensics and SecurityVol. 20
Zhejiang Lab (CN), Nanjing University of Aeronautics and Astronautics (CN)
National Natural Science Foundation of China, Natural Science Foundation of Jiangsu Province, National Key Research and Development Program of China
Openalex Percentile: Top 2%
Privacy-Preserving Technologies in Data
12.40
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.