Metrika članka

  • citati u SCindeksu: 0
  • citati u CrossRef-u:0
  • citati u Google Scholaru:[=>]
  • posete u prethodnih 30 dana:11
  • preuzimanja u prethodnih 30 dana:8
č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

Naknadno pridodat članak: provera, normiranje i linkovanje referenci u toku.
Hayes B, Alice, and Bob (2012), Cipherspace, American Scientist, Vol. 100, p. 362.
Yang Jing, Mingyu Wang and Zhiyin Kong (2014), 'Simulation Study Based on Somewhat Homomorphic Encryption', Journal of Computer and Communications, Vol. 2, No. 2, p. 109.
Craig Gentry (2010),' Computing Arbitrary Functions of Encrypted Data', Communications of the ACM, Vol. 53 No. 3, Pages 97-105.
Acar, Abbas, et al. 'A Survey on Homomorphic Encryption Schemes: Theory and Implementation.' arXiv preprint arXiv:1704.03578 (2017).
Rivest, Ronald L., Len Adleman, and Michael L. Dertouzos. 'On data banks and privacy homomorphisms', Foundations of secure computation 4.11 (1978): 169-180.
Rivest, Ronald L., Adi Shamir, and Len Adleman. 'A method for obtaining digital signatures and public-key cryptosystems.' Communications of the ACM 21.2 (1978): 120-126.
A. C. Yao. Protocols for secure computations (extended abstract). In 23rd Annual Symposium on Foundations of Computer Science (FOCS'82), pages 160-164. IEEE, 1982.
Goldwasser, Shafi, and Silvio Micali. 'Probabilistic encryption.' Journal of computer and system sciences 28.2 (1984): 270-299.
ElGamal, Taher. 'A public key cryptosystem and a signature scheme based on discrete logarithms.' Advances in cryptology. Springer Berlin Heidelberg, 1985.
Paillier, Pascal. 'Public-key cryptosystems based on composite degree residuosity classes.' Advances in Cryptology- EUROCRYPT’99. Springer Berlin Heidelberg, 1999.
Fontaine, Caroline, and Fabien Galand. 'A survey of homomorphic encryption for nonspecialists.' EURASIP Journal on Information Security 2007 (2007): 15.
Gentry, Craig. 'Fully homomorphic encryption using ideal lattices.' STOC. Vol. 9. 2009.
Smart, Nigel P., and Frederik Vercauteren. 'Fully homomorphic encryption with relatively small key and ciphertext sizes.' Public Key Cryptography-PKC 2010. Springer Berlin Heidelberg, 2010.420- 443.
Van Dijk, Marten, et al. 'Fully homomorphic encryption over the integers.' Advances in Cryptology-EUROCRYPT 2010. Springer Berlin Heidelberg, 2010. 24-43.
Stehlé, Damien, and Ron Steinfeld. 'Faster fully homomorphic encryption.' Advances in Cryptology-ASIACRYPT 2010. Springer Berlin Heidelberg, 2010. 377-394.
Ramaiah, Y. Govinda, and G. Vijaya Kumari. 'Efficient public key homomorphic encryption over integer plaintexts.' Information Security and Intelligence Control (ISIC), 2012 International Conference on. IEEE, 2012.
Benzekki, Kamal, Abdeslam El Fergougui, and E. A. Elbelrhiti. 'A secure cloud computing architecture using homomorphic encryption.' International Journal of Advanced Computer Science and Applications (IJACSA) 7.2 (2016): 293-298.
C. Gentry, 'A fully homomorphic encryption scheme,' Doctoral dissertation, Stanford University, 2009.
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.
J. Li, D. Song, S. Chen, X. Lu, 'A Simple Fully Homomorphic Encryption Scheme Available in Cloud Computing', In Proceeding of IEEE, (2012).
A. M. Sagheer, 'Elliptic Curves Cryptographic Techniques', 2012 International Conference on. IEEE, 2012. [22] N. Howgrave-Graham, ―Approximate integer common divisors, in CaLC, pp. 51-66. 2001.
Gu Chunsheng, ―Attack on Fully Homomorphic Encryption over the Integers, Cryptology ePrint Archive, Report 2012/157, 2012.