Metrika članka

  • citati u SCindeksu: 0
  • citati u CrossRef-u:0
  • citati u Google Scholaru:[=>]
  • posete u poslednjih 30 dana:2
  • preuzimanja u poslednjih 30 dana:2
članak: 1 od 1  
Telfor Journal
2018, vol. 10, br. 2, str. 118-122
jezik rada: engleski
vrsta rada: neklasifikovan
doi:10.5937/telfor1802118S


Design of fully homomorphic encryption by prime modular operation
(naslov ne postoji na srpskom)
University of Anbar, College of Computer Science and Information Technology, Department of Computer Science, Anbar, Iraq

e-adresa: sarah.sh1985@gmail.com, ali_makki@uoanbar.edu.iq

Sažetak

(ne postoji na srpskom)
The meaning of cloud computing is the Information Technology (IT) model for computing, which consists of all the IT components (software, hardware, services and, networking) that are needed to enable the delivery and development of cloud services through a private network or the internet. In cloud computing, the client (user) puts his data in the cloud, and any computations on his stored data will be implemented in the cloud. Security is the main thing in cloud computing because a service provider can access, intentionally change or even delete the stored data. To protect data that is stored in the cloud, it is necessary to use an encryption system that can perform computations on the encrypted data. The scheme that allows executing several computations on the encrypted message without decrypting the message is called homomorphic encryption. The implementation of fully homomorphic encryption over the integer (DGHV scheme) and a Simple Fully Homomorphic Encryption Scheme Available in Cloud Computing (SDC Scheme), are slow in execution time because all of them convert the message to a binary format and then encrypt it. Therefore, we propose another scheme called Fully Homomorphic encryption based on a prime modular operation, this scheme encrypts the message character by character by using a prime secret key without converting that character into a binary format. As a result, we compute the time complexity and compare the execution time among the three schemes and analyse the security of the three schemes.

Ključne reči

Cloud Computing; Cryptosystem; Fully Homomorphic Encryption; Information Security

Reference

Abbas, A., i dr. (2017) A survey on homomorphic encryption schemes: Theory and implementation. arXiv preprint arXiv: 1704.03578
Atayero, A., Feyisetan, O. (2011) Security Issues in Cloud Computing: The Potentials of Homomorphic Encryption. Journal of Emerging Trends in Computing and Information Sciences, VOL. 2, NO. 10, October 2011
Benzekki, K., el Abdeslam,, el Abdelbaki (2016) A Secure Cloud Computing Architecture Using Homomorphic Encryption. International Journal of Advanced Computer Science and Applications, 7(2):
Chunsheng, G. (2012) Attack on Fully Homomorphic Encryption over the Integers. International Journal of Information and Network Security (IJINS), 1(4):
Fontaine, C., Galand, F. (2007) A Survey of Homomorphic Encryption for Nonspecialists. EURASIP Journal on Information Security, 2007(1): 013801
Gentry, C. (2009) Fully homomorphic encryption using ideal lattices. u: Proceedings of the 41st annual ACM symposium on Symposium on theory of computing - STOC '09, New York: Association for Computing Machinery (ACM), str. 169
Gentry, C. (2010) Computing arbitrary functions of encrypted data. Communications of the ACM, 53(3): 97
Goldwasser, S., Micali, S. (1984) Probabilistic encryption. Journal of Computer and System Sciences, 28(2): 270-299
Hayes, B. (2012) Alice and Bob in Cipherspace. American Scientist, 100(5): 362
Howgrave-Graham, N. (2001) Approximate Integer Common Divisors. Berlin-Heidelberg: Springer Nature, str. 51-66
Li, J., Song, D., Chen, S., Lu, X. (2012) A simple fully homomorphic encryption scheme available in cloud computing. u: 2012 IEEE 2nd International Conference on Cloud Computing and Intelligence Systems, Institute of Electrical and Electronics Engineers (IEEE), str. 214-217
Paillier, P. (1999) Public-Key Cryptosystems Based on Composite Degree Residuosity Classes. u: Stern, Jacques [ur.] Advances in Cryptology - EUROCRYPT '99, Berlin-Heidelberg: Springer Nature, str. 223-238
Ramaiah, Y. G., Kumari, G.V. (2012) Efficient public key Homomorphic Encryption over integer plaintexts. u: 2012 International Conference on Information Security and Intelligent Control, Institute of Electrical and Electronics Engineers (IEEE), str. 123-128
Rivest, R.L., Shamir, A., Adleman, L. (1978) A method for obtaining digital signatures and public-key cryptosystems. Communications of the ACM, 21(2): 120-126
Rivest, R.L., Adleman, L., Dertouzos, M.L. (1978) On data banks and privacy homomorphisms. Foundations of secure computation, 4.11, 169-180
Smart, N.P., Vercauteren, F. (2010) Fully Homomorphic Encryption with Relatively Small Key and Ciphertext Sizes. Berlin-Heidelberg: Springer Nature, str. 420-443
Stehlé, D., Steinfeld, R. (2010) Faster Fully Homomorphic Encryption. Berlin-Heidelberg: Springer Nature, str. 377-394
Taher, E. (1985) A public key cryptosystem and a signature scheme based on discrete logarithms. u: Advances in cryptology, Berlin Heidelberg: Springer
van Dijk, M., Gentry, C., Halevi, S., Vaikuntanathan, V. (2010) Fully Homomorphic Encryption over the Integers. Berlin-Heidelberg: Springer Nature, str. 24-43
Yang, J., Fan, M., Wang, G., Kong, Z. (2014) Simulation Study Based on Somewhat Homomorphic Encryption. Journal of Computer and Communications, 02(02): 109-111
Yao, A.C. (1982) Protocols for secure computations. u: 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982), Institute of Electrical and Electronics Engineers (IEEE), str. 160-164