Providing Secrecy for One-to-Many Order Preserving Encrypted Data Search over Cloud
|International Journal of Computer Science and Engineering|
|© 2017 by SSRG - IJCSE Journal|
|Volume 4 Issue 1|
|Year of Publication : 2017|
|Authors : Goudo Krishna Chandra, Behara Vineela|
Goudo Krishna Chandra, Behara Vineela, "Providing Secrecy for One-to-Many Order Preserving Encrypted Data Search over Cloud" SSRG International Journal of Computer Science and Engineering 4.1 (2017): 19-23.
Goudo Krishna Chandra, Behara Vineela,(2017). Providing Secrecy for One-to-Many Order Preserving Encrypted Data Search over Cloud. SSRG International Journal of Computer Science and Engineering 4(1), 19-23.
Now a day’s almost everything can be shared through the cloud and also provide more security. Before sharing everything we can stored into cloud servers and the servers are manager or process their data. They can easily maintaining and storing data into cloud servers, to provide an efficient service without paying too much money and energy, as one of the most attractive feature of cloud computing. So that large number of people worry about this technology for provide security of data. If cloud server gets direct access to all these users’ data, it may try to analyses the documents to get private information. The initial purpose of this action may be kind. The server wants to provide better service by digging into these data and then displaying customer-oriented advertisement, which could be convenient but also annoying. Besides, when we consider sensitive data such as personal health records and secret chemical ingredients, the situation becomes even more serious. Theoretically, the server is not supposed to have access to sensitive data at all; therefore we should ensure the server has no access to leaking these data to an untrusted third party. Thus, sensitive data have to be encrypted before being outsourced to a commercial public cloud. However to provide security of sensitive data we can encrypt and processing of the data. We can retrieve the encrypted data is difficult process because the amount outsourced files can be large and traditional search patterns cannot be deployed to cipher text retrieval directly. To overcome this, we are proposed an encrypted searchable query domain while preserving user’s privacy. In this paper we are proposed an efficient one to many orders preserving encryption technique for searching query related documents in the cloud. By implementing this process we can retrieve out sourced large files easily and download required documents.
. 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.
 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. Comput. Syst. (ICDCS), jun.2010, pp. 253-262.
 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.
 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.
. 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.
 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.
. A. Boldyreva, N. Chenette, Y. Lee, and A. O‟ Neill, “Orderpreserving symmetric encryption,” In Advances in Cryptology. Berlin, Germany: Springer-Verlag, 2009, pp. 224– 241.
 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.
 K. Srinivasa Reddy and S. Ramachandram “A novel Dynamic Order-Preserving Encryption Scheme” In Networks & Soft Computing (ICNSC), 2014 First International Conference on 19- 20 Aug. 2014.
. 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.
. D. Song, D. Wagner and A. Perrig, “Practical techniques for searches on encrypted data,” Security and Privacy, 2000. Proceedings. 2000 IEEE Symposium on. IEEE, pp. 44-55, 2000.
. N. Cao, C. Wang and M. Li, “Privacy-preserving multikeyword ranked search over encrypted cloud data,” INFOCOM, 2011 Proceedings IEEE. IEEE, pp. 829-837, 2011.
Security, privacy, cryptography, encryption and decryption, secret key, cloud computing, searching.