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

Fingerprint

Cryptography
Cloud computing
Sorting
Bandwidth

All Science Journal Classification (ASJC) codes

  • Electrical and Electronic Engineering

Cite this

Ji, J. N., & Shieh, M-D. (2019). Efficient comparison and swap on fully homomorphic encrypted data. In 2019 IEEE International Symposium on Circuits and Systems, ISCAS 2019 - Proceedings [8702297] (Proceedings - IEEE International Symposium on Circuits and Systems; Vol. 2019-May). Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/ISCAS.2019.8702297
Ji, Jyun Neng ; Shieh, Ming-Der. / Efficient comparison and swap on fully homomorphic encrypted data. 2019 IEEE International Symposium on Circuits and Systems, ISCAS 2019 - Proceedings. Institute of Electrical and Electronics Engineers Inc., 2019. (Proceedings - IEEE International Symposium on Circuits and Systems).
@inproceedings{a0da601f7b6b4680a6d60b6b2023ae4a,
title = "Efficient comparison and swap on fully homomorphic encrypted data",
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.",
author = "Ji, {Jyun Neng} and Ming-Der Shieh",
year = "2019",
month = "1",
day = "1",
doi = "10.1109/ISCAS.2019.8702297",
language = "English",
series = "Proceedings - IEEE International Symposium on Circuits and Systems",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
booktitle = "2019 IEEE International Symposium on Circuits and Systems, ISCAS 2019 - Proceedings",
address = "United States",

}

Ji, JN & Shieh, M-D 2019, Efficient comparison and swap on fully homomorphic encrypted data. in 2019 IEEE International Symposium on Circuits and Systems, ISCAS 2019 - Proceedings., 8702297, Proceedings - IEEE International Symposium on Circuits and Systems, vol. 2019-May, Institute of Electrical and Electronics Engineers Inc., 2019 IEEE International Symposium on Circuits and Systems, ISCAS 2019, Sapporo, Japan, 19-05-26. https://doi.org/10.1109/ISCAS.2019.8702297

Efficient comparison and swap on fully homomorphic encrypted data. / Ji, Jyun Neng; Shieh, Ming-Der.

2019 IEEE International Symposium on Circuits and Systems, ISCAS 2019 - Proceedings. Institute of Electrical and Electronics Engineers Inc., 2019. 8702297 (Proceedings - IEEE International Symposium on Circuits and Systems; Vol. 2019-May).

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

TY - GEN

T1 - Efficient comparison and swap on fully homomorphic encrypted data

AU - Ji, Jyun Neng

AU - Shieh, Ming-Der

PY - 2019/1/1

Y1 - 2019/1/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=85066810235&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85066810235&partnerID=8YFLogxK

U2 - 10.1109/ISCAS.2019.8702297

DO - 10.1109/ISCAS.2019.8702297

M3 - Conference contribution

AN - SCOPUS:85066810235

T3 - Proceedings - IEEE International Symposium on Circuits and Systems

BT - 2019 IEEE International Symposium on Circuits and Systems, ISCAS 2019 - Proceedings

PB - Institute of Electrical and Electronics Engineers Inc.

ER -

Ji JN, Shieh M-D. Efficient comparison and swap on fully homomorphic encrypted data. In 2019 IEEE International Symposium on Circuits and Systems, ISCAS 2019 - Proceedings. Institute of Electrical and Electronics Engineers Inc. 2019. 8702297. (Proceedings - IEEE International Symposium on Circuits and Systems). https://doi.org/10.1109/ISCAS.2019.8702297