##plugins.themes.academic_pro.article.main##

Abstract

This paper describes to improve the security in cloud system when end-user communicates with the cloud server. In order to make a connection between end-user and the Cloud Server, first end-user or Cloud Server make sure that they are communicating with right counterpart. Multi-Key encryption concept is used to encrypt the request message or data which is sent from end-user or also from Cloud Server. Request message sent by end-user to cloud server should matches with the response received from by end-user from cloud server. Multi-key concept takes more number of iteration when compared to single-key concept when trying to validate the requested message. Multi-Key concept is more secured than single-key.

##plugins.themes.academic_pro.article.details##

How to Cite
Thangarajan, A., & P, B. (2014). SECURING THE CLOUD COMPUTING SYSTEMS WITH MULTI-KEYS USING HOMOMORPHIC ENCRYPTION METHOD. International Journal of Emerging Trends in Science and Technology, 1(02). Retrieved from https://igmpublication.org/ijetst.in/index.php/ijetst/article/view/22

References

[1] Harnessing the Cloud for Securely Outsourcing Large-Scale Systems of Linear Equations, Cong Wang, Member, IEEE, Kui Ren, Senior Member, IEEE, Jia Wang, Member, IEEE, and Qian Wang, Member, IEEE - 2013
[2] C. Gentry, “Computing Arbitrary Functions of Encrypted Data,” Comm. ACM, vol. 53, no. 3, pp. 97-105, 2010.
[3] K. Forsman, W. Gropp, L. Kettunen, D. Levine, and J. Salonen, “Solution of Dense Systems of Linear Equations Arising from Integral-Equation Formulations,” IEEE Antennas and Propagation Magazine, vol. 37, no. 6, pp. 96-100, Dec. 1995.
[4] A. Edelman, “Large Dense Numerical Linear Algebra in 1993: The Parallel Computing Influence,” Int’l J. High Performance Computing Applications, vol. 7, no. 2, pp. 113-128, 1993.
[5] B. Carpentieri, “Sparse Preconditioners for Dense Linear Systems from Electromagnetic Applications,” PhD dissertation, CERFACS, Toulouse, France, 2002.
[6] R. Cramer and I. Damga°rd, “Secure Distributed Linear Algebra in a Constant Number of Rounds,” CRYPTO: Proc. Ann. Int’l Cryptology Conf. Advances in Cryptology, 2001.
[7] P. Mohassel and E. Weinreb, “Efficient Secure Linear Algebra in the Presence of Covert or Computationally Unbounded Adversaries,” CRYPTO: Proc. 28th Ann. Int’l Cryptology Conf., pp. 481-496, 2008.
[8] J.R. Troncoso-Pastoriza, P. Comesan˜ a, and F. Pe´rez-Gonza´lez, “Secure Direct and Iterative Protocols for Solving Systems of Linear Equations,” Proc. First Int’l Workshop Signal Processing in the EncryptEd Domain (SPEED), pp. 122-141, 2009.
[9] W. Du and M.J. Atallah, “Privacy-Preserving Cooperative Scientific Computations,” Proc. IEEE 14th Computer Security Foundations Workshop (CSFW), pp. 273-294, 2001