Efficient fuzzy matching and intersection on private datasets

Ye, Qingsong, Steinfeld, Ron, Pieprzyk, Josef, & Wang, Huaxiong (2010) Efficient fuzzy matching and intersection on private datasets. Lecture Notes in Computer Science : Information, Security and Cryptology – ICISC 2009, 5984, pp. 211-228.

View at publisher


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 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.

Impact and interest:

6 citations in Scopus
Search Google Scholar™

Citation counts are sourced monthly from Scopus and Web of Science® citation databases.

These databases contain citations from different subsets of available publications and different time periods and thus the citation count from each is usually different. Some works are not in either database and no count is displayed. Scopus includes citations from articles published in 1996 onwards, and Web of Science® generally from 1980 onwards.

Citations counts from the Google Scholar™ indexing service can be viewed at the linked Google Scholar™ search.

Full-text downloads:

44 since deposited on 02 Apr 2014
20 in the past twelve months

Full-text downloads displays the total number of times this work’s files (e.g., a PDF) have been downloaded from QUT ePrints as well as the number of downloads in the previous 365 days. The count includes downloads for all files if a work has more than one.

ID Code: 69705
Item Type: Journal Article
Refereed: Yes
Additional Information: 12th International Conference, Seoul, Korea, December 2-4, 2009, Revised Selected Papers
Keywords: Private matching, Private set intersection, Fuzzy private matching, Homomorphic encryption, Error correction, Secret sharing
DOI: 10.1007/978-3-642-14423-3_15
ISSN: 0302-9743
Divisions: Current > QUT Faculties and Divisions > Science & Engineering Faculty
Copyright Owner: Copyright 2010 Springer-Verlag Berlin Heidelberg
Deposited On: 02 Apr 2014 22:19
Last Modified: 12 Jul 2017 21:52

Export: EndNote | Dublin Core | BibTeX

Repository Staff Only: item control page