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 条
  • [41] Round-Optimal Secure Multi-party Computation
    Halevi, Shai
    Hazay, Carmit
    Polychroniadou, Antigoni
    Venkitasubramaniam, Muthuramakrishnan
    JOURNAL OF CRYPTOLOGY, 2021, 34 (03)
  • [42] Secure Multi-party Computation of Differentially Private Median
    Bohler, Jonas
    Kerschbaum, Florian
    PROCEEDINGS OF THE 29TH USENIX SECURITY SYMPOSIUM, 2020, : 2147 - 2164
  • [43] Conclave: secure multi-party computation on big data
    Volgushev, Nikolaj
    Schwarzkopf, Matte
    Ben Getchell
    Varia, Mayank
    Lapets, Andrei
    Bestavros, Azer
    PROCEEDINGS OF THE FOURTEENTH EUROSYS CONFERENCE 2019 (EUROSYS '19), 2019,
  • [44] Secure Multi-Party Computation Using Polarizing Cards
    Shinagawa, Kazumasa
    Mizuki, Takaaki
    Schuldt, Jacob
    Nuida, Koji
    Kanayama, Naoki
    Nishide, Takashi
    Hanaoka, Goichiro
    Okamoto, Eiji
    ADVANCES IN INFORMATION AND COMPUTER SECURITY (IWSEC 2015), 2015, 9241 : 281 - 297
  • [45] Secure Multi-party Computation Minimizing Online Rounds
    Choi, Seung Geol
    Elbaz, Ariel
    Malkin, Tal
    Yung, Moti
    ADVANCES IN CRYPTOLOGY - ASIACRYPT 2009, 2009, 5912 : 268 - 286
  • [46] SECURE MULTI-PARTY QUANTUM CONFERENCE AND XOR COMPUTATION
    Das, Nayana
    Paul, Goutam
    QUANTUM INFORMATION & COMPUTATION, 2021, 21 (3-4) : 203 - 232
  • [47] Efficient secure multi-party computation - (Extended abstract)
    Hirt, M
    Maurer, U
    Przydatek, B
    ADVANCES IN CRYPTOLOGY ASIACRYPT 2000, PROCEEDINGS, 2000, 1976 : 143 - 161
  • [48] Secure Key Management for Multi-Party Computation in MOZAIK
    Marque, Enzo
    Moeyersons, Jerico
    Pohle, Erik
    Van Kenhove, Michiel
    Abidin, Aysajan
    Volckaert, Bruno
    2023 IEEE EUROPEAN SYMPOSIUM ON SECURITY AND PRIVACY WORKSHOPS, EUROS&PW, 2023, : 133 - 140
  • [49] Fair and Secure Multi-Party Computation with Cheater Detection
    Seo, Minhye
    CRYPTOGRAPHY, 2021, 5 (03)
  • [50] Recent Advances in Practical Secure Multi-Party Computation
    Ohata, Satsuya
    IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 2020, E103A (10) : 1134 - 1141