Outsourced Privacy-Preserving Feature Selection Based on Fully Homomorphic Encryption
This addresses privacy concerns for data owners and analysts in distributed or outsourced settings, though it is incremental as it builds on prior two-party algorithms.
The paper tackles the problem of privacy-preserving feature selection in scenarios where data owners and analysts are separate or multiple owners exist, by proposing the first outsourcing algorithm using fully homomorphic encryption, which improves time complexity from O(kn^2) to O(kn log^3 n) and space complexity to O(kn).
Feature selection is a technique that extracts a meaningful subset from a set of features in training data. When the training data is large-scale, appropriate feature selection enables the removal of redundant features, which can improve generalization performance, accelerate the training process, and enhance the interpretability of the model. This study proposes a privacy-preserving computation model for feature selection. Generally, when the data owner and analyst are the same, there is no need to conceal the private information. However, when they are different parties or when multiple owners exist, an appropriate privacy-preserving framework is required. Although various private feature selection algorithms, they all require two or more computing parties and do not guarantee security in environments where no external party can be fully trusted. To address this issue, we propose the first outsourcing algorithm for feature selection using fully homomorphic encryption. Compared to a prior two-party algorithm, our result improves the time and space complexity O(kn^2) to O(kn log^3 n) and O(kn), where k and n denote the number of features and data samples, respectively. We also implemented the proposed algorithm and conducted comparative experiments with the naive one. The experimental result shows the efficiency of our method even with small datasets.