Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
80 tokens/sec
GPT-4o
11 tokens/sec
Gemini 2.5 Pro Pro
53 tokens/sec
o3 Pro
5 tokens/sec
GPT-4.1 Pro
10 tokens/sec
DeepSeek R1 via Azure Pro
33 tokens/sec
2000 character limit reached

Seagull: Privacy preserving network verification system (2402.08956v1)

Published 14 Feb 2024 in cs.CR and cs.NI

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.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (20)
  1. zenodo.org
  2. fortune.com
  3. vertiv.com
  4. theregister.com
  5. www.manrs.org
  6. Regional Internet Registries Statistics
  7. D. Beaver, “Efficient multiparty protocols using circuit randomization,” in Annual International Cryptology Conference. Springer, 1991, pp. 420–432.
  8. Tarjan, Robert. ”Depth-first search and linear graph algorithms.” SIAM journal on computing 1.2 (1972): 146-160.
  9. D. Knuth and J. Szwarcfiter A structured program to generate all topological sorting arrangements. Information Processing Letters 2.6 (1974): 153–157.
  10. Robert Tarjan, 1972. Depth-first search and linear graph algorithms. SIAM Journal on Computing 1. 2 (1972): 146–160.
  11. D. Rotaru, “awesome-MPC: A curated list of multi party computation resources and links.,” GitHub, https://github.com/rdragos/awesome-mpc.
  12. Alexandra Institute, FRESCO - A FRamework for Efficient Secure COmputation. 2023.
  13. Multiparty.org Development Team. 2018. JavaScript Implementation of Federated Functionalities, 2018. Retrieved from https://github.com/ multiparty/jiff.
  14. M. Keller, ‘MP-SPDZ: A Versatile Framework for Multi-Party Computation’. 2020.
  15. B. Schoenmakers and Coding & Crypto group, “MPyC Multiparty Computation in Python,” GitHub, https://github.com/lschoe/mpyc.
  16. LatticeX-Foundation, “Rosetta: A privacy-preserving computation framework for Artificial Intelligence,” GitHub, https://github.com/LatticeX-Foundation/Rosetta.
  17. A. Abík, 2015. [Online]. Available: https://network.jecool.net/bgp-loop-prevention/.
  18. www.labs.ripe.net
  19. networkslearning.com
  20. 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.

Summary

We haven't generated a summary for this paper yet.

X Twitter Logo Streamline Icon: https://streamlinehq.com