Virtual Network Embedding across Multiple Domains with Secure Multi-Party Computation

被引:1
|
作者
Mano, Toru [1 ]
Inoue, Takeru [1 ]
Mizutani, Kimihiro [1 ]
Akashi, Osamu [1 ]
机构
[1] NTT Corp, NTT Network Innovat Labs, Yokosuka, Kanagawa 2390847, Japan
关键词
virtual network embedding; multi-domain; multi-party computation;
D O I
10.1587/transcom.E98.B.437
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
Network virtualization is one of the promising technologies that can increase flexibility, diversity, and manageability of networks. Building optimal virtual networks across multiple domains is getting much attention, but existing studies were based on an unrealistic assumption, that is, providers' private information can be disclosed; as is well known, providers never actually do that. In this paper, we propose a new method that solves this multi-domain problem without revealing providers' private information. Our method uses an advanced secure computation technique called multi-party computation (MPC). Although MPC enables existing unsecured methods to optimize virtual networks securely, it requires very large time to finish the optimization due to the MPC's complex distributed protocols. Our method, in contrast, is designed to involve only a small number of MPC operations to find the optimal solution, and it allows providers to execute a large part of the optimization process independently without heavy distributed protocols. Evaluation results show that our method is faster than an existing method enhanced with MPC by several orders of magnitude. We also unveil that our method has the same level of embedding cost.
引用
收藏
页码:437 / 448
页数:12
相关论文
共 50 条
  • [31] 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)
  • [32] Round-Optimal Secure Multi-party Computation
    Shai Halevi
    Carmit Hazay
    Antigoni Polychroniadou
    Muthuramakrishnan Venkitasubramaniam
    Journal of Cryptology, 2021, 34
  • [33] Secure multi-party computation protocol for sequencing problem
    ChunMing Tang
    GuiHua Shi
    ZhengAn Yao
    Science China Information Sciences, 2011, 54 : 1654 - 1662
  • [34] 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
  • [35] Application of Secure Multi-party Computation in Linear Programming
    Fu Zu-feng
    Wang Hai-ying
    Wu Yong-wu
    2014 IEEE 7TH JOINT INTERNATIONAL INFORMATION TECHNOLOGY AND ARTIFICIAL INTELLIGENCE CONFERENCE (ITAIC), 2014, : 244 - 248
  • [36] 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
  • [37] 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
  • [38] 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
  • [39] Minimal complete primitives for secure multi-party computation
    Fitzi, M
    Garay, JA
    Maurer, U
    Ostrovsky, R
    JOURNAL OF CRYPTOLOGY, 2005, 18 (01) : 37 - 61
  • [40] Secure multi-party computation protocol for sequencing problem
    TANG ChunMing 1
    2State Key Laboratory of Information Security
    3 School of Mathematics and Computational Science
    Science China(Information Sciences), 2011, 54 (08) : 1654 - 1662