Minimizing ESOP Expressions for Fully Homomorphic Encryption

Jheng Hao Ye, Si Quan Chen, Ming-Der Shieh

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

With the rapid growth of cloud computing services, fully homomorphic encryption (FHE) has attracted much attention because a homomorphic evaluation can be directly performed on ciphertexts to ensure data privacy. This work explores the constraints and an associated minimization algorithm for exclusive sum-of-products (ESOP) expressions based on a homomorphism map and features of FHE. An efficient ESOP minimization algorithm based on the Sierpinski gasket and the triangle rule is proposed to reduce the maximum degree of the ESOP expression, thus relaxing the need to perform the recryption operation on ciphertexts. Experimental results show that about 23% of all candidate 4-variable functions can be further improved by the proposed algorithm to minimize the maximum degree of ESOP as compared with the results obtained using the traditional minimization algorithm.

Original languageEnglish
Title of host publication2018 IEEE International Symposium on Circuits and Systems, ISCAS 2018 - Proceedings
PublisherInstitute of Electrical and Electronics Engineers Inc.
ISBN (Electronic)9781538648810
DOIs
Publication statusPublished - 2018 Apr 26
Event2018 IEEE International Symposium on Circuits and Systems, ISCAS 2018 - Florence, Italy
Duration: 2018 May 272018 May 30

Publication series

NameProceedings - IEEE International Symposium on Circuits and Systems
Volume2018-May
ISSN (Print)0271-4310

Other

Other2018 IEEE International Symposium on Circuits and Systems, ISCAS 2018
CountryItaly
CityFlorence
Period18-05-2718-05-30

All Science Journal Classification (ASJC) codes

  • Electrical and Electronic Engineering

Fingerprint Dive into the research topics of 'Minimizing ESOP Expressions for Fully Homomorphic Encryption'. Together they form a unique fingerprint.

Cite this