Efficient Query Obfuscation with Keyqueries


연구 분야: Analysis



학회: WI-IAT '21: IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology


초록

Search engine users who do not want a sensitive query to actually appear in a search engine’s query log can use query obfuscation or scrambling techniques to keep their information need private. However, the practical applicability of the state-of-the-art obfuscation technique is rather limited since it compares hundreds of thousands of candidate queries on a local corpus to select the final obfuscated queries. We propose a new approach to query obfuscation combining an efficient enumeration algorithm with so-called keyqueries. Generating only hundreds of candidate queries, our approach is orders of magnitude faster and makes close to real-time obfuscation of sensitive information needs feasible. Our experiments in TREC scenarios on the ClueWeb corpora show that our approach achieves a retrieval effectiveness comparable to the previous exhaustive candidate generation at a run time of only seconds instead of hours. Overall, 75% of the private information needs can be obfuscated while retrieving at least one relevant document of the original private query—that itself will not appear in the search engine logs. To further improve a user’s privacy, the query obfuscation can easily be combined with other client-side tools like TrackMeNot or PEAS fake queries, and TOR routing.


Author Profile
Maik Fröbe

Martin-Luther-Universität Halle-Wittenberg Germany

Germany
Author Profile
Eric Oliver Schmidt

Martin-Luther-Universität Halle-Wittenberg Germany

Germany
Author Profile
Matthias Hagen

Martin-Luther-Universität Halle-Wittenberg Germany

Germany

📄 논문 정보

발행 연도 2022년
인용수 7
출판 국가 Germany
사이트 ACM
좋아요 수 0

연관 논문 목록 (80건)