loading
Papers

Research.Publish.Connect.

Paper

Authors: Khalil Hariss 1 ; Abed Samhat 2 and Maroun Chamoun 3

Affiliations: 1 Faculty of Engineering - CRSI, Lebanese University, Hadat, Beirut, Lebanon, Faculté D’Ingénierie - CIMTI, Université Saint Joseph, Mar Roukoz, Beirut and Lebanon ; 2 Faculty of Engineering - CRSI, Lebanese University, Hadat, Beirut and Lebanon ; 3 Faculté D’Ingénierie - CIMTI, Université Saint Joseph, Mar Roukoz, Beirut and Lebanon

ISBN: 978-989-758-378-0

Keyword(s): Cloud Computing, Cloud Privacy, Fully Homomorphic Encryption, Domingo Ferrer, Learning with Error, Key Switching, Circuit Evaluation, Storage Overhead, Known Plain-text Attack, Polynomial Resultant.

Related Ontology Subjects/Areas/Topics: Information and Systems Security ; Security and Privacy in the Cloud

Abstract: In this paper, we consider the privacy issue in cloud systems by using Homomorphic Encryption (HE) to provide secure computing at the cloud side. We use Domingo Ferrer (DF) homomorphic scheme to accomplish this task. Before implementing DF in a cloud scenario, we resolve its main problems. The two concerned problems are sensitivity to known plain-text attack and cipher-text dimension growth after homomorphic multiplication causing high storage overhead and reducing the scheme efficiency. DF is first made secure for cloud systems by making the scheme much more resistant to the concerned attack due to the change of the encryption procedure. Second, DF is made efficient for cloud computing by introducing a new technique, called Key Switching (KS). This technique reduces the high overhead by decreasing the extended cipher-text dimension obtained after a homomorphic multiplication and preserving the homomorphic behavior. While users’ privacy at the Cloud side is preserved with HE, KS techn ique relies on publishing a matrix M. Different secret keys are encrypted within M based on the hardness of Learning With Error (LWE). A deep crypt-analysis and implementations under Python using SageMath Library are done in order to validate the efficiency of our proposal. (More)

PDF ImageFull Text

Download
CC BY-NC-ND 4.0

Sign In Guest: Register as new SciTePress user now for free.

Sign In SciTePress user: please login.

PDF ImageMy Papers

You are not signed in, therefore limits apply to your IP address 18.208.186.19

In the current month:
Recent papers: 100 available of 100 total
2+ years older papers: 200 available of 200 total

Paper citation in several formats:
Hariss, K.; Samhat, A. and Chamoun, M. (2019). An Efficient FHE Scheme to Secure Cloud Computing.In Proceedings of the 16th International Joint Conference on e-Business and Telecommunications - Volume 2: SECRYPT, ISBN 978-989-758-378-0, pages 341-349. DOI: 10.5220/0007788803410349

@conference{secrypt19,
author={Khalil Hariss. and Abed Ellatif Samhat. and Maroun Chamoun.},
title={An Efficient FHE Scheme to Secure Cloud Computing},
booktitle={Proceedings of the 16th International Joint Conference on e-Business and Telecommunications - Volume 2: SECRYPT,},
year={2019},
pages={341-349},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0007788803410349},
isbn={978-989-758-378-0},
}

TY - CONF

JO - Proceedings of the 16th International Joint Conference on e-Business and Telecommunications - Volume 2: SECRYPT,
TI - An Efficient FHE Scheme to Secure Cloud Computing
SN - 978-989-758-378-0
AU - Hariss, K.
AU - Samhat, A.
AU - Chamoun, M.
PY - 2019
SP - 341
EP - 349
DO - 10.5220/0007788803410349

Login or register to post comments.

Comments on this Paper: Be the first to review this paper.