TY - JOUR A1 - Petit, Albin A1 - Cerqueus, Thomas A1 - Boutet, Antoine A1 - Ben Mokhtar, Sonia A1 - Coquil, David A1 - Brunie, Lionel A1 - Kosch, Harald T1 - SimAttack: private web search under fire JF - Journal of Internet Services and Applications N2 - 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, called unlinkability, aims at disassociating the query and the identity of its requester. A second category of approaches, called indistinguishability, 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. KW - Privacy KW - Web search KW - Unlinkability KW - Indistinguishability Y1 - 2016 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:bvb:739-opus4-3574 SN - 1869-0238 PB - SpringerOpen ER - TY - JOUR A1 - Kosch, Harald A1 - Brunie, Lionel A1 - Mayer, Tobias A1 - Hasan, Omar A1 - Schiedermeier, Maximilian T1 - Anonymous voting using distributed ledger-assisted secure multi-party computation JF - Applied Network Science N2 - High voter turnout in elections and referendums is desirable to ensure a robust democracy. Secure electronic voting is a vision for the future of elections and referendums. Such a system can counteract factors hindering strong voter turnout such as the requirement of physical presence during limited hours at polling stations. However, this vision brings transparency and confidentiality requirements that render the design of such solutions challenging. Specifically, the counting implementation must support reproducibility, and the choice of individual voters must remain confidential. In this paper, we propose and evaluate a novel referendum protocol that ensures transparency, confidentiality, and integrity, in trustless networks. The protocol is built by combining secure multi-party computation and distributed ledger technology, e.g., a Blockchain. The persistence and immutability of the protocol communication allow verifiability of the referendum outcome by any participant. Voters therefore do not need to trust third parties. We provide a formal description and conduct a thorough security evaluation of our proposal. KW - E-voting KW - Distributed ledger KW - Trustless networks KW - Transparency Y1 - 2024 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:bvb:739-opus4-15176 VL - 2024 IS - 9 PB - Springer International Publishing CY - Cham (Schweiz) ER -