In the present paper, we propose private stable matching protocols to solve the stable marriage problem with the round complexity O(n2), where n is the problem size. In the multiparty setting, the round complexity of our protocol is better than all of the existing practical protocols. We also implement our protocol on a standard personal computer, smartphones, and tablet computers for experimental performance evaluation. Our protocols are constructed by using additive homomorphic encryption only, and this construction yields improved round complexity and implementation-friendliness. To the best of our knowledge, our experiment is the first implementation report of a private stable matching protocol that has a feasible running time.
CITATION STYLE
Teruya, T., & Sakuma, J. (2015). Round-efficient private stable matching from additive homomorphic encryption. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7807, pp. 69–86). Springer Verlag. https://doi.org/10.1007/978-3-319-27659-5_5
Mendeley helps you to discover research relevant for your work.