Joon-Woo Lee

Joon-Woo Lee

Auto-generated profile, based on publicly available information

Joon-Woo Lee

Department of Computer Science and Engineering, Chung-Ang University, Seoul, Republic of Korea

Research Focus & Metrics

Academic Career Length

7Years (2020-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
18 August 2021 in IEEE Transactions on Dependable and Secure Computing
Verified
Journal Article
Closed access
ELEunsang Lee
Eunsang Lee
JLJoon-Woo Lee
Joon-Woo Lee
Jong-Seon NoJong-Seon No
Jong-Seon No
YKYoung-Sik Kim
Young-Sik Kim
The comparison operation for two numbers is one of the most frequently used operations in several applications, including deep learning. As such, lots of research has been conducted with the goal of efficiently evaluating the comparison operation in homomorphic encryption schemes. Recently, Cheon et al. (Asiacrypt 2020) proposed new comparison methods that approximated the sign function on homomorphically encrypted data using composite polynomials and proved that these methods had optimal asymptotic complexity. In this paper, we propose a practically optimal method that approximates the sign function using compositions of minimax approximation polynomials. We prove that this approximation method is optimal with respect to depth consumption and the number of non-scalar multiplications. In addition, we propose a polynomial-time algorithm that determines the optimal composition of minimax approximation polynomials for the proposed homomorphic comparison operation using dynamic programming. The numerical analysis demonstrates that when minimizing runtime, the proposed comparison operation reduces the runtime by approximately 45% on average when compared to the previous algorithm. Likewise, when minimizing depth consumption, the proposed algorithm reduces the runtime by approximately 41% on average. In addition, when high precision in the comparison operation is required, the previous algorithm does not achieve 128-bit security, while the proposed algorithm does due to its small depth consumption.


19 June 2023 in IEEE Access
Verified
Journal Article
Open access
JLJunghyun Lee
Junghyun Lee
ELEunsang Lee
Eunsang Lee
JLJoon-Woo Lee
Joon-Woo Lee
YKYongjune Kim
Yongjune Kim
YKYoung-Sik Kim
Young-Sik Kim
Jong-Seon NoJong-Seon No
Jong-Seon No
Homomorphic encryption (HE) is one of the representative solutions to privacy-preserving machine learning (PPML) classification enabling the server to classify private data of clients while guaranteeing privacy. This work focuses on PPML using word-wise fully homomorphic encryption (FHE). In order to implement deep learning on word-wise HE, the ReLU and max-pooling functions should be approximated by polynomials for homomorphic operations. Most of the previous studies focus on HE-friendly networks, which approximate the ReLU and max-pooling functions using low-degree polynomials. However, this approximation cannot support deeper neural networks due to large approximation errors in general and can classify only relatively small datasets. Thus, we propose a precise polynomial approximation technique, a composition of minimax approximate polynomials of low degrees for the ReLU and max-pooling functions. If we replace the ReLU and max-pooling functions with the proposed approximate polynomials, standard deep learning models such as ResNet and VGGNet can still be used without further modification for PPML on FHE. Even pre-trained parameters can be used without retraining, which makes the proposed method more practical. We approximate the ReLU and max-pooling functions in the ResNet-152 using the composition of minimax approximate polynomials of degrees 15, 27, and 29. Then, we succeed in classifying the plaintext ImageNet dataset with 77.52% accuracy, which is very close to the original model accuracy of 78.31%. Also, we obtain an accuracy of 87.90% for classifying the encrypted CIFAR-10 dataset in the ResNet-20 without any additional training.

2 March 2022 in IEEE Access
Verified
Journal Article
Open access
ELEunsang Lee
Eunsang Lee
JLJoon-Woo Lee
Joon-Woo Lee
YKYoung-Sik Kim
Young-Sik Kim
Jong-Seon NoJong-Seon No
Jong-Seon No
Since the sign function can be used to implement the comparison operation, max function, and rectified linear unit (ReLU) function, several studies have been conducted to efficiently evaluate the sign function in the Cheon-Kim-Kim-Song (CKKS) scheme, one of the most promising fully homomorphic encryption schemes. Recently, Lee et al. (IEEE Trans. Depend. Sec. Comp.) proposed a practically optimal approximation method of sign function on the CKKS scheme using a composition of minimax approximate polynomials. In addition, Lee et al. proposed a polynomial-time algorithm that finds degrees of component polynomials minimizing the number of non-scalar multiplications for homomorphic comparison/max/ReLU functions. However, homomorphic comparison/max/ReLU functions using Lee et al.’s approximation method have not been successfully implemented on the residue number system variant CKKS (RNS-CKKS) scheme. In addition, the degrees of component polynomials found by Lee et al.’s algorithm are not optimized for the RNS-CKKS scheme because the algorithm does not consider that the running time of non-scalar multiplication depends much on the ciphertext level in the RNS-CKKS scheme. In this paper, we propose a fast algorithm for inverse minimax approximation error, a subroutine required to find the optimal set of degrees of component polynomials. This proposed algorithm makes it possible to find the optimal set of degrees of component polynomials with higher degrees than the previous study. In addition, we propose a method to find the degrees of component polynomials optimized for the RNS-CKKS scheme using the proposed algorithm for inverse minimax approximation error. We successfully implement the homomorphic comparison, max function, and ReLU function algorithms on the RNS-CKKS scheme with a low comparison failure rate (< 2.15) and provide the various parameter sets according to the precision parameter α. We reduce the depth consumption of the homomorphic comparison, max function, and ReLU function algorithms by one depth for several α. In addition, the numerical analysis demonstrates that the homomorphic comparison, max function, and ReLU function algorithms using the degrees of component polynomials found by the proposed algorithm reduce running time by 6%, 7%, and 6% on average compared with those using the degrees of component polynomials found by Lee et al.’s algorithm, respectively.

5 August 2020 in IEEE Access
Verified
Journal Article
Open access
YLYongwoo Lee
Yongwoo Lee
JLJoon-Woo Lee
Joon-Woo Lee
YKYoung-Sik Kim
Young-Sik Kim
Jong-Seon NoJong-Seon No
Jong-Seon No
Since Cheon et al. introduced an approximate homomorphic encryption scheme for complex numbers called Cheon-Kim-Kim-Song (CKKS) scheme, it has been widely used and applied in real-life situations, such as privacy-preserving machine learning. The polynomial approximation of a modulus reduction is the most difficult part of the bootstrapping for the CKKS scheme. In this paper, we cast the problem of finding an approximate polynomial for a modulus reduction into an L2-norm minimization problem. As a result, we find an approximate polynomial for the modulus reduction without using the sine function, which is the upper bound for the approximation of the modulus reduction. With the proposed method, we can reduce the degree of the polynomial required for an approximate modulus reduction, while also reducing the error compared with the most recent result reported by Han et al. (CT-RSA’ 20). Consequently, we can achieve a low-error approximation, such that the maximum error is less than 2−40 for the size of the message m/q ≈ 2−10. By using the proposed method, the constraint of q = O(m3/2) is relaxed as O(m), and thus the level loss in bootstrapping can be reduced. The solution to the cast problem is determined in an efficient manner without iteration.

1 January 2025
Verified
Conference Paper
Open access
PDF file
DPDongjin Park
Dongjin Park
ELEunsang Lee
Eunsang Lee
JLJoon-Woo Lee
Joon-Woo Lee
Dongjin Park, Eunsang Lee, Joon-Woo Lee. Proceedings of the 63rd Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers). 2025.