Privacy-Preserving Interdomain Routing at Internet Scale
Autor: | Thomas Schneider, Scott Shenker, Gil Segev, Michael Zohner, Gilad Asharov, Daniel Demmler, Michael Schapira |
---|---|
Rok vydání: | 2017 |
Předmět: |
Ethics
Scale (ratio) business.industry Computer science ComputerSystemsOrganization_COMPUTER-COMMUNICATIONNETWORKS Information technology 020206 networking & telecommunications 02 engineering and technology QA75.5-76.95 BJ1-1725 Privacy preserving Electronic computers. Computer science 0202 electrical engineering electronic engineering information engineering General Earth and Planetary Sciences 020201 artificial intelligence & image processing The Internet Routing (electronic design automation) business Hierarchical routing General Environmental Science Computer network |
Zdroj: | Proceedings on Privacy Enhancing Technologies Proceedings on Privacy Enhancing Technologies, Vol 2017, Iss 3, Pp 147-167 (2017) |
ISSN: | 2299-0984 |
DOI: | 10.1515/popets-2017-0033 |
Popis: | The Border Gateway Protocol (BGP) computes routes between the organizational networks that make up today’s Internet. Unfortunately, BGP suffers from deficiencies, including slow convergence, security problems, a lack of innovation, and the leakage of sensitive information about domains’ routing preferences. To overcome some of these problems, we revisit the idea of centralizing and using secure multi-party computation (MPC) for interdomain routing which was proposed by Gupta et al. (ACM HotNets’12). We implement two algorithms for interdomain routing with state-of-the-art MPC protocols. On an empirically derived dataset that approximates the topology of today’s Internet (55 809 nodes), our protocols take as little as 6 s of topology-independent precomputation and only 3 s of online time. We show, moreover, that when our MPC approach is applied at country/region-level scale, runtimes can be as low as 0.17 s online time and 0.20 s pre-computation time. Our results motivate the MPC approach for interdomain routing and furthermore demonstrate that current MPC techniques are capable of efficiently tackling real-world problems at a large scale. |
Databáze: | OpenAIRE |
Externí odkaz: |