Privacy-Preserving Interdomain Routing at Internet Scale (Full Version)

Gilad Asharov, Daniel Demmler, Michael Schapira, Thomas Schneider, Gil Segev, Scott Shenker, Michael Zohner

Research output: Contribution to journalArticlepeer-review


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 (55809 nodes), our protocols take as little as 6s of topology-independent precomputation and only 3s 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.17s online time and 0.20s precomputation 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
Original languageEnglish
Article number393
Number of pages26
JournalIACR Cryptology ePrint Archive,
StatePublished - 2017
Externally publishedYes


Dive into the research topics of 'Privacy-Preserving Interdomain Routing at Internet Scale (Full Version)'. Together they form a unique fingerprint.

Cite this