[go: up one dir, main page]
More Web Proxy on the site http://driver.im/ skip to main content
10.1145/3143361.3143362acmconferencesArticle/Chapter ViewAbstractPublication PagesconextConference Proceedingsconference-collections
research-article

SIXPACK: Securing Internet eXchange Points Against Curious onlooKers

Published: 28 November 2017 Publication History

Abstract

Internet eXchange Points (IXPs) play an ever-growing role in Internet inter-connection. To facilitate the exchange of routes amongst their members, IXPs provide Route Server (RS) services to dispatch the routes according to each member's peering policies. Nowadays, to make use of RSes, these policies must be disclosed to the IXP. This poses fundamental questions regarding the privacy guarantees of route-computation on confidential business information. Indeed, as evidenced by interaction with IXP administrators and a survey of network operators, this state of affairs raises privacy concerns among network administrators and even deters some networks from subscribing to RS services. We design Sixpack1, an RS service that leverages Secure Multi-Party Computation (SMPC) to keep peering policies confidential, while extending, the functionalities of today's RSes. As SMPC is notoriously heavy in terms of communication and computation, our design and implementation of Sixpack aims at moving computation outside of the SMPC without compromising the privacy guarantees. We assess the effectiveness and scalability of our system by evaluating a prototype implementation using traces of data from one of the largest IXPs in the world. Our evaluation results indicate that Sixpack can scale to support privacy-preserving route-computation, even at IXPs with many hundreds of member networks.

References

[1]
B. Ager, N. Chatzis, A. Feldmann, N. Sarrar, S. Uhlig, and W. Willinger. Anatomy of a large European IXP. In Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications (SIGCOMM), 2012.
[2]
Follow up: AMS-IX Route-Server Performance Test Euro-IX 20th, 2012. https://ripe64.ripe.net/presentations/49-Follow_Up_AMS-IX_route-server_test_Euro-IX_20th_RIPE64.pdf.
[3]
AMS-IX: Megaport and AMS-IX Partner to Provide Global SDN-Enabled Elastic Interconnection and Internet Exchange Service, Jan. 2016. https://ams-ix.net/newsitems/233.
[4]
AMS-IX: Real-time-statistics, Feb. 2016. https://ams-ix.net/technical/statistics/real-time-stats.
[5]
Amdsterdam internet exchange infrastructure, 2017. https://ams-ix.net/technical/ams-ix-infrastructure.
[6]
R. Anwar, H. Niaz, D. R. Choffnes, Í. S. Cunha, P. Gill, and E. Katz-Bassett. Investigating interdomain routing policies in the wild. In Internet Measurement Conference (IMC), 2015.
[7]
G. Asharov, D. Demmler, M. Schapira, T. Schneider, G. Segev, S. Shenker, and M. Zohner. Privacy-preserving interdomain routing at Internet scale. Proceedings on Privacy Enhancing Technologies (PoPETs), 2017(3), 2017.
[8]
D. Barrera, L. Chuat, A. Perrig, R. M. Reischuk, and P. Szalachowski. The SCION Internet Architecture. Communications of the ACM, 60(6):56--65, 2017.
[9]
D. Bogdanov, M. Jõemets, S. Siim, and M. Vaht. How the Estonian tax and customs board evaluated a tax fraud detection system based on secure multiparty computation. In Financial Cryptography and Data Security (FC), volume 8975 of LNCS, pages 227--234. Springer, 2015.
[10]
D. Bogdanov, L. Kamm, S. Laur, P. Pruulmann-Vengerfeldt, R. Talviste, and J. Willemson. Privacy-preserving statistical data analysis on federated databases. In Annual Privacy Forum, volume 8450 of LNCS, pages 30--55. Springer, 2014.
[11]
D. Bogdanov, R. Talviste, and J. Willemson. Deploying secure multi-party computation for financial data analysis - (short paper). In Financial Cryptography and Data Security (FC), volume 7397 of LNCS, pages 57--64. Springer, 2012.
[12]
P. Bogetoft, D. L. Christensen, I. Damgård, M. Geisler, T. Jakobsen, M. Krøigaard, J. D. Nielsen, J. B. Nielsen, K. Nielsen, J. Pagter, M. Schwartzbach, and T. Toft. Secure multiparty computation goes live. In Financial Cryptography and Data Security (FC), volume 5628 of LNCS, pages 325--343. Springer, 2009.
[13]
M. Burkhart, M. Strasser, D. Many, and X. Dimitropoulos. SEPIA: Privacy-preserving Aggregation of Multi-domain Network Events and Statistics. In USENIX Security, 2010.
[14]
N. Büscher and S. Katzenbeisser. Faster Secure Computation through Automatic Parallelization. In USENIX Security, 2015.
[15]
K. Butler, T. R. Farley, P. McDaniel, and J. Rexford. A survey of BGP security issues and solutions. Proceedings of the IEEE, 98(1):100--122, 2010.
[16]
M. Canini, V. Jovanović, D. Venzano, G. Kumar, D. Novaković, and D. Kostić. Checking for Insidious Faults in Deployed Federated and Heterogeneous Distributed Systems. Technical Report 164475, EPFL, 2011.
[17]
D. R. Choffnes and F. E. Bustamante. On the Effectiveness of Measurement Reuse for Performance-Based Detouring. In IEEE Conference on Computer Communications (INFOCOM), 2009.
[18]
Bgp best path selection algorithm, 2017. http://bit.ly/2slSBhV.
[19]
L. Cittadini, G. Di Battista, T. Erlebach, M. Patrignani, and M. Rimondini. Assigning AS relationships to satisfy the Gao-Rexford conditions. In International Conference on Network Protocols (ICNP), 2010.
[20]
V. Costan and S. Devadas. Intel SGX explained. Cryptology ePrint Archive, Report 2016/086, 2016. http://ia.cr/2016/086.
[21]
D. Croce, E. Leonardi, and M. Mellia. Large-Scale Available Bandwidth Measurements: Interference in Current Techniques. IEEE Transactions on Network and Service Management, 8(4):361--374, 2011.
[22]
D. Croce, M. Mellia, and E. Leonardi. The Quest for Bandwidth Estimation Techniques for Large-scale Distributed Systems. SIGMETRICS Perform. Eval. Rev., 37(3), Jan. 2010.
[23]
Deutscher commercial internet exchange infrastructure, 2013. https://apollon.de-cix.net/news/blog-post/2013/07/26/de-cix-apollons-current-topology/.
[24]
Project endeavour, Jan. 2015. https://www.de-cix.net/en/about-de-cix/research-and-development/endeavour.
[25]
An IXP Route Server Test Framework, 2016. https://www.de-cix.net/_Resources/Persistent/fba89bc19381b6784df99d2a78d4a11ebb7583c2/DE-CIX-route-server-testframework.pdf.
[26]
Deutscher Commercial Internet Exchange, 2017. https://www.de-cix.net/.
[27]
D. Demmler, T. Schneider, and M. Zohner. ABY -- a framework for efficient mixed-protocol secure two-party computation. In The Network and Distributed System Security Symposium (NDSS), 2015.
[28]
X. Dimitropoulos, D. Krioukov, M. Fomenkov, B. Huffaker, Y. Hyun, K. Claffy, and G. Riley. AS relationships: Inference and validation. Computer Communication Review, 37(1):29--40, Jan. 2007.
[29]
L. Gao. On Inferring Autonomous System Relationships in the Internet. IEEE/ACM Transactions on Networking, 9(6):733--745, Dec. 2001.
[30]
S. Garg, C. Gentry, S. Halevi, M. Raykova, A. Sahai, and B. Waters. Candidate indistinguishability obfuscation and functional encryption for all circuits. In Annual Symposium on Foundations of Computer Science (FOCS). IEEE, 2013.
[31]
C. Gentry. Fully homomorphic encryption using ideal lattices. In ACM Symposium on Theory of Computing (STOC). ACM, 2009.
[32]
C. Gentry, S. Halevi, and N. P. Smart. Homomorphic evaluation of the AES circuit. In CRYPTO, volume 7417 of LNCS, pages 850--867. Springer, 2012.
[33]
P. Gill, M. Schapira, and S. Goldberg. Let the Market Drive Deployment: a Strategy for Transitioning to BGP Security. In Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications (SIGCOMM), 2011.
[34]
P. Gill, M. Schapira, and S. Goldberg. A Survey of Interdomain Routing Policies. Computer Communication Review, 2014.
[35]
O. Goldreich. The Foundations of Cryptography - volume 2, Basic Applications. Cambridge University Press, 2004.
[36]
O. Goldreich, S. Micali, and A. Wigderson. How to play any mental game or a completeness theorem for protocols with honest majority. In ACM Symposium on Theory of Computing (STOC), 1987.
[37]
S. Goldwasser, Y. Kalai, R. A. Popa, V. Vaikuntanathan, and N. Zeldovich. Reusable garbled circuits and succinct functional encryption. In ACM Symposium on Theory of Computing (STOC). ACM, 2013.
[38]
Cloud Native Networking, 2017. Amin Vahdat's keynote at Open Networking Summit. Available at http://bit.ly/2qIZigQ.
[39]
A. Gupta, R. MacDavid, R. Birkner, M. Canini, N. Feamster, J. Rexford, and L. Vanbever. An industrial-scale software defined internet exchange point. In USENIX Symposium on Networked Systems Design and Implementation (NSDI), 2016.
[40]
A. Gupta, L. Vanbever, M. Shahbaz, S. P. Donovan, B. Schlinker, N. Feamster, J. Rexford, S. Shenker, R. Clark, and E. Katz-Bassett. SDX: A software defined internet exchange. In Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications (SIGCOMM), 2014.
[41]
D. Gupta, B. Mood, J. Feigenbaum, K. R. B. Butler, and P. Traynor. Using intel software guard extensions for efficient two-party secure function evaluation. In Financial Cryptography and Data Security - FC International Workshops, BITCOIN, VOTING, and WAHC, 2016.
[42]
D. Gupta, A. Segal, A. Panda, G. Segev, M. Schapira, J. Feigenbaum, J. Rexford, and S. Shenker. A new approach to interdomain routing based on secure multi-party computation. In ACM Workshop on Hot Topics in Networks (HotNets, 2012.
[43]
W. Henecka and M. Roughan. STRIP: privacy-preserving vector-based routing. In International Conference on Network Protocols (ICNP), 2013.
[44]
A. Holzer, M. Franz, S. Katzenbeisser, and H. Veith. Secure two-party computations in ANSI C. In ACM Conference on Computer and Communications Security (CCS), pages 772--783. ACM, 2012.
[45]
Y. Huang, D. Evans, J. Katz, and L. Malka. Faster secure two-party computation using garbled circuits. In USENIX Security, pages 539--554, 2011.
[46]
G. Huston, M. Rossi, and G. Armitage. Securing BGP -- a literature survey. Communications Surveys Tutorials, IEEE, 13(2):199--222, 2011.
[47]
Advertisement of Multiple Paths in BGP, Oct. 2014. https://tools.ietf.org/html/draft-ietf-idr-add-paths-10.
[48]
Making Route Servers Aware of Data Link Failures at IXPs, 2017. https://tools.ietf.org/html/draft-ietf-idr-rs-bfd-02.
[49]
Interxion colocation services, 2017. http://www.interxion.com/.
[50]
M. Jain and C. Dovrolis. Path Selection Using Available Bandwidth Estimation in Overlay-Based Video Streaming. Computer Networks, 52(12):2411--2418, 2008.
[51]
P. Jain, S. J. Desai, M. Shih, T. Kim, S. M. Kim, J. Lee, C. Choi, Y. Shin, B. B. Kang, and D. Han. OpenSGX: An Open Platform for SGX Research. In The Network and Distributed System Security Symposium (NDSS), 2016.
[52]
U. Javed, I. Cunha, D. R. Choffnes, E. Katz-Bassett, T. E. Anderson, and A. Krishnamurthy. PoiRoot: investigating the root cause of interdomain path changes. In Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications (SIGCOMM), 2013.
[53]
M. Keller. The oblivious machine -- or: How to put the C into MPC. IACR Cryptology ePrint Archive, page 467, 2015. http://ia.cr/2015/467.
[54]
S. Kim, Y. Shin, J. Ha, T. Kim, and D. Han. A first step towards leveraging commodity trusted execution environments for network applications. In ACM Workshop on Hot Topics in Networks (HotNets, 2015.
[55]
S. M. Kim, J. Han, J. Ha, T. Kim, and D. Han. Enhancing Security and Privacy of Tor's Ecosystem by Using Trusted Execution Environments. In USENIX Symposium on Networked Systems Design and Implementation (NSDI), 2017.
[56]
R. Kloeti, M. Rost, P. Georgopoulos, B. Ager, S. Schmid, and D. X. Stitching inter-domain paths over IXPs. In ACM Sigcomm Symposium on SDN Research (SOSR), 2016.
[57]
P. Koeberl, V. Phegade, A. Rajan, T. Schneider, S. Schulz, and M. Zhdanova. Time to rethink: Trust brokerage using trusted execution environments. In Trust and Trustworthy Computing (TRUST), volume 9229 of LNCS, pages 181--190. Springer, 2015.
[58]
V. Kolesnikov, A.-R. Sadeghi, and T. Schneider. Improved garbled circuit building blocks and applications to auctions and computing minima. In CANS, volume 5888 of LNCS, pages 1--20. Springer, 2009.
[59]
B. Kreuter, B. Mood, A. Shelat, and K. Butler. PCF: a portable circuit format for scalable two-party secure computation. In USENIX Security, 2013.
[60]
T. Lee, C. Pappas, D. Barrera, P. Szalachowski, and A. Perrig. Source Accountability with Domain-brokered Privacy. In International Conference on emerging Networking EXperiments and Technologies (CoNEXT), 2016.
[61]
LightReading. Pica8 powers french TOUIX SDN-driven internet exchange, June 2015. http://www.lightreading.com/white-box/white-box-systems/pica8-powers-french-touix-sdn-driven-internet-exchange/d/d-id/716667.
[62]
C. Liu, X. S. Wang, K. Nayak, Y. Huang, and E. Shi. ObliVM: A programming framework for secure computation. In S&P, 2015.
[63]
M., R. Di Lallo, G. Lospoto, H. Mostafaei, M. Rimondini, and G. Di Battista. PrIXP: Preserving the Privacy of Routing Policies at Internet eXchange Points. In IFIP/IEEE International Symposium on Integrated Network Management, IM, 2017.
[64]
Internet Routing Privacy Survey, 2017. http://bit.ly/2rjT7Nj.
[65]
M. Chiesa, D. Demmler, M. Canini, M. Schapira, T. Schneider. Securing Internet eXchange Points Against Curious onlooKers, Jan. 2017. http://bit.ly/sixpack-tech-rep.
[66]
S. Machiraju and R. H. Katz. Reconciling cooperation with confidentiality in multi-provider distributed systems. Technical Report UCB/CSD-04-1345, EECS Department, University of California, Berkeley, Aug 2004.
[67]
S. Machiraju and R. H. Katz. Verifying global invariants in multi-provider distributed systems. In ACM Workshop on Hot Topics in Networks (HotNets, 2004.
[68]
H. V. Madhyastha, E. Katz-Bassett, T. Anderson, A. Krishnamurthy, and A. Venkataramani. iPlane Nano: Path Prediction for Peer-to-peer Applications. In USENIX Symposium on Networked Systems Design and Implementation (NSDI), 2009.
[69]
D. Malkhi, N. Nisan, B. Pinkas, and Y. Sella. Fairplay - secure two-party computation system. In USENIX Security, 2004.
[70]
Z. M. Mao, R. Bush, T. Griffin, and M. Roughan. BGP Beacons. In Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications (SIGCOMM), 2003.
[71]
J. B. Nielsen, P. S. Nordholt, C. Orlandi, and S. S. Burra. A new approach to practical active-secure two-party computation. In CRYPTO, volume 7417 of LNCS, pages 681--700. Springer, 2012.
[72]
P. Papageorge, J. McCann, and M. Hicks. Passive Aggressive Measurement with MGRP. Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications (SIGCOMM), 39(4), 2009.
[73]
A. K. Paul, A. Tachibana, and T. Hasegawa. An Enhanced Available Bandwidth Estimation Technique for an End-to-End Network Path. IEEE Transactions on Network and Service Management, 13(4):768--781, 2016.
[74]
P. Richter, G. Smaragdakis, A. Feldmann, N. Chatzis, J. Boettger, and W. Willinger. Peering at peerings: On the role of IXP route servers. In Internet Measurement Conference (IMC), 2014.
[75]
M. Roughan, W. Willinger, O. Maennel, D. Perouli, and R. Bush. 10 Lessons from 10 Years of Measuring and Modeling the Internet's Autonomous Systems. IEEE Journal on Selected Areas in Communications, 29(9):1810--1821, 2011.
[76]
M. Roughan and Y. Zhang. Privacy-preserving performance measurements. In Workshop on Mining Network Data (MineNet), pages 329--334. ACM, 2006.
[77]
Performance Evaluation of BIRD and GoBGP, 2014. https://www.euro-ix.net/m/uploads/2016/04/24/EuroIX_GoBGP_20160419.pdf.
[78]
T. Schneider and M. Zohner. GMW vs. Yao? efficient secure two-party computation with low depth circuits. In Financial Cryptography and Data Security (FC), volume 7859 of LNCS, pages 275--292. Springer, 2013.
[79]
J. Sherry, C. Lan, R. A. Popa, and S. Ratnasamy. BlindBox: Deep packet inspection over encrypted traffic. In Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications (SIGCOMM), 2015.
[80]
R. Sherwood, A. Bender, and N. Spring. Discarte: a disjunctive internet cartographer. In Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications (SIGCOMM), 2008.
[81]
J. Stringer, Q. Fu, C. Lorier, and C. E. Rothenberg. Cardigan: Deploying a distributed routing fabric. In ACM SIGCOMM Workshop on Hot Topics in Software Defined Networking (HotSDN), 2013.
[82]
S. Tao and R. Guérin. On-line Estimation of Internet Path Performance: An Application Perspective. In IEEE Conference on Computer Communications (INFOCOM), 2004.
[83]
F. Wang and L. Gao. On inferring and characterizing internet routing policies. In Internet Measurement Conference (IMC), 2003.
[84]
H. Wang, K. S. Lee, E. Li, C. L. Lim, A. Tang, and H. Weatherspoon. Timing is Everything: Accurate, Minimum Overhead, Available Bandwidth Estimation in High-speed Wired Networks. In Internet Measurement Conference (IMC), 2014.
[85]
X. Wang and M. K. Reiter. Mitigating Bandwidth-Exhaustion Attacks Using Congestion Puzzles. In ACM Conference on Computer and Communications Security (CCS), 2004.
[86]
C. Xing, L. Yang, and M. Chen. Estimating Internet Path Properties for Distributed Applications. In WiCOM, 2009.
[87]
A. C. Yao. How to generate and exchange secrets. In Annual Symposium on Foundations of Computer Science (FOCS), 1986.
[88]
M. Zhao, W. Zhou, A. J. T. Gurney, A. Haeberlen, M. Sherr, and B. T. Loo. Private and verifiable interdomain routing decisions. In Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications (SIGCOMM), 2012.
[89]
M. Zhao, W. Zhou, A. J. T. Gurney, A. Haeberlen, M. Sherr, and B. T. Loo. Private and verifiable interdomain routing decisions. IEEE/ACM Transactions on Networking, 24(2):1011--1024, 2016.

Cited By

View all
  • (2024)Pricing for Efficient Traffic Exchange at IXPsIEEE/ACM Transactions on Networking10.1109/TNET.2023.333635232:3(2053-2068)Online publication date: Jun-2024
  • (2023)Replication: 20 Years of Inferring Interdomain Routing PoliciesProceedings of the 2023 ACM on Internet Measurement Conference10.1145/3618257.3624799(16-29)Online publication date: 24-Oct-2023
  • (2023)Angler: Dark Pool Resource AllocationProceedings of the Eighth ACM/IEEE Symposium on Edge Computing10.1145/3583740.3628440(108-120)Online publication date: 6-Dec-2023
  • Show More Cited By

Recommendations

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image ACM Conferences
CoNEXT '17: Proceedings of the 13th International Conference on emerging Networking EXperiments and Technologies
November 2017
492 pages
ISBN:9781450354226
DOI:10.1145/3143361
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than the author(s) must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected].

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 28 November 2017

Permissions

Request permissions for this article.

Check for updates

Author Tags

  1. Internet eXchange Points
  2. Secure Multi Party Computation
  3. interdomain routing
  4. privacy-preserving routing

Qualifiers

  • Research-article
  • Research
  • Refereed limited

Funding Sources

Conference

CoNEXT '17
Sponsor:

Acceptance Rates

Overall Acceptance Rate 198 of 789 submissions, 25%

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)19
  • Downloads (Last 6 weeks)2
Reflects downloads up to 04 Jan 2025

Other Metrics

Citations

Cited By

View all
  • (2024)Pricing for Efficient Traffic Exchange at IXPsIEEE/ACM Transactions on Networking10.1109/TNET.2023.333635232:3(2053-2068)Online publication date: Jun-2024
  • (2023)Replication: 20 Years of Inferring Interdomain Routing PoliciesProceedings of the 2023 ACM on Internet Measurement Conference10.1145/3618257.3624799(16-29)Online publication date: 24-Oct-2023
  • (2023)Angler: Dark Pool Resource AllocationProceedings of the Eighth ACM/IEEE Symposium on Edge Computing10.1145/3583740.3628440(108-120)Online publication date: 6-Dec-2023
  • (2023)Port Capacity Leasing Games at Internet Exchange PointsGame Theory for Networks10.1007/978-3-031-23141-4_19(251-262)Online publication date: 8-Jan-2023
  • (2022)Towards practical privacy-preserving protocolsit - Information Technology10.1515/itit-2022-000564:1-2(49-53)Online publication date: 5-Apr-2022
  • (2021)DeSI: A Decentralized Software-Defined Network Architecture for Internet Exchange PointsIEEE Transactions on Network Science and Engineering10.1109/TNSE.2021.30825758:3(2198-2212)Online publication date: 1-Jul-2021
  • (2021)Building In-the-Cloud Network Functions: Security and Privacy ChallengesProceedings of the IEEE10.1109/JPROC.2021.3127277109:12(1888-1919)Online publication date: Dec-2021
  • (2021)Balancing Traffic Flow Efficiency with IXP Revenue in Internet Peering2021 IEEE Global Communications Conference (GLOBECOM)10.1109/GLOBECOM46510.2021.9685759(1-6)Online publication date: Dec-2021
  • (2020)Towards logically centralized interdomain routingProceedings of the 17th Usenix Conference on Networked Systems Design and Implementation10.5555/3388242.3388296(739-758)Online publication date: 25-Feb-2020
  • (2020)A survey on the current internet interconnection practicesACM SIGCOMM Computer Communication Review10.1145/3390251.339025450:1(10-17)Online publication date: 23-Mar-2020
  • Show More Cited By

View Options

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media