The Multiple Millionaires' Problem: New Algorithmic Approaches and Protocols
Authors: Tamir Tassa (The Open University), Avishay Yanai (Soda Labs)
Volume: 2024
Issue: 4
Pages: 784–796
DOI: https://doi.org/10.56553/popets-2024-0141
Abstract: We study a fundamental problem in Multi-Party Computation, which we call the Multiple Millionaires Problem (MMP). Given a set of private integer inputs, the problem is to identify the subset of inputs that equal the maximum (or minimum) of that set, without revealing any further information on the inputs beyond what is implied by the desired output. Such a problem is a natural extension of the Millionaires Problem, which is the very first Multi-Party Computation problem that was presented in Andrew Yaos seminal work (FOCS 1982). A closely related problem is MaxP, in which the value of the maximum is sought. We study these fundamental problems and describe several algorithmic approaches and protocols for their solution. In addition, we compare the performance of the protocols under several selected settings. As applications of privacy-preserving computation are more and more commonly implemented in industrial systems, MMP and MaxP become important building blocks in privacy-preserving statistics, machine learning, auctions and other domains. One of the prominent advantages of the protocols that we present here is their simplicity. As they solve fundamental problems that are essential building blocks in various application scenarios, we believe that the presented solutions to those problems, and the comparison between them, will serve well future researchers and practitioners of secure distributed computing.
Keywords: multi-party computation, millionaires problem, the maximum problem, privacy-preserving computation
Copyright in PoPETs articles are held by their authors. This article is published under a Creative Commons Attribution 4.0 license.
