A Secure and Dynamic Multi-Keyword Ranked Search Scheme over Encrypted Cloud Data

Xia, Zhihua; Wang, Xinhui; Sun, Xingming; Wang, Qian

doi:10.1109/tpds.2015.2401003

Cited by 1,006 publications

(488 citation statements)

References 22 publications

Supporting

Mentioning

488

Contrasting

Order By: Relevance

“…The idea of proposed ranking method is used in our future system in order to enhance the security of information on Cloud Service Provider. [6].…”

Section: Literature Review and Related Workmentioning

confidence: 99%

Review on Multi-User Multi-Keyword Privacy Preserving Ranked Based Search Over Encrypted Cloud Data

2017

IJRTER

View full text Add to dashboard Cite

Advancement in cloud computing have revamped the view of modern information technology which is motivating the data owners to outsource their data to the public cloud server like Amazon, Microsoft Azure, Google Drive, etc. With the help of data outsourcing, the organizations can provide reliable data services to their users without any concerns for the data management overhead. One more advantage of outsourcing the data over cloud as SAAS (Storage as a Service) is its cost-effectiveness, scalable and it can be accessed from anywhere and anytime. Considering the large number of data users and documents in cloud, it is crucial for the search service to allow multi-keyword query and provide result similarity ranking to meet the effective data retrieval need. Related works on searchable encryption focus on single keyword search or Boolean keyword search, and rarely differentiate the search results. In this paper, for the first time, we define and solve the challenging problem of privacypreserving multi-keyword ranked search over encrypted cloud data (MRSE), and establish a set of strict privacy requirements for such a secure cloud data utilization system to become a reality. Among various multi-keyword semantics, we choose the efficient principle of "coordinate matching", i.e., as many matches as possible, to capture the similarity between search query and data documents, and further use "inner product similarity" to quantitatively formalize such principle for similarity measurement. We first propose a basic MRSE scheme using secure inner product computation, and then significantly improve it to meet different privacy requirements in two levels of threat models. Thorough analysis investigating privacy and efficiency guarantees of proposed schemes is given, and experiments on the real-world dataset further show proposed schemes indeed introduce low overhead on computation and communication.

show abstract

“…The idea of proposed ranking method is used in our future system in order to enhance the security of information on Cloud Service Provider. [6].…”

Section: Literature Review and Related Workmentioning

confidence: 99%

Review on Multi-User Multi-Keyword Privacy Preserving Ranked Based Search Over Encrypted Cloud Data

2017

IJRTER

View full text Add to dashboard Cite

show abstract

“…Xia, X. Wang, X. Sun [1] efficient and dynamic search scheme is proposed, which supports not only the accurate multikeyword ranked search but also the dynamic deletion and insertion of documents.Prof.minquizhou, Prof. Rongzhang [2] PraposeSecurity and Privacy in Cloud Computing becomes a buzzword More and more companies step into Cloud and provide services above on it. Prof. J.Rao Prof. rasoolasal ,Prof. Claudio A. Ardagna [3] In the public cloud vision, infrastructure, platform, and software services are provisioned to tenants (i.e.customers and service providers) on a pay-as-you-go basis.Cloud tenants can use cloud resources at lower prices, and higher performance and flexibility, than traditional on-premises resources.Prof.…”

Section: Literature Reviewmentioning

confidence: 99%

Reproducible Effective Pos for Multiple User Environment.

2016

IJAERD

View full text Add to dashboard Cite

“…Yan Kong et al [3] proposed a decentralized belief propagation-based method called PD-LBP to improve the efficiency of accessing the encrypted data of home Internet on the cloud. A BGreedy Depth-first Searchâ lgorithm was proposed by Zhihua Xia et al [4] to provide efficient multi-keyword ranked search. Dengzhi Liu et al [5] proposed a framework for urban data sharing by exploiting the attribute-based cryptography.…”

Section: Introductionmentioning

confidence: 99%

Dynamically enabled defense effectiveness evaluation of a home Internet based on vulnerability analysis and attack layer measurement

Lei

et al. 2017

Pers Ubiquit Comput

View full text Add to dashboard Cite

Smart devices in a home Internet, such as routers and cameras, suffer malicious attacks from hackers on a daily basis. Defenders should change system states dynamically to improve the system's defense ability. To quantify evaluation of defense effectiveness, this paper proposes an improved vulnerability scoring method for home Internets based on the Information Security Technology Security Vulnerability Classification Guide, which calculates a vulnerability score. A higher vulnerability score indicates weaker defense ability. This method only considers defense. In actual system attack and defense, the actions of attackers should also be considered. Therefore, a measurement method for the attack layer based on the Markov chain (MC) is proposed. This method builds a model of an attack layer that can assess whether the defender's dynamic defense is effective by calculating the factor attack layer detection probability P d . To optimize computing process, this paper introduces stochastic Petri nets (SPN) so that the parameters of MC transition matrix are easily gained. This model also obtains the minimum time period Δt, during which the defender must change system states. If the change time period is greater than Δt, attackers increase their probability of hacking into the home Internet system. Finally, the study concludes that if the vulnerability scores are lower after the system states are changed, Δt will become longer, meaning the home Internet system has enhanced defense ability.

show abstract

A Secure and Dynamic Multi-Keyword Ranked Search Scheme over Encrypted Cloud Data

Cited by 1,006 publications

References 22 publications

Review on Multi-User Multi-Keyword Privacy Preserving Ranked Based Search Over Encrypted Cloud Data

Review on Multi-User Multi-Keyword Privacy Preserving Ranked Based Search Over Encrypted Cloud Data

Reproducible Effective Pos for Multiple User Environment.

Dynamically enabled defense effectiveness evaluation of a home Internet based on vulnerability analysis and attack layer measurement

Contact Info

Product

Resources

About