A Private Stable Matching Algorithm

Existing stable matching algorithms reveal the preferences of all participants, as well as the history of matches made and broken in the course of computing a stable match. This information leakage not only violates the privacy of participants, but also leaves matching algorithms vulnerable to manipulation [8, 10, 25]. To address these limitations, this paper proposes a private stable matching algorithm, based on the famous algorithm of Gale and Shapley [6]. Our private algorithm is run by a number of independent parties whom we call the Matching Authorities. As long as a majority of Matching Authorities are honest, our protocol correctly outputs a stable match, and reveals no other information than what can be learned from that match and from the preferences of participants controlled by the adversary. The security and privacy of our protocol are based on re-encryption mix networks and on an additively homomorphic semantically secure public-key encryption scheme such as Paillier.

• Type: Conference
• Year: 2006
• Where: FC
• Authors: Philippe Golle
• Keywords: Cryptology, FC 2006, Matching Algorithm, Private Stable Matching, Stable Matching Algorithm