A New Approach to Interdomain Routing Based on Secure Multi-Party Computation

被引:0
作者
Gupta, Debayan [1 ]
Segal, Aaron [1 ]
Panda, Aurojit [2 ]
Segev, Gil [3 ]
Schapira, Michael [4 ]
Feigenbaum, Joan [1 ]
Rexford, Jenifer [5 ]
Shenker, Scott [2 ]
机构
[1] Yale Univ, New Haven, CT 06520 USA
[2] Univ Calif Berkeley, Berkeley, CA 94720 USA
[3] Microsoft Res Silicon Valley, Mountain View, CA 94040 USA
[4] Hebrew Univ Jerusalem, IL-91905 Jerusalem, Israel
[5] Princeton Univ, Princeton, NJ 08544 USA
来源
PROCEEDINGS OF THE 11TH ACM WORKSHOP ON HOT TOPICS IN NETWORKS (HOTNETS-XI) | 2012年
关键词
D O I
暂无
中图分类号
TN [电子技术、通信技术];
学科分类号
0809 ;
摘要
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.
引用
收藏
页码:37 / 42
页数:6
相关论文
共 50 条
  • [41] Secure Multi-Party Computation for Machine Learning: A Survey
    Zhou, Ian
    Tofigh, Farzad
    Piccardi, Massimo
    Abolhasan, Mehran
    Franklin, Daniel
    Lipman, Justin
    IEEE ACCESS, 2024, 12 : 53881 - 53899
  • [42] Secure Multi-party Quantum Computation with a Dishonest Majority
    Dulek, Yfke
    Grilo, Alex B.
    Jeffery, Stacey
    Majenz, Christian
    Schaffner, Christian
    ADVANCES IN CRYPTOLOGY - EUROCRYPT 2020, PT III, 2020, 12107 : 729 - 758
  • [43] Secure multi-party computation protocol for sorting problem
    School of Computer Science, Shaanxi Normal University, Xi'an 710062, China
    不详
    Hsi An Chiao Tung Ta Hsueh, 2008, 2 (231-233+255): : 231 - 233
  • [44] Minimal complete primitives for secure multi-party computation
    Fitzi, M
    Garay, JA
    Maurer, U
    Ostrovsky, R
    JOURNAL OF CRYPTOLOGY, 2005, 18 (01) : 37 - 61
  • [45] Secure Multi-Party Computation: Theory, practice and applications
    Zhao, Chuan
    Zhao, Shengnan
    Zhao, Minghao
    Chen, Zhenxiang
    Gao, Chong-Zhi
    Li, Hongwei
    Tan, Yu-an
    INFORMATION SCIENCES, 2019, 476 : 357 - 372
  • [46] Adaptively Secure Multi-Party Computation with Dishonest Majority
    Garg, Sanjam
    Sahai, Amit
    ADVANCES IN CRYPTOLOGY - CRYPTO 2012, 2012, 7417 : 105 - 123
  • [47] Round-Optimal Secure Multi-Party Computation
    Halevi, Shai
    Hazay, Carmit
    Polychroniadou, Antigoni
    Venkitasubramaniam, Muthuramakrishnan
    ADVANCES IN CRYPTOLOGY - CRYPTO 2018, PT II, 2018, 10992 : 488 - 520
  • [48] The Price of Low Communication in Secure Multi-party Computation
    Garay, Juan
    Ishai, Yuval
    Ostrovsky, Rafail
    Zikas, Vassilis
    ADVANCES IN CRYPTOLOGY - CRYPTO 2017, PT I, 2017, 10401 : 420 - 446
  • [49] Efficient secure multi-party computation - (Extended abstract)
    Hirt, M
    Maurer, U
    Przydatek, B
    ADVANCES IN CRYPTOLOGY ASIACRYPT 2000, PROCEEDINGS, 2000, 1976 : 143 - 161
  • [50] Fair and Secure Multi-Party Computation with Cheater Detection
    Seo, Minhye
    CRYPTOGRAPHY, 2021, 5 (03)