Secure matching supporting fuzzy data
AssigneeInternational Business Machines Corporation
InventorsMichael B. Litherland, Ivan M. Milman, Martin Oberhofer, Donald A. Padilla
Life of this patent
Estimating the term…
Abstract
Provided are techniques for secure matching supporting fuzzy data. A first bloom filter for a first data element is retrieved, wherein each of the characters in the data element has been encrypted with a beginning offset position of the character and encrypted with an end offset position of the character to produce two encrypted values that are added to the first bloom filter. A second bloom filter for a second data element is retrieved. The first bloom filter and the second bloom filter are compared to determine whether there is a match between the first data element and the second data element.
Claims21
A computer-implemented method, comprising:
- retrieving, using a processor of a computer, a first bloom filter for a first data element, wherein each of the characters in the data element has been encrypted with a beginning offset position of the character and encrypted with an end offset position of the character to produce two encrypted values that are added to the first bloom filter;
- retrieving, using the processor of the computer, a second bloom filter for a second data element;
- and
- comparing, using the processor of the computer, the first bloom filter and the second bloom filter to determine whether there is a match between the first data element and the second data element.
A computer program product, the computer program product comprising a computer readable storage medium having program code embodied therewith, the program code executable by at least one processor to:
- retrieve, by the at least one processor, a first bloom filter for a first data element, wherein each of the characters in the data element has been encrypted with a beginning offset position of the character and encrypted with an end offset position of the character to produce two encrypted values that are added to the first bloom filter;
- retrieve, by the at least one processor, a second bloom filter for a second data element;
- and
- compare, by the at least one processor, the first bloom filter and the second bloom filter to determine whether there is a match between the first data element and the second data element.
A computer system, comprising:
- one or more processors, one or more computer-readable memories, and one or more computer-readable, tangible storage devices;
- and
- program instructions, stored on at least one of the one or more computer-readable, tangible storage devices for execution by at least one of the one or more processors via at least one of the one or more memories, to:
- retrieve a first bloom filter for a first data element, wherein each of the characters in the data element has been encrypted with a beginning offset position of the character and encrypted with an end offset position of the character to produce two encrypted values that are added to the first bloom filter;
- retrieve a second bloom filter for a second data element;
- and
- compare the first bloom filter and the second bloom filter to determine whether there is a match between the first data element and the second data element.
Dependencies are inferred from the claim text.