Are you aware of papers proposing secure multiparty computation protocols for stable matching problems such as Stable Roommates and Stable Marriage problems?

Specifically, I would like the ranking of each party to be kept private and either reveal the whole output to everybody (all the pairings) or just reveal each pairing to the involved parties.

  • $\begingroup$ It can be done using a general MPC protocol, but I'm assuming you want something more efficient? $\endgroup$ Commented May 25, 2023 at 1:51
  • $\begingroup$ Yes, if it is not available yet, I would like to develop something ad-hoc that is efficient. $\endgroup$
    – Lorenzo
    Commented May 25, 2023 at 1:54

1 Answer 1


Is this what you were looking for? Secure Stable Matching at Scale by Jack Doerner, David Evans, and abhi shelat.


Your Answer

By clicking “Post Your Answer”, you agree to our terms of service and acknowledge you have read our privacy policy.

Not the answer you're looking for? Browse other questions tagged or ask your own question.