Network flow problems with secure multiparty computation

In this PhD dissertation, we investigate how to solve some classical combinatorial optimization problems in network flows and their applications, using secure multiparty computation. Our study highlights the differences between traditional and secure adaptations of some algorithms to later test its implementation. It also explores various trade-offs between performance and security. We provide protocols that can be used as building blocks to solve more complex problems. Additionally, we report on practical applications, more specifically, we study the problem of securely building auction mechanisms with transmission constraints. We focus on improving performance for real life applications. We report on the design of a specific Object Oriented implementation of the necessary secure multiparty computation protocols used for the experimentation on practical applications. Areas of interest for our work can be found in: auction markets, communication networks, routing data from rival company hubs, distribution problems, amongst others.(FSA - Sciences de l'ingénieur) -- UCL, 201