Query Obfuscation by Semantic Decomposition
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.
Code (0)
등록된 구현이 없습니다.
Tasks
Representation LearningWord EmbeddingsSimilar Papers 제목 키워드 기반
Query Obfuscation Semantic Decomposition
We propose a method to protect the privacy of search engine users by decomposing the queries using semantically \emph{related} and unrelated \emph{distractor} terms. Instead of a single query, the search engine receives …
ClusteringInformation RetrievalRepresentation LearningWord EmbeddingsA Systematic Exploration of Text Decomposition and Budget Distribution in Differentially Private Text Obfuscation
The goal of differentially private text obfuscation is to obfuscate, or "perturb", input texts with Differential Privacy (DP) guarantees, such that the private output texts are quantifiably indistinguishable from the ori…
Learning Meta Word Embeddings by Unsupervised Weighted Concatenation of Source Embeddings
We propose a method to protect the privacy of search engine users by decomposing the queries using semantically \emph{related} and unrelated \emph{distractor} terms. Instead of a single query, the search engine receives …
Representation LearningWord EmbeddingsWordGame: Efficient & Effective LLM Jailbreak via Simultaneous Obfuscation in Query and Response
The recent breakthrough in large language models (LLMs) such as ChatGPT has revolutionized production processes at an unprecedented pace. Alongside this progress also comes mounting concerns about LLMs' susceptibility to…
LLM JailbreakSafety AlignmentALISON: Fast and Effective Stylometric Authorship Obfuscation
Authorship Attribution (AA) and Authorship Obfuscation (AO) are two competing tasks of increasing importance in privacy research. Modern AA leverages an author's consistent writing style to match a text to its author usi…
Authorship Attribution