Association for Computing Machinery
Privacy-preserving reconciliation protocols on ordered sets are protocols that solve a particular sub-problem of secure multiparty computation. Here, each party holds a private input set of equal size in which the elements are ordered according to the party's preferences. The goal of a reconciliation protocol on these ordered sets is then to find all common elements in the parties' input sets that maximize the joint preferences of the parties. In this paper, the authors present two main contributions that improve on the current state of the art.