Seagull: Privacy preserving network verification system (2402.08956v1)
Abstract: The current routing protocol used in the internet backbone is based on manual configuration, making it susceptible to errors. To mitigate these configuration-related issues, it becomes imperative to validate the accuracy and convergence of the algorithm, ensuring a seamless operation devoid of problems. However, the process of network verification faces challenges related to privacy and scalability. This paper addresses these challenges by introducing a novel approach: leveraging privacy-preserving computation, specifically multiparty computation (MPC), to verify the correctness of configurations in the internet backbone, governed by the BGP protocol. Not only does our proposed solution effectively address scalability concerns, but it also establishes a robust privacy framework. Through rigorous analysis, we demonstrate that our approach maintains privacy by not disclosing any information beyond the query result, thus providing a comprehensive and secure solution to the intricacies associated with routing protocol verification in large-scale networks.
- zenodo.org
- fortune.com
- vertiv.com
- theregister.com
- www.manrs.org
- Regional Internet Registries Statistics
- D. Beaver, “Efficient multiparty protocols using circuit randomization,” in Annual International Cryptology Conference. Springer, 1991, pp. 420–432.
- Tarjan, Robert. ”Depth-first search and linear graph algorithms.” SIAM journal on computing 1.2 (1972): 146-160.
- D. Knuth and J. Szwarcfiter A structured program to generate all topological sorting arrangements. Information Processing Letters 2.6 (1974): 153–157.
- Robert Tarjan, 1972. Depth-first search and linear graph algorithms. SIAM Journal on Computing 1. 2 (1972): 146–160.
- D. Rotaru, “awesome-MPC: A curated list of multi party computation resources and links.,” GitHub, https://github.com/rdragos/awesome-mpc.
- Alexandra Institute, FRESCO - A FRamework for Efficient Secure COmputation. 2023.
- Multiparty.org Development Team. 2018. JavaScript Implementation of Federated Functionalities, 2018. Retrieved from https://github.com/ multiparty/jiff.
- M. Keller, ‘MP-SPDZ: A Versatile Framework for Multi-Party Computation’. 2020.
- B. Schoenmakers and Coding & Crypto group, “MPyC Multiparty Computation in Python,” GitHub, https://github.com/lschoe/mpyc.
- LatticeX-Foundation, “Rosetta: A privacy-preserving computation framework for Artificial Intelligence,” GitHub, https://github.com/LatticeX-Foundation/Rosetta.
- A. Abík, 2015. [Online]. Available: https://network.jecool.net/bgp-loop-prevention/.
- www.labs.ripe.net
- networkslearning.com
- Kruskal, Joseph B. ”On the shortest spanning subtree of a graph and the traveling salesman problem.” Proceedings of the American Mathematical society 7.1 (1956): 48-50.