期刊
IEEE TRANSACTIONS ON DEPENDABLE AND SECURE COMPUTING
卷 16, 期 6, 页码 930-943出版社
IEEE COMPUTER SOC
DOI: 10.1109/TDSC.2018.2811807
关键词
Privacy; secure multi-party computation; software defined networking; routing
类别
资金
- Jiangsu Province Double Innovation Talent Program [NSFC-61425024, NSFC-61402223]
- National Science Foundation [NSFC-61321491]
- [CNS-1701681]
- [CNS-1717948]
- Direct For Computer & Info Scie & Enginr [1701681] Funding Source: National Science Foundation
- Division Of Computer and Network Systems [1701681] Funding Source: National Science Foundation
Today's large-scale enterprise networks, data center networks, and wide area networks can be decomposed into multiple administrative or geographical domains. Domains may be owned by different administrative units or organizations. Hence protecting domain information is an important concern. Existing general-purpose Secure Multi-Party Computation (SMPC) methods that preserves privacy for domains are extremely slow for cross-domain routing problems. In this paper we present PYCRO, a cryptographic protocol specifically designed for privacy-preserving cross-domain routing optimization in Software Defined Networking (SDN) environments. PYCRO provides two fundamental routing functions, policy-compliant shortest path computing and bandwidth allocation, while ensuring strong protection for the private information of domains. We rigorously prove the privacy guarantee of our protocol. To improve time efficiency we design the QuIck Pathing (QIP) technique. QIP only requires one-time offline preprocessing and very fast online computation. We have implemented a prototype system that runs PYCRO and QIP on servers in a campus network. Experimental results using real ISP network topologies show that PYCRO and QIP are very efficient in computation and communication costs.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据