A new approach to interdomain routing based on secure multi-party computation

  • Authors:
  • Debayan Gupta;Aaron Segal;Aurojit Panda;Gil Segev;Michael Schapira;Joan Feigenbaum;Jenifer Rexford;Scott Shenker

  • Affiliations:
  • Yale University, New Haven, CT;Yale University, New Haven, CT;UC Berkeley, Berkeley, CA;Microsoft Research Silicon Valley, Mountain View, CA;Hebrew University, Jerusalem, Israel;Yale University, New Haven, CT;Princeton University, Princeton, NJ;UC Berkeley, Berkeley, CA and ICSI, Berkeley, CA

  • Venue:
  • Proceedings of the 11th ACM Workshop on Hot Topics in Networks
  • Year:
  • 2012

Quantified Score

Hi-index 0.00

Visualization

Abstract

Interdomain routing involves coordination among mutually distrustful parties, leading to the requirements that BGP provide policy autonomy, flexibility, and privacy. BGP provides these properties via the distributed execution of policy-based decisions during the iterative route computation process. This approach has poor convergence properties, makes planning and failover difficult, and is extremely difficult to change. To rectify these and other problems, we propose a radically different approach to interdomain-route computation, based on secure multi-party computation (SMPC). Our approach provides stronger privacy guarantees than BGP and enables the deployment of new policy paradigms. We report on an initial exploration of this idea and outline future directions for research.