Bollegala, Danushka ORCID: 0000-0003-4476-7003, Machide, Tomoya and Kawarabayashi, Ken-ichi
(2022)
Query Obfuscation by Semantic Decomposition.
In: Language Resources and Evaluation Conference (LREC), 2022-6-20 - 2022-6-25, Marseille, France.
Text
NewGoogle-LREC.pdf - Author Accepted Manuscript Download (903kB) | Preview |
Abstract
We propose a method to protect the privacy of search engine users by decomposing the queries using semantically related and unrelated distractor terms. Instead of a single query, the search engine receives multiple decomposed query terms. Next, we reconstruct the search results relevant to the original query term by aggregating the search results retrieved for the decomposed query terms. We show that the word embeddings learnt using a distributed representation learning method can be used to find semantically related and distractor query terms. We derive the relationship between the obfuscity achieved through the proposed query anonymisation method and the reconstructability of the original search results using the decomposed queries. We analytically study the risk of discovering the search engine users' information intents under the proposed query obfuscation method, and empirically evaluate its robustness against clustering-based attacks. Our experimental results show that the proposed method can accurately reconstruct the search results for user queries, without compromising the privacy of the search engine users.
Item Type: | Conference or Workshop Item (Unspecified) |
---|---|
Uncontrolled Keywords: | Query Obfuscation, Information Retrieval, Word Embeddings, Reconstrutability |
Divisions: | Faculty of Science and Engineering > School of Electrical Engineering, Electronics and Computer Science |
Depositing User: | Symplectic Admin |
Date Deposited: | 14 Apr 2022 13:58 |
Last Modified: | 23 Nov 2023 22:56 |
Related URLs: | |
URI: | https://livrepository.liverpool.ac.uk/id/eprint/3152961 |