Open Access Open Access  Restricted Access Subscription Access
Open Access Open Access Open Access  Restricted Access Restricted Access Subscription Access

Secure Ranked Keyword Search Over Encrypted Cloud Data


Affiliations
1 Department of Computer Application, Alagappa University, Karaikudi, Tamil Nadu, India
2 Department of Computer Science, Alagappa University, Karaikudi, Tamil Nadu, India
     

   Subscribe/Renew Journal


Distributed computing is a system of remote servers facilitated on the Internet and used to store, oversee and prepare information set up of neighborhood servers. In the existing system three techniques used to extract information from the cloud. In this paper, a vector space show is utilized and each record is spoken to by a vector, which implies each report can be viewed as a point in a high dimensional space. The interdependence between varieties of documents are grouped into several categories. The pursuit time can be to a great extent decreased by choosing the coveted class and deserting the insignificant classifications. Cloud server will first search the categories and get the minimum desired sub-category. At that point the cloud server will select the desired k documents from the least possible desired sub-category. The value of k is to be decided by the user earlier and sent to the cloud server. To verify the search result, user has to verify the virtual ischolar_main, instead of verifying every document. Furthermore, the proposed technique has favorable position over the traditional method in the rank privacy and relevance of retrieved documents.

Keywords

Cloud Computing, Cloud Services, Keyword Search, Raking.
Subscription Login to verify subscription
User
Notifications
Font Size


  • C. Wang, N. Cao, K. Ren, and W. J. Lou, “Enabling secure and efficient ranked,” vol. 23, no. 8, pp. 1467-1479, Aug. 2012.
  • C. Wang, N. Cao, J. Li, K. Ren, and W. J. Lou, “An efficient privacy ranked keyword search over encrypted cloud data,” In Proc. IEEE 30th Int. Conf. Distrib. Comput. Syst., G Genova, Italy, pp. 253-262, 2010.
  • H. Pang, J. Shen, and R. Krishnan, “Privacy-preserving similarity based text retrieval,” ACM Trans. Internet Technol., vol. 10, no. 1, pp. 39, Feb. 2010.
  • N. Cao, C. Wang, M. Li, K. Ren, and J. Lou, “Privacy-preserving multi keyword ranked search over encrypted cloud data,” In Proc. IEEE INFOCOM, Shanghai, China, pp. 829-837, 2011.
  • H. Pang, and K. Mouratidis, “Authenticating the query results of text search engines,” In Proc. VLDB Endow., vol. 1, no. 1, pp. 126-137, Aug. 2008.
  • S. C. Yu, C. Wang, K. Ren, and W. J. Lou, “Achieving secure, scalable, and fine-grained data access control in cloud computing,” In Proc. IEEE INFOCOM, San Diego, CA, 2010.
  • D. Cash, S. Jarecki, C. Jutla, H. Krawczyk, M. Rosu, and M. Steiner, “Highly scalable searchable symmetric encryptionth support for Boolean que-ries,” Advances in Cryptology - CRYPTO pp. 353-373, 2013.

Abstract Views: 197

PDF Views: 5




  • Secure Ranked Keyword Search Over Encrypted Cloud Data

Abstract Views: 197  |  PDF Views: 5

Authors

K. Mariyammal
Department of Computer Application, Alagappa University, Karaikudi, Tamil Nadu, India
A. Padmapriya
Department of Computer Science, Alagappa University, Karaikudi, Tamil Nadu, India

Abstract


Distributed computing is a system of remote servers facilitated on the Internet and used to store, oversee and prepare information set up of neighborhood servers. In the existing system three techniques used to extract information from the cloud. In this paper, a vector space show is utilized and each record is spoken to by a vector, which implies each report can be viewed as a point in a high dimensional space. The interdependence between varieties of documents are grouped into several categories. The pursuit time can be to a great extent decreased by choosing the coveted class and deserting the insignificant classifications. Cloud server will first search the categories and get the minimum desired sub-category. At that point the cloud server will select the desired k documents from the least possible desired sub-category. The value of k is to be decided by the user earlier and sent to the cloud server. To verify the search result, user has to verify the virtual ischolar_main, instead of verifying every document. Furthermore, the proposed technique has favorable position over the traditional method in the rank privacy and relevance of retrieved documents.

Keywords


Cloud Computing, Cloud Services, Keyword Search, Raking.

References