Jong-Seon No

Prof. Jong-Seon No


Research Focus & Metrics

Academic Career Length

24Years (2003-Present)

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

Representative Publications

View All Publications
14 March 2022 in IEEE Access
Verified
Journal Article
Open access
JLJoon-Woo Lee
Joon-Woo Lee
HKHyungchul Kang
Hyungchul Kang
YLYongwoo Lee
Yongwoo Lee
WCWoosuk Choi
Woosuk Choi
JEJieun Eom
Jieun Eom
Jong-Seon NoJong-Seon No
Jong-Seon No
Fully homomorphic encryption (FHE) is a prospective tool for privacy-preserving machine learning (PPML). Several PPML models have been proposed based on various FHE schemes and approaches. Although FHE schemes are suitable as tools for implementing PPML models, previous PPML models based on FHE, such as CryptoNet, SEALion, and CryptoDL, are limited to simple and nonstandard types of machine learning models; they have not proven to be efficient and accurate with more practical and advanced datasets. Previous PPML schemes replaced non-arithmetic activation functions with simple arithmetic functions instead of adopting approximation methods and did not use bootstrapping, which enables continuous homomorphic evaluations. Thus, they could neither use standard activation functions nor employ large numbers of layers. In this work, we first implement the standard ResNet-20 model with the RNS-CKKS FHE with bootstrapping and verify the implemented model with the CIFAR-10 dataset and plaintext model parameters. Instead of replacing the non-arithmetic functions with simple arithmetic functions, we use state-of-the-art approximation methods to evaluate these non-arithmetic functions, such as ReLU and Softmax, with sufficient precision. Further, for the first time, we use the bootstrapping technique of the RNS-CKKS scheme in the proposed model, which enables us to evaluate an arbitrary deep learning model on encrypted data. We numerically verify that the proposed model with the CIFAR-10 dataset shows 98.43% identical results to the original ResNet-20 model with non-encrypted data. The classification accuracy of the proposed model is 92.43%±2.65%, which is quite close to that of the original ResNet-20 CNN model (91.89%). It takes approximately 3 h for inference on a dual Intel Xeon Platinum 8280 CPU (112 cores) with 172 GB of memory. We believe that this opens the possibility of applying FHE to an advanced deep PPML model.

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.

21 November 2017 in IEEE Communications Letters
Verified
Journal Article
Closed access
CKChanki Kim
Chanki Kim
Jong-Seon NoJong-Seon No
Jong-Seon No
New constructions of binary and ternary locally repairable codes (LRCs) using cyclic codes and their concatenation are proposed. The proposed binary LRCs with d = 4 and some r and with d ≥ 5 and some n are shown to be optimal in terms of the upper bounds in [5] and [7]. In addition, the similar method of the binary case is applied to construct the ternary LRCs with good parameters.