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 条
  • [31] Brief Announcement: Secure Data Structures based on Multi-Party Computation
    Toft, Tomas
    PODC 11: PROCEEDINGS OF THE 2011 ACM SYMPOSIUM PRINCIPLES OF DISTRIBUTED COMPUTING, 2011, : 291 - 292
  • [32] Secure Byzantine resilient federated learning based on multi-party computation
    Gao, Hongfeng
    Huang, Hao
    Tian, Youliang
    Tongxin Xuebao/Journal on Communications, 2025, 46 (02): : 108 - 122
  • [33] Secure Multi-Party Computation Based on Cut-and-Choose Technology
    Zhao C.
    Xu J.
    Jisuanji Yanjiu yu Fazhan/Computer Research and Development, 2022, 59 (08): : 1800 - 1818
  • [34] A Verifiable Federated Learning Scheme Based on Secure Multi-party Computation
    Mou, Wenhao
    Fu, Chunlei
    Lei, Yan
    Hu, Chunqiang
    WIRELESS ALGORITHMS, SYSTEMS, AND APPLICATIONS, WASA 2021, PT II, 2021, 12938 : 198 - 209
  • [35] MULTI-PARTY SECURE COMPUTATION OF MULTI-VARIABLE POLYNOMIALS
    Kosolapov, Yu. V.
    BULLETIN OF THE SOUTH URAL STATE UNIVERSITY SERIES-MATHEMATICAL MODELLING PROGRAMMING & COMPUTER SOFTWARE, 2023, 16 (01): : 81 - 95
  • [36] Minimal Complete Primitives for Secure Multi-Party Computation
    Matthias Fitzi
    Juan A. Garay
    Ueli Maurer
    Rafail Ostrovsky
    Journal of Cryptology, 2005, 18 : 37 - 61
  • [37] Rational protocol of quantum secure multi-party computation
    Dou, Zhao
    Xu, Gang
    Chen, Xiu-Bo
    Niu, Xin-Xin
    Yang, Yi-Xian
    QUANTUM INFORMATION PROCESSING, 2018, 17 (08)
  • [38] Round-Optimal Secure Multi-party Computation
    Shai Halevi
    Carmit Hazay
    Antigoni Polychroniadou
    Muthuramakrishnan Venkitasubramaniam
    Journal of Cryptology, 2021, 34
  • [39] Secure multi-party computation protocol for sequencing problem
    ChunMing Tang
    GuiHua Shi
    ZhengAn Yao
    Science China Information Sciences, 2011, 54 : 1654 - 1662
  • [40] Rational protocol of quantum secure multi-party computation
    Zhao Dou
    Gang Xu
    Xiu-Bo Chen
    Xin-Xin Niu
    Yi-Xian Yang
    Quantum Information Processing, 2018, 17