Sciweavers

FC
2006
Springer
109views Cryptology» more  FC 2006»
13 years 11 months ago
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 in...
Philippe Golle
CTRSA
2007
Springer
102views Cryptology» more  CTRSA 2007»
13 years 11 months ago
Improved Efficiency for Private Stable Matching
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...
Matthew K. Franklin, Mark Gondree, Payman Mohassel