RAC: A Freerider-Resilient, Scalable, Anonymous Communication Protocol

Mokhtar, Sonia Ben; Berthou, Gautier; Diarra, Amadou; Quéma, Vivien; Shoker, Ali

doi:10.1109/icdcs.2013.52

Cited by 24 publications

(29 citation statements)

References 13 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…AcTinG [12] is an accountable gossip protocol that does not preserve the privacy of nodes as nodes maintain a secure log, and audit each other. RAC [15] is an anonymous communication system that forces nodes to relay the messages that other nodes send. Using RAC, a source could send a content to all nodes anonymously while enforcing accountability.…”

Section: A Methodology and Parameter Settingsmentioning

confidence: 99%

“…Using RAC, a source could send a content to all nodes anonymously while enforcing accountability. We do not study Dissent [14] at it was shown to be even more costly than RAC in [15].…”

Section: A Methodology and Parameter Settingsmentioning

confidence: 99%

“…However, they take the participation of nodes for granted. More recently, Dissent [14] and RAC [15] force nodes to execute their role of relay. However, using these systems can be seen as a performance overkill.…”

Section: Related Workmentioning

confidence: 99%

“…Among them Dissent [14] and RAC [15] allow nodes to exchange messages anonymously while forcing them to stick to the original protocol specification. However, these systems heavily rely on all-to-all communications, which makes their performance unsuitable for live content dissemination systems.…”

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

PAG: Private and Accountable Gossip

Decouchant

Mokhtar

Petit

et al. 2016

2016 IEEE 36th International Conference on Distributed Computing Systems (ICDCS)

Self Cite

View full text Add to dashboard Cite

Abstract-A large variety of content sharing applications rely, at least partially, on gossip-based dissemination protocols. However, these protocols are subject to various types of faults, among which selfish behaviours performed by nodes that benefit from the system without contributing their fair share to it. Accountability mechanisms (e.g., PeerReview, AVMs, FullReview), which require that nodes log their interactions with others and periodically inspect each others' logs are effective solutions to deter faults. However, these solutions require that nodes disclose the content of their logs, which may leak sensitive information about them. Building on a monitoring infrastructure and on homomorphic cryptographic procedures, we propose in this paper PAG, the first accountable and partially privacypreserving gossip protocol. We assess PAG theoretically using the ProVerif cryptographic protocol verifier and evaluate it experimentally using both a real deployment on a cluster of 48 machines and simulations. The performance evaluation of PAG, performed using a video live streaming application, shows that it is compatible with the visualisation of live video content on commodity Internet connections. Furthermore, PAG's bandwidth consumption inherits the desirable scalability properties of gossip when the number of users in the system grows.

show abstract

Section: A Methodology and Parameter Settingsmentioning

confidence: 99%

“…Using RAC, a source could send a content to all nodes anonymously while enforcing accountability. We do not study Dissent [14] at it was shown to be even more costly than RAC in [15].…”

Section: A Methodology and Parameter Settingsmentioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

PAG: Private and Accountable Gossip

Decouchant

Mokhtar

Petit

et al. 2016

2016 IEEE 36th International Conference on Distributed Computing Systems (ICDCS)

Self Cite

View full text Add to dashboard Cite

show abstract

“…Anonymous networks (e.g., Onion Routing [1], Tor [2], Dissent [3,4], RAC [5]) represents a more complex approach to prevent a third party to map a user identity to a query. Indeed, anonymous network leverages onion routing and path forwarding to route user queries through multiple nodes before reaching the search engine.…”

Section: Unlinkability Solutionsmentioning

confidence: 99%

SimAttack: private web search under fire

Petit

Cerqueus

Boutet

et al. 2016

J Internet Serv Appl

Self Cite

View full text Add to dashboard Cite

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.

show abstract

Proxy-Terms Based Query Obfuscation Technique for Private Web Search

2022

View full text Add to dashboard Cite

Search engines store users' queries in a query log for performing personalized information retrieval. However, query logs cause privacy concerns and reveal a lot of information about individuals if used against them. Private web search (PWS) provides a privacy-preserving information retrieval (IR) facility which allows users to retrieve information from an IR system without revealing true search queries. Current PWS techniques that are explored in the domain of web search are query obfuscation-based private web search (OB-PWS). These techniques achieve web privacy by injecting cover queries into the user profiles. However, existing OB-PWS techniques submit true queries along with cover queries and achieve query obfuscation in an isolated manner without considering the similarity between consecutive queries. In this article, we propose a proxy-terms based query obfuscation technique that allows users to retrieve information from an IR system through proxy queries without submitting true queries. IR system automatically generates cover queries and true queries from the proxy queries and cannot differentiate whether the user is trying to retrieve information for the cover queries or true query. We analyzed the effectiveness of the proposed technique on test queries, and develop a similarity metric for testing the accuracy of the proposed technique. Promising results of experiments confirm the effectiveness of the proposed technique.

show abstract

RAC: A Freerider-Resilient, Scalable, Anonymous Communication Protocol

Cited by 24 publications

References 13 publications

PAG: Private and Accountable Gossip

PAG: Private and Accountable Gossip

SimAttack: private web search under fire

Proxy-Terms Based Query Obfuscation Technique for Private Web Search

Contact Info

Product

Resources

About