Recruiting new tor relays with BRAIDS

Rob Jansen, Nicholas Hopper, Yongdae Kim

Research output: Chapter in Book/Report/Conference proceedingConference contribution

35 Scopus citations

Abstract

Tor, a distributed Internet anonymizing system, relies on volunteers who run dedicated relays. Other than altruism, these volunteers have no incentive to run relays, causing a large disparity between the number of users and available re- lays. We introduce BRAIDS, a set of practical mechanisms that encourages users to run Tor relays, allowing them to earn credits redeemable for improved performance of both interactive and non-interactive Tor trafic. These perfor-mance incentives will allow Tor to support increasing re-source demands with almost no loss in anonymity: BRAIDS is robust to well-known attacks. Using a simulation of 20,300 Tor nodes, we show that BRAIDS allows relays to achieve 75% lower latency than non-relays for interactive trafic, and 90% higher bandwidth utilization for non-interactive trafic.

Original languageEnglish (US)
Title of host publicationCCS'10 - Proceedings of the 17th ACM Conference on Computer and Communications Security
Pages319-328
Number of pages10
DOIs
StatePublished - 2010
Event17th ACM Conference on Computer and Communications Security, CCS'10 - Chicago, IL, United States
Duration: Oct 4 2010Oct 8 2010

Publication series

NameProceedings of the ACM Conference on Computer and Communications Security
ISSN (Print)1543-7221

Other

Other17th ACM Conference on Computer and Communications Security, CCS'10
CountryUnited States
CityChicago, IL
Period10/4/1010/8/10

Keywords

  • Anonymous Communication
  • Peer-to-peer networks

Fingerprint Dive into the research topics of 'Recruiting new tor relays with BRAIDS'. Together they form a unique fingerprint.

Cite this