{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,8]],"date-time":"2026-01-08T06:41:17Z","timestamp":1767854477874,"version":"3.49.0"},"reference-count":46,"publisher":"MDPI AG","issue":"7","license":[{"start":{"date-parts":[[2022,6,30]],"date-time":"2022-06-30T00:00:00Z","timestamp":1656547200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100001691","name":"JSPS KAKENHI","doi-asserted-by":"publisher","award":["21H05052"],"award-info":[{"award-number":["21H05052"]}],"id":[{"id":"10.13039\/501100001691","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001691","name":"JSPS KAKENHI","doi-asserted-by":"publisher","award":["18H04098"],"award-info":[{"award-number":["18H04098"]}],"id":[{"id":"10.13039\/501100001691","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithms"],"abstract":"<jats:p>For the feature selection problem, we propose an efficient privacy-preserving algorithm. Let D, F, and C be data, feature, and class sets, respectively, where the feature value x(Fi) and the class label x(C) are given for each x\u2208D and Fi\u2208F. For a triple (D,F,C), the feature selection problem is to find a consistent and minimal subset F\u2032\u2286F, where \u2018consistent\u2019 means that, for any x,y\u2208D, x(C)=y(C) if x(Fi)=y(Fi) for Fi\u2208F\u2032, and \u2018minimal\u2019 means that any proper subset of F\u2032 is no longer consistent. On distributed datasets, we consider feature selection as a privacy-preserving problem: assume that semi-honest parties A and B have their own personal DA and DB. The goal is to solve the feature selection problem for DA\u222aDB without sacrificing their privacy. In this paper, we propose a secure and efficient algorithm based on fully homomorphic encryption, and we implement our algorithm to show its effectiveness for various practical data. The proposed algorithm is the first one that can directly simulate the CWC (Combination of Weakest Components) algorithm on ciphertext, which is one of the best performers for the feature selection problem on the plaintext.<\/jats:p>","DOI":"10.3390\/a15070229","type":"journal-article","created":{"date-parts":[[2022,6,30]],"date-time":"2022-06-30T20:53:02Z","timestamp":1656622382000},"page":"229","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Privacy-Preserving Feature Selection with Fully Homomorphic Encryption"],"prefix":"10.3390","volume":"15","author":[{"given":"Shinji","family":"Ono","sequence":"first","affiliation":[{"name":"Kyushu Institute of Technology, 680-4 Kawazu, Iizuka-shi 820-8502, Japan"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jun","family":"Takata","sequence":"additional","affiliation":[{"name":"Kyushu Institute of Technology, 680-4 Kawazu, Iizuka-shi 820-8502, Japan"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Masaharu","family":"Kataoka","sequence":"additional","affiliation":[{"name":"Kyushu Institute of Technology, 680-4 Kawazu, Iizuka-shi 820-8502, Japan"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9106-6192","authenticated-orcid":false,"given":"Tomohiro","family":"I","sequence":"additional","affiliation":[{"name":"Kyushu Institute of Technology, 680-4 Kawazu, Iizuka-shi 820-8502, Japan"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0425-8485","authenticated-orcid":false,"given":"Kilho","family":"Shin","sequence":"additional","affiliation":[{"name":"Computer Centre, Gakushuin University, 1-5-1 Mejiro, Toshimaku, Tokyo 171-8588, Japan"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3470-9187","authenticated-orcid":false,"given":"Hiroshi","family":"Sakamoto","sequence":"additional","affiliation":[{"name":"Kyushu Institute of Technology, 680-4 Kawazu, Iizuka-shi 820-8502, Japan"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2022,6,30]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1093\/bioinformatics\/btv563","article-title":"HEALER: Homomorphic computation of ExAct Logistic rEgRession for secure rare disease variants analysis in GWAS","volume":"32","author":"Wang","year":"2015","journal-title":"Bioinformatics"},{"key":"ref_2","doi-asserted-by":"crossref","unstructured":"Liu, F., Ng, W.K., and Zhang, W. (2015, January 20). Encrypted SVM for Outsourced Data Mining. Proceedings of the 2015 IEEE 8th International Conference on Cloud Computing, New York, NY, USA.","DOI":"10.1109\/CLOUD.2015.158"},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"9983463","DOI":"10.1155\/2022\/9983463","article-title":"Privacy-Preserving Outsourcing Scheme for SVM on Vertically Partitioned Data","volume":"2022","author":"Qiu","year":"2022","journal-title":"Secur. Commun. Netw."},{"key":"ref_4","doi-asserted-by":"crossref","unstructured":"Bost, R., Ada Popa, R., Tu, S., and Goldwasser, S. (2015, January 8\u201311). Machine learning classification over encrypted data. Proceedings of the Network and Distributed System Security Symposium, San Diego, CA, USA.","DOI":"10.14722\/ndss.2015.23241"},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"2848","DOI":"10.1109\/TC.2015.2500576","article-title":"SHIELD: Scalable Homomorphic Implementation of Encrypted Data-Classifiers","volume":"65","author":"Khedr","year":"2016","journal-title":"IEEE Trans. Comput."},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"16","DOI":"10.1016\/j.compeleceng.2013.11.024","article-title":"A survey on feature selection methods","volume":"40","author":"Chandrashekar","year":"2014","journal-title":"Comput. Electr. Eng."},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"159","DOI":"10.3390\/info8040159","article-title":"SCWC\/SLCC: Highly scalable feature selection algorithms","volume":"8","author":"Shin","year":"2017","journal-title":"Information"},{"key":"ref_8","unstructured":"Shin, K., and Xu, X.M. (2009, January 28\u201330). Consistency-based feature selection. Proceedings of the 13th International Conference on Knowledge-Based and Intelligent Information and Engineering Systems, Santiago, Chile."},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1016\/0004-3702(94)90084-1","article-title":"Learning boolean concepts in the presence of many irrelevant features","volume":"69","author":"Almuallim","year":"1994","journal-title":"Artif. Intell."},{"key":"ref_10","unstructured":"Liu, H., Motoda, H., and Dash, M. (1998, January 21\u201323). A monotonic measure for optimal feature selection. Proceedings of the 10th European Conference on Machine Learning, Chemnitz, Germany."},{"key":"ref_11","unstructured":"Shin, K., Fernandes, D., and Miyazaki, D. (2011, January 16\u201322). Consistency measures for feature selection: A formal definition, relative sensitivity comparison, and a fast algorithm. Proceedings of the 22nd International Joint Conference on Artificial Intelligence, Barcelona, Spain."},{"key":"ref_12","unstructured":"Zhao, Z., and Liu, H. (2007, January 6\u201312). Searching for interacting features. Proceedings of the 20th International Joint Conference on Artificial Intelligence, Hyderabad, India."},{"key":"ref_13","doi-asserted-by":"crossref","unstructured":"De Cock, M., Dowsley, R., Nascimento, A.C.A., Railsback, D., Shen, J., and Todoki, A. (2021). High performance logistic regression for privacy-preserving genome analysis. BMC Med. Genom., 14.","DOI":"10.1186\/s12920-020-00869-9"},{"key":"ref_14","unstructured":"Breiman, L., Friedman, J., Stone, C., and Olshen, R. (1984). Classification and Regression Trees, Taylor and Francis. [1st ed.]."},{"key":"ref_15","unstructured":"Paillier, P. (1999, January 2\u20136). Public-key cryptosystems based on composite degree residuosity classes. Proceedings of the International Conference on the Theory and Application of Cryptographic Techniques, Prague, Czech Republic."},{"key":"ref_16","doi-asserted-by":"crossref","unstructured":"Attrapadung, N., Hanaoka, G., Mitsunari, S., Sakai, Y., Shimizu, K., and Teruya, T. (2018, January 4). Efficient two-level homomorphic encryption in prime-order bilinear groups and a fast implementation in webassembly. Proceedings of the 2018 on Asia Conference on Computer and Communications Security, Incheon, Korea.","DOI":"10.1145\/3196494.3196552"},{"key":"ref_17","doi-asserted-by":"crossref","unstructured":"Boneh, D., Goh, E.J., and Nissim, K. (2005, January 10\u201312). Evaluating 2-DNF formulas on ciphertexts. Proceedings of the Theory of Cryptography Conference, Cambridge, MA, USA.","DOI":"10.1007\/978-3-540-30576-7_18"},{"key":"ref_18","doi-asserted-by":"crossref","unstructured":"Brakerski, Z., Gentry, C., and Vaikuntanathan, V. (2012, January 8\u201310). (leveled) fully homomorphic encryption without bootstrapping. Proceedings of the 3rd Innovations in Theoretical Computer Science, Cambridge, MA, USA.","DOI":"10.1145\/2090236.2090262"},{"key":"ref_19","unstructured":"Gentry, C. (June, January 31). Fully homomorphic encryption using ideal lattices. Proceedings of the 41st ACM Symposium on Theory of Computing, Bethesda, MD, USA."},{"key":"ref_20","doi-asserted-by":"crossref","first-page":"34","DOI":"10.1007\/s00145-019-09319-x","article-title":"TFHE: Fast fully homomorphic encryptionover the torus","volume":"33","author":"Chillotti","year":"2020","journal-title":"J. Cryptol."},{"key":"ref_21","unstructured":"Chillotti, I., Gama, N., Georgieva, M., and Izabach\u00e8ne, M. (2021, January 28). TFHE: Fast Fully Homomorphic Encryption Library, August 2016. Available online: https:\/\/tfhe.github.io\/tfhe."},{"key":"ref_22","doi-asserted-by":"crossref","unstructured":"Chen, H., Dai, W., Kim, M., and Song, Y. (2019, January 11\u201315). Efficient Multi-Key Homomorphic Encryption with Packed Ciphertexts with Application to Oblivious Neural Network Inference. Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security, London, UK.","DOI":"10.1145\/3319535.3363207"},{"key":"ref_23","doi-asserted-by":"crossref","first-page":"270","DOI":"10.1016\/0022-0000(84)90070-9","article-title":"Probabilistic Encryption","volume":"28","author":"Goldwasser","year":"1984","journal-title":"J. Comput. Syst. Sci."},{"key":"ref_24","doi-asserted-by":"crossref","unstructured":"Fujisaki, E., Okamoto, T., Pointcheval, D., and Stern, J. (2001, January 19\u201323). RSA-OAEP is secure under the RSA assumption. Proceedings of the 21st Annual International Cryptology Conference, Santa Barbara, CA, USA.","DOI":"10.1007\/3-540-44647-8_16"},{"key":"ref_25","unstructured":"Bellare, M., and Rogaway, P. (1994, January 9\u201312). Optimal Asymmetric Encryption. Proceedings of the Workshop on the Theory and Application of Cryptographic Techniques, Perugia, Italy."},{"key":"ref_26","unstructured":"Rao, V., Long, Y., Eldardiry, H., Rane, S., Rossi, R.A., and Torres, F. (2019). Secure two-party feature selection. arXiv."},{"key":"ref_27","unstructured":"Anarakia, J.R., and Samet, S. (2020). Privacy-preserving feature selection: A survey and proposing a new set of protocols. arXiv."},{"key":"ref_28","doi-asserted-by":"crossref","unstructured":"Banerjee, M., and Chakravarty, S. (2011, January 24\u201328). Privacy preserving feature selection for distributed data using virtual dimension. Proceedings of the 20th ACM International Conference on Information and Knowledge Management, Glasgow Scotland, UK.","DOI":"10.1145\/2063576.2063946"},{"key":"ref_29","doi-asserted-by":"crossref","unstructured":"Sheikhalishahi, M., and Martinelli, F. (2017, January 21\u201323). Privacy-utility feature selection as a privacy mechanism in collaborative data classification. Proceedings of the 26th International Conference on Enabling Technologies: Infrastructure for Collaborative Enterprises, Poznan, Poland.","DOI":"10.1109\/WETICE.2017.15"},{"key":"ref_30","unstructured":"Li, X., Dowsley, R., and Cock, M.D. (2021, January 18\u201324). Privacy-preserving feature selection with secure multiparty computation. Proceedings of the 38th International Conference on Machine Learning, Online."},{"key":"ref_31","doi-asserted-by":"crossref","first-page":"167","DOI":"10.2478\/popets-2021-0010","article-title":"Secure training of decision trees with continuous attribute","volume":"2021","author":"Abspoel","year":"2021","journal-title":"Proc. Priv. Enhancing Technol."},{"key":"ref_32","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1016\/S0004-3702(03)00079-1","article-title":"Consistency-based search in feature selection","volume":"151","author":"Dash","year":"2003","journal-title":"Articial Intell."},{"key":"ref_33","doi-asserted-by":"crossref","unstructured":"Pawlak, Z. (1991). Rough Sets, Theoretical Aspects of Reasoning about Data, Kluwer Academic Publishers.","DOI":"10.1007\/978-94-011-3534-4"},{"key":"ref_34","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1007\/s10844-007-0037-0","article-title":"Consistency measures for feature selection","volume":"30","author":"Benitez","year":"2008","journal-title":"J. Intell. Inf. Syst."},{"key":"ref_35","doi-asserted-by":"crossref","unstructured":"Ajtai, M., Szemer\u00e9di, E., and Koml\u00f3s, J. (1983, January 25\u201327). An O(nlogn) sorting network. Proceedings of the 15th Annual ACM Symposium on Theory of Computing, Boston, MA, USA.","DOI":"10.1145\/800061.808726"},{"key":"ref_36","unstructured":"Batcher, K.E. (May, January 30). Sorting networks and their applications. Proceedings of the American Federation of Information Processing Societies Spring Joint Computing Conference, Atlantic City, NJ, USA."},{"key":"ref_37","unstructured":"Hamada, K., Chida, K., Ikarashi, D., and Takahashi, K. (2022, January 26). Oblivious Radix Sort: An Efficient Sorting Algorithm for Practical Secure Multi-party Computation (iacr.org). Available online: https:\/\/eprint.iacr.org\/2014\/121."},{"key":"ref_38","unstructured":"Goodrich, M. (June, January 31). Zig-zag sort: A simple deterministic data-oblivious sorting algorithm running in O(nlogn) time. Proceedings of the 46th Annual ACM Symposium on Theory of Computing, New York, NY, USA."},{"key":"ref_39","doi-asserted-by":"crossref","unstructured":"Ye, X., Li, H., Imakura, A., and Sakurai, T. (2019, January 10\u201316). Distributed collaborative feature selection based on intermediate representation. Proceedings of the 28th International Joint Conference on Artificial Intelligence, Macao, China.","DOI":"10.24963\/ijcai.2019\/575"},{"key":"ref_40","doi-asserted-by":"crossref","unstructured":"Cheon, J.H., Kim, A., Kim, M., and Song, Y. (2017, January 30). Homomorphic encryption for arithmetic of approximate numbers. Proceedings of the International Conference on the Theory and Application of Cryptology and Information Security, Online.","DOI":"10.1007\/978-3-319-70694-8_15"},{"key":"ref_41","doi-asserted-by":"crossref","unstructured":"Matsuoka, K., Hoshizuki, Y., Sato, T., and Bian, S. (2021, January 15). Towards Better Standard Cell Library: Optimizing Compound Logic Gates for TFHE. Proceedings of the 9th on Workshop on Encrypted Computing & Applied Homomorphic Cryptography, New York, NY, USA.","DOI":"10.1145\/3474366.3486927"},{"key":"ref_42","doi-asserted-by":"crossref","first-page":"234","DOI":"10.1016\/j.jbi.2014.04.003","article-title":"Private predictive analysis on encrypted medical data","volume":"50","author":"Bos","year":"2014","journal-title":"J. Biomed. Inform."},{"key":"ref_43","doi-asserted-by":"crossref","unstructured":"Lauter, K., L\u00f3pez-Alt, A., and Naehrig, M. (2014, January 17\u201319). Private Computation on Encrypted Genomic Data. Proceedings of the 3rd International Conference on Cryptology and Information Security in Latin America, Florian\u00f3polis, Brazil.","DOI":"10.1007\/978-3-319-16295-9_1"},{"key":"ref_44","unstructured":"Dowlin, N., Gilad-Bachrach, R., Laine, K., Lauter, K., Naehrig, M., and Wernsing, J. (2016, January 19\u201324). CryptoNets: Applying neural networks to Encrypted data with high throughput and accuracy. Proceedings of the 33rd International Conference on International Conference on Machine Learning, New York, NY, USA."},{"key":"ref_45","doi-asserted-by":"crossref","unstructured":"Bourse, F., Minelli, M., Minihold, M., and Paillier, P. (2018, January 19\u201323). Fast Homomorphic Evaluation of Deep Discretized Neural Networks. Proceedings of the 38th Annual International Cryptology Conference, Santa Barbara, CA, USA.","DOI":"10.1007\/978-3-319-96878-0_17"},{"key":"ref_46","doi-asserted-by":"crossref","first-page":"1330","DOI":"10.1109\/TETC.2020.3014636","article-title":"Towards the AlexNet Moment for Homomorphic Encryption: HCNN, the First Homomorphic CNN on Encrypted Data With GPUs","volume":"9","author":"Badawi","year":"2021","journal-title":"IEEE Trans. Emerg. Top. Comput."}],"container-title":["Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1999-4893\/15\/7\/229\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T23:40:49Z","timestamp":1760139649000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1999-4893\/15\/7\/229"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,6,30]]},"references-count":46,"journal-issue":{"issue":"7","published-online":{"date-parts":[[2022,7]]}},"alternative-id":["a15070229"],"URL":"https:\/\/doi.org\/10.3390\/a15070229","relation":{},"ISSN":["1999-4893"],"issn-type":[{"value":"1999-4893","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,6,30]]}}}