SimAttack: private web search under fire. Issue 1 (December 2016)

• Record Type: Journal Article
• Authors: Petit, Albin; Cerqueus, Thomas; Boutet, Antoine; Mokhtar, Sonia; Coquil, David; Brunie, Lionel; Kosch, Harald
• Is Part Of: Journal of internet services and applications. Volume 7:Issue 1(2016)
• Page Start: 1
• Page End: 17
• Publication Date: 2016-12
• Subjects: Privacy -- Web search -- Unlinkability -- Indistinguishability; TCP/IP (Computer network protocol) -- Periodicals; Internet -- Periodicals; Internet -- Security measures -- Periodicals; 004.678
• DOI: 10.1186/s13174-016-0044-x
• Languages: English
• ISSNs: 1867-4828

Abstract

Abstract Web Search engines have become an indispensable online service to retrieve content on the Internet. However, using search engines raises serious privacy issues as the latter gather large amounts of data about individuals through their search queries. Two main techniques have been proposed to privately query search engines. A first category of approaches, calledunlinkability, aims at disassociating the query and the identity of its requester. A second category of approaches, calledindistinguishability, aims at hiding user's queries or user's interests by either obfuscating user's queries, or forging new fake queries. This paper presents a study of the level of protection offered by three popular solutions: Tor-based, TrackMeNot, and GooPIR. For this purpose, we present an efficient and scalable attack – SimAttack – leveraging a similarity metric to capture the distance between preliminary information about the users (i.e., history of query) and a new query. SimAttack de-anonymizes up to 36.7 % of queries protected by an unlinkability solution (i.e., Tor-based), and identifies up to 45.3 and 51.6 % of queries protected by indistinguishability solutions (i.e., TrackMeNot and GooPIR, respectively). In addition, SimAttack de-anonymizes 6.7 % more queries than state-of-the-art attacks and dramatically improves the performance of the attack on TrackMeNot by 23.6 %, while retaining an execution time faster by two orders of magnitude.