Provide Privacy of Shared Data and Calculate Performance of Data Management System in Multiple Clouds

International Journal of Computer & Organization Trends  (IJCOT)          
© 2017 by IJCOT Journal
Volume - 8 Issue - 1
Year of Publication : 2018
Authors :  Konna Sirisha , E. Deepthi


Konna Sirisha , E. Deepthi "Provide Privacy of Shared Data and Calculate Performance of Data Management System in Multiple Clouds", International Journal of Computer & organization Trends (IJCOT), V8(1):24-28 January - February  2018, ISSN:2249-2593, Published by Seventh Sense Research Group.

In Computer science, cloud computing describes a type of outsourcing of computer services, similar to the way in which electricity supply is outsourced. Users can simply use it. We do not need to worry where the electricity is from, how it is made, or transported. Every month, they pay for what they consumed. The idea behind cloud computing is similar, the user can simply use storage, computing power, or specially crafted development environments, without having to worry how these work internally. The cloud is internet based on how the internet is described in computer network diagrams, which means it is an abstraction hiding the complex infrastructure of the internet. Could technology-enabled services from the Internet without knowledge of, or control over the technologies behind these servers. Now way days cloud computing having the advantages in initial cost and availability for all users, whatever the shared information is fastly spreading all over the networks so fast and easily. Now concern is always problem all about security and memory management of the servers effectively changing the future values. In this paper we are calculate performance evaluation of data management for multiple clouds by implementing cryptography techniques.

[1]. N Cao, C. Wang, M. Li,K.Ren, and W. Lou, “Privacy preserving keyword ranked search over encrypted cloud data,” IEEE Trans. Parallel Distrib. Syst., vol, 25, no. 1, pp. 222-223, Jan. 2014 .
[2] C. Wang, N. Cao, J. Li, K. Ren, and W. Lou,”secure ranked keyword search over encrypted cloud data,” in Proc. IEEE 30th Int. Conf. Distrib. Compute. Syst. (ICDCS), jun.2010, pp. 253-262.
[3] B. Wang, S. Yu, W.Lou, and Y.T.Hou, “privacy-preserving multi-keyword fuzzy search over encrypted data in the cloud,” in Proc. IEEE INFOCOM, Apr./May 2014, pp. 2112- 2120.
[4] C.Wang, N. Cao, K. Ren, and W. Lou, “Enabling secure and efficient ranked keyword search over outsourced cloud data,” IEEE Trans.Parallel Distrib. Syst., vol.23, no.8, pp. 1467- 1479, Aug. 2012.
[5]. K. Srinivasa Reddy and S. Ramachandram “A New Randomized Order Preserving Encryption Scheme” In International Journal of Computer Applications (0975 – 8887) Volume 108 – No 12, December 2014.
[6] R. Agrawal, J. Kiernan, R. Srikant, and Y. Xu, “Order preserving encryption for numeric data,” In Proc. ACM SIGMOD Int. Conf. Manage. Data, 2004, pp. 563–574.
[7]. A. Boldyreva, N. Chenette, Y. Lee, and A. O? Neill, “Order preserving symmetric encryption,” In Advances in Cryptology. Berlin, Germany: Springer-Verlag, 2009, pp. 224– 241.
[8] Raluca Ada Popa , Frank H. Li , Nickolai Zeldovich “An Ideal-Security Protocol for Order Preserving Encoding” In Proc. of the 34th IEEE Symposium on Security and Privacy.
[9] K. Srinivasa Reddy and S. Ramachandram “A novel Dynamic Order-Preserving Encryption Scheme” In Networks & Soft Computing (ICNSC), 2014 First International Conference on 19- 0 Aug. 2014.
[10]. R. Agrawal, J. Kiernan and R. Srikant, “Order preserving encryption for numeric data,” Proceedings of the 2004 ACM SIGMOD international conference on Management of data. ACM, pp. 563-574, 2004.

Multi Cloud, Secret Shares, Cryptography, Encryption and Decryption .