Abstract
We investigate the problem of solving traditional combinatorial graph problems using secure multi-party computation techniques, focusing on the shortest path and the maximum flow problems. To the best of our knowledge, this is the first time these problems have been addressed in a general multi-party computation setting. Our study highlights several complexity gaps and suggests the exploration of various trade-offs, while also offering protocols that are efficient enough to solve real-world problems. © 2013 Springer-Verlag.
Author supplied keywords
Cite
CITATION STYLE
Aly, A., Cuvelier, E., Mawet, S., Pereira, O., & Van Vyve, M. (2013). Securely solving simple combinatorial graph problems. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7859 LNCS, pp. 239–257). https://doi.org/10.1007/978-3-642-39884-1_21
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
