Cloud Security u sing Colors and Homomorphic Encryption

Mayur Sunil Patil, Shambhu Kumar Singh


Cloud computing is a parallel and distributed computingsystem consisting of a collection of inter-connected and virtualizedcomputers that are dynamically provisioned and presented as one ormore unified computing which is based on service level agreement.In cloud computing data security and privacy is one of the mostchallenges. So secure delivery of data to and from the cloud ishowever a serious issue that needs to be addressed. This paperdescribes or fulfills the current scenario of cloudcomputing by usingcombination of both colors and Homomorphic encryption techniquesimultaneously.

Full Text:



John Harauz, Lorti M. Kaufinan, Bruce Potter, “Data Security in the World

of Cloud Computing”, IEEE Security & Privacy Co


published by the IEEE

Computer and Reliability Societies, July/August 2009.

Alecsandru Patrascu, Diana Maimu, Emi

l Simion, “New Directions in Cloud

Computing: A Security Perspective”, IEEE 2012.

Vinod Vaikuntanathan, Rajeev Shukla “Computing Blindfolded: New

Developments in Fully Homomorphic Encryption”, International Journal of

Computer Science Research & Techno

logy(IJCSRT), June





Li Han, Ming Yang, Cai


Ling Wang, Shan


Shan Xu, “The

Implementation and Application of Fully Homomorphic Encryption Scheme”,

IEEE 2012.

Nitin Jain, Saibal K. Pal & Dhananjay K. Upadhyay, “Implementation and

Analysis of

Homomorphic Encryption Schemes”, International Journal on

Cryptography and Information Security(IJCIS), Vol.2, No.2, June 2012.

Ms. Parin V. Patel, Mr. Hitesh D. Patel, Prof. Pinal J. Patel, “A Secure Cloud

using Homomorphic Encryption Scheme”, Inter

national Journal of Computer

Science Research & Technology (IJCSRT) Vol. 1 Issue 1, June


Guangli Xiang, Benzhi Yu, Ping Zhu, “An Algorithm of Fully omomorphic

Encryption”, IEEE 2012 9th International Conference on Fuzzy Systems and

Knowledge Disc


Bhabendu Kumar Mohanta, Debasis Gountia,”Fully Homomorphic

Encryption Equating to Cloud Security: An approach”, IOSR Journal of

Computer Engineering (IOSR


JCE) Volume 9, Issue 2 Feb 2013.

Sunanda Ravindram, Parsi Kalpana, “Data Storage Securi

ty Using Partially

Homomorphic Encryption in a Cloud”, International Journal of Advanced

Research in Computer Science and Software Engineering Volume 3, Issue 4,

April 2013.

C. Gentry, ``Fully homomorphic encryption using ideal lattices,'' in


Annu. ACM Symp. Theory Comput. (STOC)

, 2009, pp. 169_178.

M. Van Dijk, C. Gentry, S. Halevi, and V. Vaikuntanathan, ``Fully

homomorphic encryption over the integers,'' in

Advances in



(Lecture Notes in Computer Science). Berlin,

Germany: Springer


Verlag, 2010, pp. 24_43.

D. Stehlé and R. Steinfeld, ``Faster fully homomorphic encryption,'' in

Advances in Cryptology ASIACRYPT

(Lecture Notes in Computer Science).

Berlin, Germany: Springer


Verlag, 2010, pp. 377_394.

N. P. S

mart and F. Vercauteren, ``Fully homomorphic encryption with

relatively small key and ciphertext sizes,'' in

Public Key Cryp



(Lecture Notes in Computer Sciences). Berlin, Germany: Springer


Verlag, 2010, pp.


Z. Brakerski and V. Vaikuntanathan, ``Fully homomorphic encryption from



LWE and security for key dependent messages,'' in


(Lecture Notes

in Computer Science). Berlin, Germany: Springer


Verlag, 2011, pp. 505_524.

Z. Brakerski and V. Vaikun

tanathan, ``Ef_cient fully homomorphic

encryption from (standard) LWE,'' in

Proc. FOCS

, 2011, pp. 1_43.

M. Naehrig, K. Lauter, andV.Vaikuntanathan, ``Can homomorphic

encryption be practical?'' in

Proc. 3rd ACM Workshop Cloud Comput.



, New York, NY, USA, 2011, pp. 113_124.

J. K. Pillai, V. M. Patel, R. Chellappa, and N. K. Ratha, ``Secure and robust

iris recognition using random projections and sparse representations,''


Trans. Pattern Anal. Mach. Intell.

, vol. 33, n

o. 9, pp. 1877_1893, Sep. 2011.

D. Nistér and H. Stewénius, ``Scalable recognition with a vocabulary tree,''


Proc. IEEE Conf. Comput. Vis. Pattern Recognit.

, Jun. 2006, pp.


R. Agrawal, J. Kiernan, R. Srikant, and Y. Xu, ``Order pres


encryption for numeric data,'' in


, 2004, pp. 563_574.

A. Broder, M. Charikar, A. Frieze, and M. Mitzenmacher, ``Min



independent permutations,'' in

Proc. 30th ACM Symp. Theory Comput.

, 1998,

pp. 327_336.

S. Jeong, C. Won,

and R. Gray, ``Image retrieval using color histograms

generated by Gauss mixture vector quantization,''

Comput. Vis. Image


, vol. 94, nos. 1_3, pp. 44_66, 2004.

Wenjun, Avinash L. Varna and Min U. “Confidentiality

Preserving Image


A comprative Study Between Homomorphic Encryption and Distance

Preserving Randomization” Published by IEEE February 20, 2014.


  • There are currently no refbacks.


Copyright © IJETT, International Journal on Emerging Trends in Technology