Efficient Fuzzy Matching and Intersection on Private Datasets
- Cite this paper as:
- Ye Q., Steinfeld R., Pieprzyk J., Wang H. (2010) Efficient Fuzzy Matching and Intersection on Private Datasets. In: Lee D., Hong S. (eds) Information, Security and Cryptology – ICISC 2009. ICISC 2009. Lecture Notes in Computer Science, vol 5984. Springer, Berlin, Heidelberg
At Eurocrypt’04, Freedman, Nissim and Pinkas introduced a fuzzy private matching problem. The problem is defined as follows. Given two parties, each of them having a set of vectors where each vector has T integer components, the fuzzy private matching is to securely test if each vector of one set matches any vector of another set for at least t components where t < T. In the conclusion of their paper, they asked whether it was possible to design a fuzzy private matching protocol without incurring a communication complexity with the factor \(T \choose t\). We answer their question in the affirmative by presenting a protocol based on homomorphic encryption, combined with the novel notion of a share-hiding error-correcting secret sharing scheme, which we show how to implement with efficient decoding using interleaved Reed-Solomon codes. This scheme may be of independent interest. Our protocol is provably secure against passive adversaries, and has better efficiency than previous protocols for certain parameter values.
KeywordsPrivate matching private set intersection fuzzy private matching homomorphic encryption error correction secret sharing
Unable to display preview. Download preview PDF.