Secure minimum weighted bipartite matching

Abstract

Simple application of secure multi-party computation techniques on an algorithm is not sufficient to guarantee privacy, if the underlying algorithm is data dependent or if the output can leak information. The first issue can be addressed through data oblivious computation, the second through differential privacy. However, both can be difficult to achieve with graph algorithms. This paper addresses both problems, giving a differentially private data-oblivious protocol for minimum weighted bipartite matching and minimum vertex cover.