Fuzzy Private Matching (Extended Abstract) release_dkblydoa7venppbfw6jgyzyyp4

by Łukasz Chmielewski, Jaap-Henk Hoepman

Released as a article .

2007  

Abstract

In the private matching problem, a client and a server each hold a set of n input elements. The client wants to privately compute the intersection of these two sets: he learns which elements he has in common with the server (and nothing more), while the server gains no information at all. In certain applications it would be useful to have a private matching protocol that reports a match even if two elements are only similar instead of equal. Such a private matching protocol is called fuzzy, and is useful, for instance, when elements may be inaccurate or corrupted by errors. We consider the fuzzy private matching problem, in a semi-honest environment. Elements are similar if they match on t out of T attributes. First we show that the original solution proposed by Freedman et al. is incorrect. Subsequently we present two fuzzy private matching protocols. The first, simple, protocol has bit message complexity O(n Tt (T |D|+k)). The second, improved, protocol has a much better bit message complexity of O(n T (|D|+k)), but here the client incurs a O(n) factor time complexity. Additionally, we present protocols based on the computation of the Hamming distance and on oblivious transfer, that have different, sometimes more efficient, performance characteristics.
In text/plain format

Archived Files and Locations

application/pdf  228.2 kB
file_j4vyb4hxefaf7dprif2letrckq
arxiv.org (repository)
web.archive.org (webarchive)
application/pdf  221.9 kB
file_ltiwhswuofcsfj27u4hguq5gte
archive.org (archive)
Read Archived PDF
Preserved and Accessible
Type  article
Stage   submitted
Date   2007-10-29
Version   v1
Language   en ?
arXiv  0710.5425v1
Work Entity
access all versions, variants, and formats of this works (eg, pre-prints)
Catalog Record
Revision: 878e1c69-d6f1-48c4-b256-a45bc36ec974
API URL: JSON