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

Debayan Gupta, Aaron Segal, Aurojit Panda, Gil Segev, Michael Schapira, Joan Feigenbaum, Jennifer L. Rexford, Scott Shenker

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

40 Scopus citations

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.

Original languageEnglish (US)
Title of host publicationProceedings of the 11th ACM Workshop on Hot Topics in Networks, HotNets-11
PublisherAssociation for Computing Machinery
Pages37-42
Number of pages6
ISBN (Print)9781450317764
DOIs
StatePublished - 2012
Event11th ACM Workshop on Hot Topics in Networks, HotNets 2012 - Redmond, WA, United States
Duration: Oct 29 2012Oct 30 2012

Publication series

NameProceedings of the 11th ACM Workshop on Hot Topics in Networks, HotNets-11

Other

Other11th ACM Workshop on Hot Topics in Networks, HotNets 2012
Country/TerritoryUnited States
CityRedmond, WA
Period10/29/1210/30/12

All Science Journal Classification (ASJC) codes

  • Computer Networks and Communications

Fingerprint

Dive into the research topics of 'A new approach to interdomain routing based on secure multi-party computation'. Together they form a unique fingerprint.

Cite this