Outsourced Privacy-Preserving Feature Selection Based on Fully Homomorphic Encryption
Koki Wakiyama, Tomohiro I, Hiroshi Sakamoto

TL;DR
This paper introduces a novel outsourcing algorithm for privacy-preserving feature selection using fully homomorphic encryption, significantly improving efficiency and security in multi-party data environments.
Contribution
It presents the first outsourcing algorithm for feature selection with fully homomorphic encryption, reducing complexity and enabling secure, efficient computation across multiple data owners.
Findings
Improved time complexity from O(kn^2) to O(kn log^3 n)
Reduced space complexity from O(kn^2) to O(kn)
Demonstrated efficiency through experimental validation
Abstract
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…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
MethodsSparse Evolutionary Training · Feature Selection
