Cloud Storage Protection Scheme Based on Fully Homomorphic Encryption
Cloud computing allows enterprises and individuals to have a less physical infrastructure of software and hardware. Nevertheless, there are some concerns regarding privacy protection which may turn out to be a strong barrier. Traditional encryption schemes have been used to encrypt the data before s...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Koya University
2020-12-01
|
| Series: | ARO-The Scientific Journal of Koya University |
| Subjects: | |
| Online Access: | https://aro.koyauniversity.org/index.php/aro/article/view/590 |
| _version_ | 1797716556325584896 |
|---|---|
| author | Mohammed A. Mohammed Fadhil S. Abed |
| author_facet | Mohammed A. Mohammed Fadhil S. Abed |
| author_sort | Mohammed A. Mohammed |
| collection | DOAJ |
| description | Cloud computing allows enterprises and individuals to have a less physical infrastructure of software and hardware. Nevertheless, there are some concerns regarding privacy protection which may turn out to be a strong barrier. Traditional encryption schemes have been used to encrypt the data before sending them to the cloud. However, the private key has to be provided to the server before any calculations on the data. To solve this security problem, this paper proposes a fully homomorphic encryption scheme for securing cloud data at rest. The scheme is based on prime modular operation, its security depends on factoring multiple large prime numbers (p1, p2,...pn) up to n, which is formed from very large prime numbers up to hundreds of digits as this is an open problem in mathematics. In addition, the elements of the secret key are derived from a series of mathematical operations and the calculation of an Euler coefficient within the modular of integers. Furthermore, it adds the complexity of noise to the plaintext using the number of users of the Cloud Service Provider. Moreover, its randomness is evaluated by the National Institute of Standards and Technology statistical tests, and the results demonstrating that the best statistical performance was obtained with this algorithm. |
| first_indexed | 2024-03-12T08:23:13Z |
| format | Article |
| id | doaj.art-ec093d5d6a74457eb8fd56e694064ad6 |
| institution | Directory Open Access Journal |
| issn | 2410-9355 2307-549X |
| language | English |
| last_indexed | 2024-03-12T08:23:13Z |
| publishDate | 2020-12-01 |
| publisher | Koya University |
| record_format | Article |
| series | ARO-The Scientific Journal of Koya University |
| spelling | doaj.art-ec093d5d6a74457eb8fd56e694064ad62023-09-02T18:19:17ZengKoya UniversityARO-The Scientific Journal of Koya University2410-93552307-549X2020-12-018210.14500/aro.10590Cloud Storage Protection Scheme Based on Fully Homomorphic EncryptionMohammed A. Mohammed0Fadhil S. Abed1Department of Computer Science, College of Science, University of Sulaimani, Sulaymaniyah, Kurdistan Region – F.R. IraqDepartment of Information Technology, Kalar Technical Institute, Sulaimani Polytechnic University, Khanaqeen, Kurdistan Region – F.R. IraqCloud computing allows enterprises and individuals to have a less physical infrastructure of software and hardware. Nevertheless, there are some concerns regarding privacy protection which may turn out to be a strong barrier. Traditional encryption schemes have been used to encrypt the data before sending them to the cloud. However, the private key has to be provided to the server before any calculations on the data. To solve this security problem, this paper proposes a fully homomorphic encryption scheme for securing cloud data at rest. The scheme is based on prime modular operation, its security depends on factoring multiple large prime numbers (p1, p2,...pn) up to n, which is formed from very large prime numbers up to hundreds of digits as this is an open problem in mathematics. In addition, the elements of the secret key are derived from a series of mathematical operations and the calculation of an Euler coefficient within the modular of integers. Furthermore, it adds the complexity of noise to the plaintext using the number of users of the Cloud Service Provider. Moreover, its randomness is evaluated by the National Institute of Standards and Technology statistical tests, and the results demonstrating that the best statistical performance was obtained with this algorithm.https://aro.koyauniversity.org/index.php/aro/article/view/590Cloud Computing SecurityCryptographyFully Homomorphic EncryptionInformation Security. |
| spellingShingle | Mohammed A. Mohammed Fadhil S. Abed Cloud Storage Protection Scheme Based on Fully Homomorphic Encryption ARO-The Scientific Journal of Koya University Cloud Computing Security Cryptography Fully Homomorphic Encryption Information Security. |
| title | Cloud Storage Protection Scheme Based on Fully Homomorphic Encryption |
| title_full | Cloud Storage Protection Scheme Based on Fully Homomorphic Encryption |
| title_fullStr | Cloud Storage Protection Scheme Based on Fully Homomorphic Encryption |
| title_full_unstemmed | Cloud Storage Protection Scheme Based on Fully Homomorphic Encryption |
| title_short | Cloud Storage Protection Scheme Based on Fully Homomorphic Encryption |
| title_sort | cloud storage protection scheme based on fully homomorphic encryption |
| topic | Cloud Computing Security Cryptography Fully Homomorphic Encryption Information Security. |
| url | https://aro.koyauniversity.org/index.php/aro/article/view/590 |
| work_keys_str_mv | AT mohammedamohammed cloudstorageprotectionschemebasedonfullyhomomorphicencryption AT fadhilsabed cloudstorageprotectionschemebasedonfullyhomomorphicencryption |