Multi-keyword Ranked Search over Encrypted Cloud Data Using RSA Algorithm
Journal Title: International Journal of Science Engineering and Advance Technology - Year 2015, Vol 3, Issue 8
Abstract
Ever since Cloud computing introduced, data owners are motivated to outsource their complex data management systems from local sites to the commercial public cloud for great flexibility and economic savings. But for protecting data privacy, sensitive data have to be encrypted before outsourcing, which obsoletes traditional data utilization based on plaintext keyword search. Thus, enabling an encrypted cloud data search service is of paramount importance. Considering the large number of data users and documents in the cloud, it is necessary to allow multiple keywords in the search request and return documents in the order of their relevance to these keywords. Related works on searchable encryption focus on single keyword search or Boolean keyword search, and rarely sort the search results. In this paper, for the first time, we define and solve the challenging problem of privacy-preserving multi-keyword ranked search over encrypted data in cloud computing (MRSE). We establish a set of strict privacy requirements for such a secure cloud data utilization system. Among various multi-keyword semantics, we choose the efficient similarity measure of “coordinate matching,†i.e., as many matches as possible, to capture the relevance of data documents to the search query. We further use “inner product similarity†to quantitatively evaluate such similarity measure. We first propose a basic idea for the MRSE based on secure inner product computation, and then give two significantly improved MRSE schemes to achieve various stringent privacy requirements in two different threat models. To improve search experience of the data search service, we further extend these two schemes to support more search semantics. Thorough analysis investigating privacy and efficiency guarantees of proposed schemes is given. Experiments on the real-world data set further show proposed schemes indeed introduce low overhead on computation and communication.
Authors and Affiliations
KandiKattu Balaji Swamy| M.Tech (Information Technology), S.R.K.R ENGINEERING COLLEGE, A.P., India, K. KISHORE RAJU| ASSISTANT PROFESSOR, Dept. Of Information Technology, S.R.K.R ENGINEERING COLLEGE, A.P., India
Keywords
Related Articles
- EP ID EP16521
- DOI -
- Views 321
- Downloads 8
A Graph theory algorithmic approach to data clustering and its Application
Clustering is the unproven classification of data items, into groups known as clusters. The clustering problem has been discussed in many area of research in many disciplines; this reflects its huge usefulness in the...
An Adapted Search on Mobile Devices With Shielded Web
Customized web pursuit could be customizing so as to promise because of enhance hunt quality indexed lists for people with individual information objectives. On the contrary hand, security isn't entirety, and occasio...
Pv Based Interline Dynamic Voltage Restoring Device For Mitigation Of Power Quality Problems
Now a days the renewable energy sources importance has increased in the distribution system. In this paper an interline dynamic voltage restorer (IDVR) has proposed for the distribution systems to mitigate voltage sa...
An Improved Cost Estimation in Software Project Development Using Neural Networks and COCOMOII model
An sympathetic of quality aspects is relevant for the software association to deliver high software dependability. An empirical consideration of metrics to prophesy the quality attributes is basic in order to acquire...
This paper Proposed another present control topology for network associated based circulated age (DG), which encourages the DG to trade a sinusoidal current into the utility matrix in spite of the mutilated lattice vo...