International Association for Cryptologic Research

International Association
for Cryptologic Research

CryptoDB

Paper: Improved Efficiency for Private Stable Matching

Authors:
Matthew Franklin
Mark Gondree
Payman Mohassel
Download:
URL: http://eprint.iacr.org/2006/332
Search ePrint
Search Google
Abstract: At Financial Crypto 2006, Golle presented a novel framework for the privacy preserving computation of a stable matching (stable marriage). We show that the communication complexity of Golle's main protocol is substantially greater than what was claimed in that paper, in part due to surprising pathological behavior of Golle's variant of the Gale-Shapley stable matching algorithm. We also develop new protocols in Golle's basic framework with greatly reduced communication complexity.
BibTeX
@misc{eprint-2006-21823,
  title={Improved Efficiency for Private Stable Matching},
  booktitle={IACR Eprint archive},
  keywords={stable matching, stable marriage, Gale-Shapley, privacy-preserving},
  url={http://eprint.iacr.org/2006/332},
  note={This is the full version of an article to appear at CT-RSA 2007. mohassel@cs.ucdavis.edu 13421 received 29 Sep 2006, last revised 29 Sep 2006},
  author={Matthew Franklin and Mark Gondree and Payman Mohassel},
  year=2006
}