Securely Solving Classical Network Flow Problems

Abdelrahaman Aly and Mathieu Van Vyve
Additional contact information
Mathieu Van Vyve: Université catholique de Louvain, LIDAM/CORE, Belgium

No 3192, LIDAM Reprints CORE from Université catholique de Louvain, Center for Operations Research and Econometrics (CORE)

Abstract: We investigate how to solve several classical network flow problems using secure multi-party computation. We consider the shortest path problem, the minimum mean cycle problem and the minimum cost flow problem. To the best of our knowledge, this is the first time the two last problems have been addressed in a general multi-party computation setting. Furthermore, our study highlights the complexity gaps between traditional and secure implementations of the solutions, to later test its implementation. It also explores various trade-offs between performance and security. Additionally it provides protocols that can be used as building blocks to solve complex problems. Applications of our work can be found in: communication networks, routing data from rival company hubs; distribution problems, retailer/supplier selection in multilevel supply chains that want to share routes without disclosing sensible information; amongst others.

Keywords: Network Flows; Multi-party computation; Secure collaboration (search for similar items in EconPapers)
Pages: 17
Date: 2022-01-01
Note: In: Lee J. and Kim J. (eds). Information Security and Cryptology - ICISC 2014. Springer, 2015. Lecture Notes in Computer Science, vol. 8949, p. 205-221.
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:cor:louvrp:3192

Access Statistics for this paper

More papers in LIDAM Reprints CORE from Université catholique de Louvain, Center for Operations Research and Econometrics (CORE) Voie du Roman Pays 34, 1348 Louvain-la-Neuve (Belgium). Contact information at EDIRC.
Bibliographic data for series maintained by Alain GILLIS ().