 #1
zak100
Gold Member
 462
 11
Summary:

Hi,
I am reading a research paper in the context of stable matching which reduces the problem. I am looking for an exampe
Main Question or Discussion Point
Hi,
I am reading the following paper:
Toward Practical Secure Stable Matching: https://encrypto.de/papers/RSSSK17.pdf.
According to the paper:
Zulfi.
I am reading the following paper:
Toward Practical Secure Stable Matching: https://encrypto.de/papers/RSSSK17.pdf.
According to the paper:
and at other place:We can make the process of stable matching secure by utilizing Secure Function Evaluation (SFE) protocols.
SFE allows to evaluate a function on private inputs from multiple parties where each party wants to keep
her own inputs private.
Somebody please provide me an example for this model i.e reducing from multiparty data into 2party data.Secure SM is inherently a multiparty SFE problem where multiple parties provide their inputs. However, we use
a known technique based on XORsecretsharing that translates this problem into twoparty SFE.
Zulfi.