The Prom Problem: Fair and privacy-enhanced matchmaking with identity linked wishes

Abstract

In this paper we present the Prom Problem (TPP) which exemplifies a special class of matchmaking challenges. We introduce the notion of identity linked wishes - wishes that involve specific identities and are valid if and only if all involved parties have that wish. A number of protocols over the years have highlighted the conflicting goals of anonymity and authentication in attempting to match users with common wishes. More recent works have built upon past attempts proposing solutions for private and privacy-enhanced matchmaking with additional security goals. Yet those protocols are insufficient in the context of TPP due primarily to the lack of fairness and inability to ensure security and privacy. We describe TPP in detail, compare with prior work, and propose a fair and privacy-enhanced matchmaking protocol supporting identity linked wishes with an untrusted matchmaker. In practical terms, our technology can prevent much of the potential damage from data breaches similar to the recent Ashley Madison hack which has allegedly resulted in blackmail, ruined careers, espionage, and even suicide. We give a pseudo-code example of our solution along with its security and preliminary performance evaluation.