Chan Fook Mun

Chan Fook Mun

Auto-generated profile, based on publicly available information

Chan Fook Mun

Institute of Infocomm Research, Agency of Science, Technology and Research (A*STAR), Singapore

Research Focus & Metrics

Academic Career Length

8Years (2019-Present)

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

Representative Publications

View All Publications
6 August 2020 in IEEE Transactions on Emerging Topics in Computing
Verified
Journal Article
Closed access
ABAhmad Qaisar Al Badawi
Ahmad Qaisar Al Badawi
CJChao Jin
Chao Jin
JLJie Lin
Jie Lin
CMChan Fook Mun
Chan Fook Mun
SJSim Jun Jie
Sim Jun Jie
AQAhmad QaisarAhmadAlBadawi
Ahmad QaisarAhmadAlBadawi
Machine/Deep Learning as a Service (M/DLaaS) stands as a promising solution for cloud-based inference applications. In this setting, the cloud has a pre-learned model whereas the user has samples on which she wants to run the model. The biggest concern with M/DLaaS is the user privacy if the input samples are sensitive data. We provide here an efficient privacy-preserving system by employing high-end technologies such as Fully Homomorphic Encryption (FHE), Convolutional Neural Networks (CNNs) and Graphics Processing Units (GPUs). FHE, with its widely-known feature of computing on encrypted data, empowers a wide range of privacy-concerned applications. This comes at high cost as it requires enormous computing power. In this paper, we show how to accelerate the performance of running CNNs on encrypted data with GPUs. We evaluated two CNNs to classify homomorphically the MNIST and CIFAR-10 datasets. Our solution achieved sufficient security level (> 80 bit) and reasonable classification accuracy (99%) and (77.55%) for MNIST and CIFAR-10, respectively. In terms of latency, we could classify an image in 5.16 seconds and 304.43 seconds for MNIST and CIFAR-10, respectively. Our system can also classify a batch of images (> 8,000) without extra overhead.

17 December 2020 in IEEE Access
Verified
Journal Article
Open access
ABAhmad Qaisar Al Badawi
Ahmad Qaisar Al Badawi
LHLouie Hoang
Louie Hoang
CMChan Fook Mun
Chan Fook Mun
KLKim Laine
Kim Laine
KAKhin Mi Mi Aung
Khin Mi Mi Aung
We present an efficient and non-interactive method for Text Classification while preserving the privacy of the content using Fully Homomorphic Encryption (FHE). Our solution (named Priv ate F ast T ext (PrivFT)) provides two services: 1) making inference of encrypted user inputs using a plaintext model and 2) training an effective model using an encrypted dataset. For inference, we use a pre-trained plaintext model and outline a system for homomorphic inference on encrypted user inputs with zero loss to prediction accuracy compared to the non-encrypted version. In the second part, we show how to train a supervised model using fully encrypted data to generate an encrypted model. For improved performance, we provide a GPU implementation of the Cheon-Kim-Kim-Song (CKKS) FHE scheme that shows 1 to 2 orders of magnitude speedup against existing implementations. We build PrivFT on top of our FHE engine in GPUs to achieve a run time per inference of 0.17 seconds for various Natural Language Processing (NLP) public datasets. Training on a relatively large encrypted dataset is more computationally intensive requiring 5.04 days.

21 June 2021 in IEEE Transactions on Information Forensics and Security
Verified
Journal Article
Closed access
SMSouhail Meftah
Souhail Meftah
BTBenjamin Hong Meng Tan
Benjamin Hong Meng Tan
CMChan Fook Mun
Chan Fook Mun
KAKhin Mi Mi Aung
Khin Mi Mi Aung
BVBharadwaj Veeravalli
Bharadwaj Veeravalli
VCVijay Chandrasekhar
Vijay Chandrasekhar
Fully homomorphic encryption (FHE) is a powerful cryptographic primitive to secure outsourced computations against an untrusted third-party provider. With the growing demand for AI and the usefulness of machine learning as a service (MLaaS), the need for secure training and inference of artificial neural networks is rising. However, the computational complexity of existing FHE schemes has been a strong deterrent to this. Prior works suffered from accuracy degradation, lack of scalability, and ciphertext expansion issues. In this paper, we take the first step towards the problem of space-efficiency in evaluating deep neural networks through designing DOReN: a low depth, batched neuron that can simultaneously evaluate multiple quantized ReLU-activated neurons on encrypted data without approximations. Our circuit design reduced the complexity of the accumulator circuit depth from O(logm ·logn) to O(logm + logn) for n bit integers. The experimental results show that the amortized processing time of our homomorphic neuron is approximately 1.26 seconds for 300 inputs and less than 0.13 seconds for 10 inputs at 80 bit security, which is a 20 fold improvement upon Lou and Jiang, NeurIPS 2019.

21 July 2020 in BMC Medical Genomics
Verified
Journal Article
Open access
PDF file
JSJun Jie Sim
Jun Jie Sim
FCFook Mun Chan
Fook Mun Chan
SCShibin Chen
Shibin Chen
BTBenjamin Hong Meng Tan
Benjamin Hong Meng Tan
KAKhin Mi Mi Aung
Khin Mi Mi Aung
One way of investigating how genes affect human traits would be with a genome-wide association study (GWAS). Genetic markers, known as single-nucleotide polymorphism (SNP), are used in GWAS. This raises privacy and security concerns as these genetic markers can be used to identify individuals uniquely. This problem is further exacerbated by a large number of SNPs needed, which produce reliable results at a higher risk of compromising the privacy of participants. We describe a method using homomorphic encryption (HE) to perform GWAS in a secure and private setting. This work is based on a proposed algorithm. Our solution mainly involves homomorphically encrypted matrix operations and suitable approximations that adapts the semi-parallel GWAS algorithm for HE. We leverage upon the complex space of the CKKS encryption scheme to increase the number of SNPs that can be packed within a ciphertext. We have also developed a cache module that manages ciphertexts, reducing the memory footprint. We have implemented our solution over two HE open source libraries, HEAAN and SEAL. Our best implementation took 24.70 minutes for a dataset with 245 samples, over 4 covariates and 10643 SNPs. We demonstrate that it is possible to achieve GWAS with homomorphic encryption with suitable approximations.

18 November 2019 in arXiv
Verified
Preprint
Open access
PDF file
ABAhmad Qaisar Al Badawi
Ahmad Qaisar Al Badawi
LHLuong Hoang
Luong Hoang
CMChan Fook Mun
Chan Fook Mun
KLKim Laine
Kim Laine
KAKhin Mi Mi Aung
Khin Mi Mi Aung
The need for privacy-preserving analytics is higher than ever due to the severity of privacy risks and to comply with new privacy regulations leading to an amplified interest in privacy-preserving techniques that try to balance between privacy and utility. In this work, we present an efficient method for Text Classification while preserving the privacy of the content using Fully Homomorphic Encryption (FHE). Our system (named \textbf{Priv}ate \textbf{F}ast \textbf{T}ext (PrivFT)) performs two tasks: 1) making inference of encrypted user inputs using a plaintext model and 2) training an effective model using an encrypted dataset. For inference, we train a supervised model and outline a system for homomorphic inference on encrypted user inputs with zero loss to prediction accuracy. In the second part, we show how to train a model using fully encrypted data to generate an encrypted model. We provide a GPU implementation of the Cheon-Kim-Kim-Song (CKKS) FHE scheme and compare it with existing CPU implementations to achieve 1 to 2 orders of magnitude speedup at various parameter settings. We implement PrivFT in GPUs to achieve a run time per inference of less than 0.66 seconds. Training on a relatively large encrypted dataset is more computationally intensive requiring 5.04 days.