Efficient fuzzy matching and intersection on private datasets

Authors:
Qingsong Ye;Ron Steinfeld;Josef Pieprzyk
Affiliations:
Centre for Advanced Computing, Algorithms and Cryptography, Department of Computing, Macquarie University, NSW, Australia;Centre for Advanced Computing, Algorithms and Cryptography, Department of Computing, Macquarie University, NSW, Australia;Centre for Advanced Computing, Algorithms and Cryptography, Department of Computing, Macquarie University, NSW, Australia and School of Physical and Mathematical Sciences, Nanyang Technological Un ...
Venue:
ICISC'09 Proceedings of the 12th international conference on Information security and cryptology
Year:
2009

Citing 10
Cited 1

Fast Probabilistic Algorithms for Verification of Polynomial Identities

Journal of the ACM (JACM)
How to share a secret

Communications of the ACM
Decoding interleaved Reed-Solomon codes over noisy channels

Theoretical Computer Science
Fairplay—a secure two-party computation system

SSYM'04 Proceedings of the 13th conference on USENIX Security Symposium - Volume 13
Fuzzy Private Matching (Extended Abstract)

ARES '08 Proceedings of the 2008 Third International Conference on Availability, Reliability and Security
How to generate and exchange secrets

SFCS '86 Proceedings of the 27th Annual Symposium on Foundations of Computer Science
Public-key cryptosystems based on composite degree residuosity classes

EUROCRYPT'99 Proceedings of the 17th international conference on Theory and application of cryptographic techniques
How to shuffle in public

TCC'07 Proceedings of the 4th conference on Theory of cryptography
Polylogarithmic private approximations and efficient matching

TCC'06 Proceedings of the Third conference on Theory of Cryptography
Improved decoding of Reed-Solomon and algebraic-geometry codes

IEEE Transactions on Information Theory

Error decodable secret sharing and one-round perfectly secure message transmission for general adversary structures

Cryptography and Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

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 (Tt). 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.