Privacy-Preserving Interdomain Routing at Internet Scale

The Border Gateway Protocol (BGP) com-putes routes between the organizational networks thatmake up today’s Internet. Unfortunately, BGP suffersfrom deficiencies, including slow convergence, securityproblems, a lack of innovation, and the leakage of sen-sitive information about domains’ routing preferences.To overcome some of these problems, we revisit the ideaof centralizing and using secure multi-party computa-tion (MPC) for interdomain routing which was proposedby Gupta et al. (ACM HotNets’12). We implement twoalgorithms for interdomain routing with state-of-the-artMPC protocols. On an empirically derived dataset thatapproximates the topology of today’s Internet (55 809nodes), 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 isapplied at country/region-level scale, runtimes can beas low as 0.17 s online time and 0.20 s pre-computationtime. Our results motivate the MPC approach for inter-domain routing and furthermore demonstrate that cur-rent MPC techniques are capable of efficiently tacklingreal-world problems at a large scale.