Authors:
Toru Nakamura
;
Hiroki Okada
;
Kazuhide Fukushima
and
Takamasa Isohara
Affiliation:
KDDI Research, Inc., 2-1-15, Ohara, Fujimino-shi, Saitama-ken, Japan
Keyword(s):
Verification, Privacy, Multi-Stakeholder Environment.
Abstract:
Services to support decision-making, such as resource allocation and recommendations, are becoming popular and essential. This paper focuses on two-sided matching as a form of decision-making support. The stable marriage problem has been thoroughly studied as an exciting research topic related to two-sided matching. Stability is a property in which there is no man and woman who would agree to leave their assigned partner, and this property is recognized as an ideal condition for participants. This paper assumes a system where participants provide their preference orders to an assignee, and the assignee provides them with a stable matching. When considering a multi-stakeholder environment, not only the participants’ requirements but also the assignee’s intention should be respected. That is, the assignee should be given the discretion to select the matching which is the best for the assignee among all the stable matchings. However, there is a possibility that if the assignee is malici
ous, he/she falsifies and provides an unstable matching in order to maximize his/her benefit with ignoring the participants’ requirements. It is difficult for the participants to detect it if they want to keep their preference orders secret from others. This paper proposes a solution of protocol including a private verification algorithm to judge whether the received matching is stable while keeping their preference orders private. The proposed protocol is based on fully homomorphic encryption (FHE) and assumes the use of a semi-honest third-party server. This paper also proposes a general solution that does not limit to specific requirements from participants.
(More)