Verifying Search Results Over Web Collections

2010 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology, 2010

ABSTRACT The current search engine model considers users not trustworthy, so no tools are provided to let them specify what they are looking for or in what context, which severely limits what they are able to achieve. Instead, search engines try to guess that, which is currently done using "implicit feedback''. In this paper we propose a "web exploration engine'' - a model where users can use the search engine as their tool and explicitly specify the context of their search. Information about the web has been pre-classified in a large number of categories; users can explore this hierarchy by providing relevance feedback or search within a particular category. Search is truly ``local'' in the sense that keyword relevance is not global, but specific to the category. In contrast to using a search engine, users can guide the exploration engine with relevance feedback alone without entering keywords.

Computing Research Repository, 2009

The WWW is the most important source of information. But, there is no guarantee for information correctness and lots of conflicting information is retrieved by the search engines and the quality of provided information also varies from low quality to high quality. We provide enhanced trustworthiness in both specific (entity) and broad (content) queries in web searching. The filtering of

— Web search tools are generally used to get information from web servers. These web crawlers use client profiles and as of late sought information to give indexed lists, so here there is no security insurance for client information. We give an framework that can assist clients with customizing their protection necessities. The protections prerequisites gave by client are utilized here for querying the Web server with the hunt keys given by client. In this methodology we can ready to conceal the protection information of client from web search servers. The procedure of modifying protection necessities will happen in offline and will be utilized dynamically .The calculations utilized here will give speculation inquiries expected to look by safeguarding security prerequisites gave. The Experimental results will prove that this Framework will ensure privacy of client.

2018 13th Asia Joint Conference on Information Security (AsiaJCIS), 2018

Web search engines are valuable tools that are widely used to find specific information in the World Wide Web. When the query is searched in a web should provide the relevant information to the users. The irrelevant results may disappoint the users and the efficiency of the query search should be improved. Personalized web search has established to improve the quality of the various search services on the internet by customizing search results, based on the personal data of user provided to the search engine. Personalized search that involves building models of user context as ontological profiles by assigning implicitly derived from the interest scores to existing concepts in domain ontology. When retrieving the information based on user's interest, user's profile will be shown. A PWS framework called User Customizable Privacy Preserving Search, UPS framework generalizes profiles by queries when the user specifies privacy requirements. Runtime generalization method is used for providing a balance between the two predictive metrics that evaluate the utility of personalization and privacy risk of disclosing the generalized profile. Two greedy algorithms, namely Greedy discriminating power algorithm (GreedyDP) and the Greedy Information Loss algorithm (GreedyIL), are used for runtime generalization. GreedyIL algorithm achieves the higher efficiency than the Greedy discriminating power algorithm. Online prediction mechanism is used for deciding whether personalizing a given query is beneficial. Re-ranking the search results based on the interest scores and semantic evidence in an ontological user profile are very effective in presenting the most relevant results to the user.

IEEE Transactions on Dependable and Secure Computing, 2016

Although cloud computing offers elastic computation and storage resources, it poses challenges on verifiability of computations and data privacy. In this work we investigate verifiability for privacy-preserving multi-keyword search over outsourced documents. As the cloud server may return incorrect results due to system faults or incentive to reduce computation cost, it is critical to offer verifiability of search results and privacy protection for outsourced data at the same time. To fulfill these requirements, we design a Verifiable Privacy-preserving keyword Search scheme, called VPSearch, by integrating an adapted homomorphic MAC technique with a privacy-preserving multi-keyword search scheme. The proposed scheme enables the client to verify search results efficiently without storing a local copy of the outsourced data. We also propose a random challenge technique with ordering for verifying top-k search results, which can detect incorrect top-k results with probability close to 1. We provide detailed analysis on security, verifiability, privacy, and efficiency of the proposed scheme. Finally, we implement VPSearch using Matlab and evaluate its performance over three UCI bag-of-words data sets. Experiment results show that authentication tag generation incurs about 3 percent overhead only and a search query over 300,000 documents takes about 0.98 seconds on a laptop. To verify 300,000 similarity scores for one query, VPSearch costs only 0.29 seconds.

International Journal of Engineering Research and, 2015

One user hundred needs on internet. As more and more queries are being searched on the web, it is increasingly difficult to let the search engine know in what context user wants to search. Coping with ambiguous queries has long been an important part in the research of Information Retrieval, but still remains to be a challenging task. Personalized search has recently got significant attention to address this challenge in the web search community, based on the premise that a user's general preference may help the search engine disambiguate the true intention of a query. In this paper, we implement an algorithm that returns relevant results to users based on their preferences keeping sensitive data more secure. Our experiments show that user's sensitive preferences can be preserved accurately from attacks. Our scheme provides an affordable overhead while offering privacy benefits to the users.

IFIP Advances in Information and Communication Technology, 1998

Secure search techniques over encrypted cloud data allow an authorized user to query data files of interest by submitting encrypted query keywords to the cloud server in a privacy-preserving manner. However, in practice, the returned query results may be incorrect or incomplete in the dishonest cloud environment. For example, the cloud server may intentionally omit some qualified resultstosavecomputationalresourcesandcommunicationoverhead.Thus, a well-functioning secure query system should provide a query results verification mechanism that allows the data user to verify results. In this paper, we design a secure, easily integrated, and fine-grained query results verification mechanism, by which, given an encrypted query results set, the query user not only can verify the correctness of each data file in the set but also can further check how many or which qualified data files are not returned if the set is incomplete before decryption. The verification scheme is loose-coupling to concrete secure search techniques and can be very easily integrated into any secure query scheme. We achieve the goal by constructing secure verification object for encrypted cloud data. Furthermore, a short signature technique with extremely small storage cost is proposed to guarantee the authenticity of verification object and a verification object request technique is presented to tallow the query user to securely obtain the desired verification object. Performance evaluation shows that the proposed schemes are practical and efficient.

Journal of Information Processing

End-to-end encryption is becoming common in messaging applications. E-mail that is the one of most popular a messaging application has several standards and systems in its encryption. However, it is hard to say that e-mail encryption has spread enough. It has been pointed out that there are usability problems in message encryption. Even though various studies on message encryption and usability have been made, there is no study discussing utility function such as searching and sorting. In this paper, the search function is focused. We aim to investigate the usability problems on encrypted search. Therefore, a method that applies encrypted search transparently is proposed at first. The implementation of the proposed method is achieved using Google Chrome Extension for Gmail, and evaluation both performance and usability is conducted. We found that participants do not mind whether the search function is encrypted or not if both have almost identical UI and encrypted search operates at high speed.