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

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

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

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
Pages37-42
Number of pages6
DOIs
StatePublished - Dec 5 2012
Event11th ACM Workshop on Hot Topics in Networks, HotNets 2012 - Redmond, WA, United States
Duration: Oct 29 2012Oct 30 2012

Other

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

Fingerprint

Planning

ASJC Scopus subject areas

  • Computer Networks and Communications

Cite this

Gupta, D., Segal, A., Panda, A., Segev, G., Schapira, M., Feigenbaum, J., ... Shenker, S. (2012). A new approach to interdomain routing based on secure multi-party computation. In Proceedings of the 11th ACM Workshop on Hot Topics in Networks, HotNets-11 (pp. 37-42) https://doi.org/10.1145/2390231.2390238

A new approach to interdomain routing based on secure multi-party computation. / Gupta, Debayan; Segal, Aaron; Panda, Aurojit; Segev, Gil; Schapira, Michael; Feigenbaum, Joan; Rexford, Jenifer; Shenker, Scott.

Proceedings of the 11th ACM Workshop on Hot Topics in Networks, HotNets-11. 2012. p. 37-42.

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

Gupta, D, Segal, A, Panda, A, Segev, G, Schapira, M, Feigenbaum, J, Rexford, J & Shenker, S 2012, A new approach to interdomain routing based on secure multi-party computation. in Proceedings of the 11th ACM Workshop on Hot Topics in Networks, HotNets-11. pp. 37-42, 11th ACM Workshop on Hot Topics in Networks, HotNets 2012, Redmond, WA, United States, 10/29/12. https://doi.org/10.1145/2390231.2390238
Gupta D, Segal A, Panda A, Segev G, Schapira M, Feigenbaum J et al. A new approach to interdomain routing based on secure multi-party computation. In Proceedings of the 11th ACM Workshop on Hot Topics in Networks, HotNets-11. 2012. p. 37-42 https://doi.org/10.1145/2390231.2390238
Gupta, Debayan ; Segal, Aaron ; Panda, Aurojit ; Segev, Gil ; Schapira, Michael ; Feigenbaum, Joan ; Rexford, Jenifer ; Shenker, Scott. / A new approach to interdomain routing based on secure multi-party computation. Proceedings of the 11th ACM Workshop on Hot Topics in Networks, HotNets-11. 2012. pp. 37-42
@inproceedings{6cb8f353137b456e83b9d4450aacd242,
title = "A new approach to interdomain routing based on secure multi-party computation",
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.",
author = "Debayan Gupta and Aaron Segal and Aurojit Panda and Gil Segev and Michael Schapira and Joan Feigenbaum and Jenifer Rexford and Scott Shenker",
year = "2012",
month = "12",
day = "5",
doi = "10.1145/2390231.2390238",
language = "English (US)",
isbn = "9781450317764",
pages = "37--42",
booktitle = "Proceedings of the 11th ACM Workshop on Hot Topics in Networks, HotNets-11",

}

TY - GEN

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

AU - Gupta, Debayan

AU - Segal, Aaron

AU - Panda, Aurojit

AU - Segev, Gil

AU - Schapira, Michael

AU - Feigenbaum, Joan

AU - Rexford, Jenifer

AU - Shenker, Scott

PY - 2012/12/5

Y1 - 2012/12/5

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=84870350022&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84870350022&partnerID=8YFLogxK

U2 - 10.1145/2390231.2390238

DO - 10.1145/2390231.2390238

M3 - Conference contribution

AN - SCOPUS:84870350022

SN - 9781450317764

SP - 37

EP - 42

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

ER -