Search

Summary: With the popularity of cloud computing, more and more users store sensitive information in cloud servers. In order to protect the data over the cloud server, symmetric encryption with keyword search has been developed and the phrase search has been proposed subsequently to overcome the inefficiency produced by single/multi‐keyword search. However, most existing phrase search schemes fails to support fault‐tolerant search which is essential to users. Therefore, this paper proposes a fault‐tolerant dynamic phrase search scheme with forward privacy and backward privacy (FTPS). Piecewise Linear Chaotic Map and minhash function are used to blur information, and Bloom filter based index is constructed to realize efficient search and dynamic update simultaneously. Security analysis proves that FTPS can properly preserve the privacy of search user, and experimental results show that FTPS is practical. [ABSTRACT FROM AUTHOR]

As cloud computing becomes prevalent, more and more data owners are likely to outsource their data to a cloud server. However, to ensure privacy, the data should be encrypted before outsourcing. Symmetric searchable encryption allows users to retrieve keyword over encrypted data without decrypting the data. Many existing schemes that are based on symmetric searchable encryption only support single keyword search, conjunctive keywords search, multiple keywords search, or single phrase search. However, some schemes, i.e., static schemes, only search one phrase in a query request. In this paper, we propose a multi-phrase ranked search over encrypted cloud data, which also supports dynamic update operations, such as adding or deleting files. We used an inverted index to record the locations of keywords and to judge whether the phrase appears. This index can search for keywords efficiently. In order to rank the results and protect the privacy of relevance score, the relevance score evaluation model is used in searching process on client-side. Also, the special construction of the index makes the scheme dynamic. The data owner can update the cloud data at very little cost. Security analyses and extensive experiments were conducted to demonstrate the safety and efficiency of the proposed scheme. [ABSTRACT FROM AUTHOR]

Cloud computing has made much vitality for the examination orchestrate beginning late for its different motivations behind premium yet has in like way raise security and affirmation concerns. The point of confinement and access of puzzle reports have been perceived as one of the focal issues in the zone. Specifically, different specialists inspected answers for examine encoded archives set away on remote cloud servers. Cloud enlisting is a progression, which gives inconsequential effort, versatile computational reason for detainment. The most remote point and access of report have been tremendous issue here. While, different plans have been proposed to perform conjunctive watchword look, less thought has been noted. In this paper, we show a verbalization look for procedure in light of create channels, which is speedier than existing structure. Our structures use conjunctive catchphrase request to help functionalities. This approach other than depicted the false positive rate. [ABSTRACT FROM AUTHOR]

When submitting queries to information retrieval (IR) systems, users often have the option of specifying which, if any, of the query terms are heavily dependent on each other and should be treated as a fixed phrase, for instance by placing them between quotes. In addition to such cases where users specify term dependence, automatic ways also exist for IR systems to detect dependent terms in queries. Most IR systems use both user and algorithmic approaches. It is not however clear whether and to what extent user-defined term dependence agrees with algorithmic estimates of term dependence, nor which of the two may fetch higher performance gains. Simply put, is it better to trust users or the system to detect term dependence in queries? To answer this question, we experiment with 101 crowdsourced search engine users and 334 queries (52 train and 282 test TREC queries) and we record 10 assessments per query. We find that (i) user assessments of term dependence differ significantly from algorithmic assessments of term dependence (their overlap is approximately 30%); (ii) there is little agreement among users about term dependence in queries, and this disagreement increases as queries become longer; (iii) the potential retrieval gain that can be fetched by treating term dependence (both user- and system-defined) over a bag of words baseline is reserved to a small subset (approximately 8%) of the queries, and is much higher for low-depth than deep precision measures. Points (ii) and (iii) constitute novel insights into term dependence. [ABSTRACT FROM AUTHOR]

A booming cloud service has made it possible to consider a third-party server as private storage. When storage is used as a document archive, it is useful to provide functionality that allows users to find documents containing a specified string as a substring. The current method for providing such functionality while keeping the contents of the documents secret, either has linear complexity in the total size of the documents or needs to extract keywords when the documents are stored. Therefore, no method exists for efficiently searching for an arbitrary string that has not been extracted as a keyword. We propose the first encryption scheme that enables efficient searching for an arbitrary string. Although our scheme leaks some information for the sake of efficiency, all information leaked is derived from the precise leakage profile we have defined. © 2016 The Authors Security and Communication Networks Published by John Wiley & Sons Ltd [ABSTRACT FROM AUTHOR]