Deterministic Private Matching with Perfect Correctness
Jeongdae Hong, Jin-Il Kim, Jung-Hee Cheon, Kun-Soo Park · Jeongbo gwahaghoe nonmunji. si'seu'tem mich i'lon · 2007
Private Matching is a problem of computing the intersection of private datasets of two parties. One could envision the usage of private matching for Insurance fraud detection system, Do-not-fly list, medical databases, and many other applications. In 2004, Freedman et at. [1] introduced a probabilistic solution for this problem, and they extended it to malicious adversary model and multi-party computation. In this paper, we propose a new deterministic protocol for private matching with perfect correctness. We apply this technique to adversary models, achieving more reliable and higher speed computation.