Patent ID: 9749128
Date: 2017-08-29
CPC Classifications: G06F,H04L

Claim:
1. A method for data matching, comprising: encrypting a first set of data elements to generate a first set of encrypted data elements, each of the encrypted data elements in the first set being formed by converting a respective one of the first set of data elements to a set of vectors and encrypting each vector with a public key of a fully homomorphic encryption scheme, each data element in the first set including a sequence of at least two characters drawn from an alphabet, each vector including vector elements, one vector element for each character in the data element; receiving a second set of encrypted data elements, each of the encrypted data elements in the second set having been formed by converting a respective one of a second set of data elements to a set of vectors and encrypting each vector with the public key, each data element in the second set including a sequence of at least two characters drawn from the alphabet, each data element in the first set having a same number of characters as each data element in the second set; for each of a plurality of pairs of encrypted data elements, each pair comprising an encrypted data element from the first set and an encrypted data elements second set, computing a comparison measure between the encrypted vectors of the encrypted data element in the second set and the encrypted vectors of the encrypted data element in the first set, wherein the comparison measure is based on a Hamming distance, the fully homomorphic encryption scheme using right rotation operations on encrypted similarity measure vectors to compute the Hamming distance; for each encrypted data element in the first set, generating an obfuscated vector which renders the first encrypted data element indecipherable when the comparison measure does not meet a threshold for at least one of the pairs of data encrypted elements comprising that encrypted data element; and outputting the obfuscated vectors, whereby when the obfuscated vectors are decrypted with a private key of the fully homomorphic encryption scheme, only those data elements in the first set for which the comparison measure meets the threshold for at least one of the data elements in the second set are decipherable, the threshold of the comparison measure being set such those data elements in the first set which are t-fuzzy to elements of the second dataset are decipherable, where t is less than the number of characters in each data element; wherein at least one of the computing of the comparison measures and generating of the obfuscated vectors is performed with a computer processor.