Efficient comparison and swap on fully homomorphic encrypted data

Jyun Neng Ji, Ming-Der Shieh

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

Abstract

Fully homomorphic encryption (FHE) allows arbitrary computations to be performed directly on encrypted data for ensuring the security of cloud computing. In contrast to encrypting the plaintext in bit level as done in existing works, this paper explores how to reduce the computation complexity of encrypted data by adopting the concept of aggregate plaintext and proposes an efficient scheme to handle the comparison and swap operation, which is commonly used for sorting and searching in cloud computing. Experimental results reveal that employing the proposed scheme can not only reduce the size of required FHE data, but also improve the total computation time of the chosen operation. For 32-bit data comparison, the proposed one can operate 2.3 times faster and achieve about 52 times reduction in the required FHE data size as well as the transmission bandwidth to the cloud in comparison to the related work.

Original languageEnglish
Title of host publication2019 IEEE International Symposium on Circuits and Systems, ISCAS 2019 - Proceedings
PublisherInstitute of Electrical and Electronics Engineers Inc.
ISBN (Electronic)9781728103976
DOIs
Publication statusPublished - 2019 Jan 1
Event2019 IEEE International Symposium on Circuits and Systems, ISCAS 2019 - Sapporo, Japan
Duration: 2019 May 262019 May 29

Publication series

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

Conference

Conference2019 IEEE International Symposium on Circuits and Systems, ISCAS 2019
CountryJapan
CitySapporo
Period19-05-2619-05-29

All Science Journal Classification (ASJC) codes

  • Electrical and Electronic Engineering

Fingerprint Dive into the research topics of 'Efficient comparison and swap on fully homomorphic encrypted data'. Together they form a unique fingerprint.

Cite this