Round-Efficient Private Stable Matching from Additive Homomorphic Encryption
In the present paper, we propose private stable matching protocols to solve the stable marriage problem with the round complexity \(O(n^2)\), 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.
The work is supported by FIRST program and Grant-in-Aid 12913388. The authors would like to thank Jacob Schuldt, Nuttapong Attrapadung, and Naoto Yanai for the valuable discussion and comments. We also thank the members of Shin-Akarui-Angou-Benkyou-Kai and the anonymous reviewers of ISC 2013 for their valuable discussion and comments.
- 1.Beaver, D., Micali, S., Rogaway, P.: The round complexity of secure protocols (extended abstract). In: Ortiz, H. (ed.) STOC, pp. 503–513. ACM (1990)Google Scholar
- 4.ECRYPT II: Yearly report on algorithms and keysize (2011–2012), September 2012. http://www.ecrypt.eu.org/
- 13.Golle, P., Juels, A.: Parallel mixing. In: Atluri, V., Pfitzmann, B., McDaniel, P.D. (eds.) ACM Conference on Computer and Communications Security, pp. 220–226. ACM (2004)Google Scholar
- 14.Google, Open Handset Alliance: Android developers. http://developer.android.com/
- 17.Naor, M., Nissim, K.: Communication preserving protocols for secure function evaluation. In: Vitter, J.S., Spirakis, P.G., Yannakakis, M. (eds.) STOC, pp. 590–599. ACM (2001)Google Scholar
- 18.NIST: Special publication 800–57, recommendation for key management - part 1: General (revision 3), July 2012. http://csrc.nist.gov/publications/PubsSPs.html
- 19.Oracle: Java.com. http://java.com/
- 22.Yao, A.C.C.: How to generate and exchange secrets (extended abstract). In: FOCS, pp. 162–167. IEEE Computer Society (1986)Google Scholar