Privacy-Preserving Rule Induction Using CKKS

Rule-based learning involves using specific rules to categorize or identify datasets. This study introduces a new approach called homomorphic encryption-based rule induction (HORI) algorithm, designed specifically for scenarios where data confidentiality is critical. This method is constructed using...

Full description

Bibliographic Details
Published in:IEEE Access
Main Authors: Jihyeon Choi, Jina Choi, Younho Lee, Jung-Sik Hong
Format: Article
Language:English
Published: IEEE 2024-01-01
Subjects:
Online Access:https://ieeexplore.ieee.org/document/10753279/
_version_ 1849528510163451904
author Jihyeon Choi
Jina Choi
Younho Lee
Jung-Sik Hong
author_facet Jihyeon Choi
Jina Choi
Younho Lee
Jung-Sik Hong
author_sort Jihyeon Choi
collection DOAJ
container_title IEEE Access
description Rule-based learning involves using specific rules to categorize or identify datasets. This study introduces a new approach called homomorphic encryption-based rule induction (HORI) algorithm, designed specifically for scenarios where data confidentiality is critical. This method is constructed using CKKS homomorphic encryption to make it work with encrypted data, thereby enhancing the privacy of both training data and the input for inference. To overcome the inefficiency caused by utilizing homomorphic encryption, we utilize the modified Gini impurity index (MGI) (Bădulescu, 2020) for training, simplify training with a single variable, and speed up inference by combining all relevant rules into a single ciphertext. Comparative analysis shows that the training algorithm of this method is, on average, 1,019 times slower, and the inference algorithm is approximately 935 times slower than their counterparts working with plaintext data. However, these performance metrics are still considered efficient compared to traditional algorithms based on homomorphic encryption, which often have latency factors ranging from 2,000 to 10,000 times. Additionally, when compared to recent work by Zorapaci and Ayşe Özel (2021) incorporating differential privacy, the proposed method demonstrates a superior accuracy improvement of over 10%.
format Article
id doaj-art-738ce0dca4684b63bfefb7ebbccfec90
institution Directory of Open Access Journals
issn 2169-3536
language English
publishDate 2024-01-01
publisher IEEE
record_format Article
spelling doaj-art-738ce0dca4684b63bfefb7ebbccfec902025-08-20T02:49:22ZengIEEEIEEE Access2169-35362024-01-011217154017155810.1109/ACCESS.2024.349804010753279Privacy-Preserving Rule Induction Using CKKSJihyeon Choi0https://orcid.org/0009-0009-8650-830XJina Choi1https://orcid.org/0009-0004-1851-5712Younho Lee2https://orcid.org/0000-0003-1767-6165Jung-Sik Hong3https://orcid.org/0000-0001-5579-0968Department of Data Science, Seoul National University of Science and Technology, Seoul, South KoreaDepartment of Data Science, Seoul National University of Science and Technology, Seoul, South KoreaDepartment of Data Science, Seoul National University of Science and Technology, Seoul, South KoreaDepartment of Data Science, Seoul National University of Science and Technology, Seoul, South KoreaRule-based learning involves using specific rules to categorize or identify datasets. This study introduces a new approach called homomorphic encryption-based rule induction (HORI) algorithm, designed specifically for scenarios where data confidentiality is critical. This method is constructed using CKKS homomorphic encryption to make it work with encrypted data, thereby enhancing the privacy of both training data and the input for inference. To overcome the inefficiency caused by utilizing homomorphic encryption, we utilize the modified Gini impurity index (MGI) (Bădulescu, 2020) for training, simplify training with a single variable, and speed up inference by combining all relevant rules into a single ciphertext. Comparative analysis shows that the training algorithm of this method is, on average, 1,019 times slower, and the inference algorithm is approximately 935 times slower than their counterparts working with plaintext data. However, these performance metrics are still considered efficient compared to traditional algorithms based on homomorphic encryption, which often have latency factors ranging from 2,000 to 10,000 times. Additionally, when compared to recent work by Zorapaci and Ayşe Özel (2021) incorporating differential privacy, the proposed method demonstrates a superior accuracy improvement of over 10%.https://ieeexplore.ieee.org/document/10753279/Rule inductionfully homomorphic encryptionCKKSprivacy-preserving machine learning
spellingShingle Jihyeon Choi
Jina Choi
Younho Lee
Jung-Sik Hong
Privacy-Preserving Rule Induction Using CKKS
Rule induction
fully homomorphic encryption
CKKS
privacy-preserving machine learning
title Privacy-Preserving Rule Induction Using CKKS
title_full Privacy-Preserving Rule Induction Using CKKS
title_fullStr Privacy-Preserving Rule Induction Using CKKS
title_full_unstemmed Privacy-Preserving Rule Induction Using CKKS
title_short Privacy-Preserving Rule Induction Using CKKS
title_sort privacy preserving rule induction using ckks
topic Rule induction
fully homomorphic encryption
CKKS
privacy-preserving machine learning
url https://ieeexplore.ieee.org/document/10753279/
work_keys_str_mv AT jihyeonchoi privacypreservingruleinductionusingckks
AT jinachoi privacypreservingruleinductionusingckks
AT younholee privacypreservingruleinductionusingckks
AT jungsikhong privacypreservingruleinductionusingckks