Sciweavers

CTRSA
2007
Springer

Improved Efficiency for Private Stable Matching

13 years 9 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 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.
Matthew K. Franklin, Mark Gondree, Payman Mohassel
Added 14 Aug 2010
Updated 14 Aug 2010
Type Conference
Year 2007
Where CTRSA
Authors Matthew K. Franklin, Mark Gondree, Payman Mohassel
Comments (0)