Post-anonymous fuzzy comparisons without the use of pre-anonymization variants

Abstract

A method, apparatus, and article of manufacture for processing data. The method, apparatus and article of manufacture preferably comprise the steps of: (a) receiving a record having a plurality of identifiers into a computer system, the record corresponding to an entity; (b) encrypting one or more of the identifiers in the record to form an encrypted record; (c) applying one or more encrypted variants to the encrypted record based on the encrypted identifiers and pre-computed encrypted synonyms; and (d) comparing the encrypted record to previously stored data using the encrypted identifiers and the encrypted variants in order to the match or associate the encrypted record with the previously stored data.

Description

CROSS-REFERENCE TO RELATED APPLICATIONS

This application is related to the following co-pending and commonly-assigned applications:

U.S. patent application Ser. No. 10/702,624, filed on Nov. 6, 2003, by Jeffrey J. Jonas, entitled “CONFIDENTIAL DATA SHARING AND ANONYMOUS ENTITY RESOLUTION,” which application was published as U.S. Patent Publication No. 2004-0210763, on Oct. 21, 2004, and which application claims the benefit under 35 U.S.C. §119 (e) to U.S. Provisional Patent Application Ser. No. 60/424,240, filed on Nov. 6, 2002, by Jeffrey J. Jonas, entitled “CONFIDENTIAL DATA SHARING AND ANONYMOUS ENTITY RESOLUTION;”

U.S. patent application Ser. No. 10/807,826, filed on Mar. 24, 2004, by Jeffrey J. Jonas and Steven B. Dunham, entitled “SECURE COORDINATE IDENTIFICATION METHOD, SYSTEM AND PROGRAM,” which application was published as U.S. Patent Publication No. 2005-0066182, on Mar. 24, 2005, and which application claims the benefit under 35 U.S.C. §119(e) to U.S. Provisional Patent Application Ser. No. 60/457,119, filed on Mar. 24, 2003, by Jeffrey J. Jonas and Steven B. Dunham, entitled “SECURE COORDINATE IDENTIFICATION METHOD, SYSTEM AND PROGRAM;”

which applications are incorporated by reference herein.

BACKGROUND OF THE INVENTION

1. Field of the Invention

This invention relates to processing and retrieving data in a database and, more particularly, to processing and retrieving data in a confidential and anonymous manner.

2. Description of the Related Art

In the wake of Sep. 11, 2001 events, various parties (e.g., corporations, governmental agencies or natural persons) face a common dilemma: how can parties share specific information (e.g., a terrorist watch list, black list or a list of actual or potential problematic entities) that would assist the same or separate parties in detecting the presence of potential terrorists or other problematic parties, while maintaining the security and confidentiality of such information and separating any information that is not relevant to the matter?

Hesitation to contribute or otherwise disclose, as well as laws governing the use and disclosure of, certain information is predicated upon a concern that the information could be used in a manner that would violate privacy or otherwise cause damage to the party. Such damage could include identity theft, unauthorized direct marketing activities, unauthorized or intrusive governmental activities, protected class (e.g., racial, religious, gender, ethnic) profiling and discrimination, anti-competitive practices, defamation and/or credit or economic damage.

In response to this dilemma, or any situation requiring the sharing of confidential data, it would be beneficial to have a system wherein various parties may contribute data to an internal or external process or repository in a manner that: (a) sufficiently identifies each record in the data (e.g., a source and record number) without disclosing any entity-identifiable data (e.g., name or social security number); (b) prepares the data so: (i) identical and similar values can be compared regardless of source and (ii) such data can be transmitted in a standard, but confidential, format to protect the confidentiality and security of the data, (c) compares the data to previously contributed data while the data is still in the confidential format, (d) constructs an identifiable entity (such as by utilizing a persistent key and analyzing and enhancing the record with confidential representations of potential aliases, addresses, numbers and/or other identifying information) through matching of the compared data, (e) constructs related entities through an association of the compared data, and/or (f) generates messages for appropriate parties (such as with relevant record identifying elements, e.g., a source and record number), such messages sometimes sent in a confidential manner, such as: (i) on an interval basis and/or wherein at least one message is noise (e.g., a message that does not correspond with a match or relation, but is issued to minimize certain vulnerabilities corresponding with traffic pattern analysis) and (ii) after such message has been processed through a reversible cryptographic algorithm (e.g., encoding, encryption or other algorithm used to engender a level of confidentiality, but can be reversed, such as by using decoding or decryption). Notably, the decrypted message would contain the source and record number, not the underlying protected values.

Current systems use various means to transfer data in a relatively confidential manner within or between parties. For example, some current systems use a reversible cryptographic algorithm, which modifies the data in order to engender some level of confidentiality and lower the risk of losing data during transmission, prior to transmitting data with the understanding that the recipient will use a comparable decoding or decryption method (i.e., an algorithm that reverses, returns or modifies the encoded/encrypted data to a format representative of the original data) in order to decipher and understand the data. However, once the data is deciphered, such data is subject to analysis and use in a manner that could cause the very damage that the encoding/encryption process was intended to protect against.

Other current systems use irreversible cryptographic algorithms (e.g., a one-way function, such as MD-5 or other algorithm used to engender a level of confidentiality, but is irreversible) often as a document signature to make unauthorized document alteration detectable when the document is being shared across parties. Indeed, several existing irreversible cryptographic algorithms cause data to: (a) result in an identical unique value for the same data regardless of source and (b) be undecipherable and irreversible to protect the confidentiality and security of the data. Any minor alteration (such as an extra space) in the data results in a different value after the use of the irreversible cryptographic algorithm as compared with data that does not have the minor alteration, even if the data is otherwise the same. Some current systems utilize an irreversible cryptographic algorithm to process a portion of the data and then match and merge records on a one-to-one basis based upon identical processed data. For example, current systems in a hospital may process the social security numbers in electronic patient records through a one-way function and then match and merge records on a one-to-one basis in a database based upon the processed social security numbers.

However, there are no existing systems that, at a minimum: (a) match received data—after at least a portion of such received data is processed through a cryptographic algorithm (e.g., reversible cryptographic algorithm, such as encoding or decryption, or an irreversible cryptographic algorithm, such as a one-way function) with data previously stored in a database on a one-to-many or many-to-many basis (i.e., received data consists of one or more records that matches data previously stored in a database, the matched data previously stored in a database comprising more than one previously received record), limiting the ability in current systems to build upon identifiable entities while the data is still in a confidential format, (b) move beyond the initial match process to analyze whether any additional information is gained in the initial match and then match other data previously stored in a database based upon the additional information, further limiting the current systems ability to construct identifiable entities, (c) utilizing all or part of those functions identified in (a) and (b) in this paragraph, to match not only same entities, but associate various entities that are determined to be related in some manner (e.g., a passenger on an airline reservation list is a roommate of a natural person on an airline watch list) and/or (d) issue a plurality of messages wherein at least one of the plurality of messages is merely noise.

As such and in addition, there are no existing systems that can use the cryptographic algorithm to share and compare confidential data (including, without limitation, by leaving personally identifiable information in a cryptographic format), construct identifiable or related entities and message the appropriate entities in a manner that maintains security and confidentiality of the original data.

The present invention is provided to address these and other issues. Specifically, the present invention evaluates similarities via a synonym table post-encryption, whereas prior best practices involved the a priori generation of variants and included such variants in the original record.

SUMMARY OF THE INVENTION

To overcome the limitations in the prior art described above, and to overcome other limitations that will become apparent upon reading and understanding the present specification, the present invention discloses a method, apparatus, and article of manufacture for processing data. The method, apparatus and article of manufacture preferably comprise the steps of: (a) receiving a record having a plurality of identifiers into a computer system, the record corresponding to an entity; (b) encrypting one or more of the identifiers in the record to form an encrypted record; (c) applying one or more encrypted variants to the encrypted record based on the encrypted identifiers and pre-computed encrypted synonyms; and (d) comparing the encrypted record to previously stored data using the encrypted identifiers and the encrypted variants in order to the match or associate the encrypted record with the previously stored data.

The encrypted variants are applied using an encrypted synonym table. The encrypted synonym table is created by processing a synonym table using a cryptographic algorithm, wherein the synonym table includes the variants. In one embodiment, the variants may comprise name roots, date-of-birth transpositions, sound-alike equivalencies, language transliterations, or other synonyms.

The comparison of the encrypted record to the previously stored data may also comprise the step of assigning a persistent key to the encrypted record. The persistent key reflects an existing entity when the encrypted record matches the previously stored data. Alternatively, the persistent key reflects a new entity when the encrypted record does not match the previously stored data. In either instance, the encrypted record is matched with the previously stored data using fuzzy matching through the use of the encrypted identifiers and encrypted variants, without using pre-anonymization variants.

BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1 is a block diagram of a data processing system for processing data prior to, and in, a database, according to the preferred embodiment of the present invention.

FIG. 2 is a flowchart that illustrates the steps performed by the system in receiving records and then processing each of the received records.

FIG. 3 is a flowchart that illustrates the steps performed by the system in analyzing and enhancing one or more of the plurality of identifiers of the received records.

FIG. 4 is a flowchart that illustrates the steps performed by the system in the course of generating and encrypting variants.

DETAILED DESCRIPTION OF THE INVENTION

While this invention is susceptible of embodiment in many different forms, there is shown in the drawing, and will be described herein in a detailed, specific embodiment thereof with the understanding that the present disclosure is to be considered as an exemplification of the principles of the invention and is not intended to limit the invention to the specific embodiment illustrated.

System Description

FIG. 1 is a block diagram of a data processing system 10 for processing data prior to, and in, a database, according to the preferred embodiment of the present invention. The system 10 includes at least one conventional computer 12 having a processor 14 and memory 16. The memory 16 is used both for storage of the executable software to operate the system 10 and for storage of the data in a database and random access memory. The computer 12 receives the data from one or more sources 18₁-18_N in the form of records and then processes each of the received records, as described in more detail below. The software is stored in the memory 16 and is processed or implemented by the processor 14.

The data from sources 18₁-18_N comprises one or more records having a plurality of identifiers. Each record corresponds with one or more entities. The one or more entities may be natural persons, organizations, personal property, real property, proteins, chemical or organic compounds, biometric or atomic structures, or other items that can be represented by identifying data. For example, a record that contains identifiers for name, employer name, home address, work address, work telephone number, home telephone number, car license plate number, car type and social security number may correspond with, at a minimum, the following entities: (a) natural person, (b) organization (e.g., employer or airline), and/or (c) property (e.g., car).

Thus, the present invention may be implemented as a method, apparatus, or article of manufacture using standard programming and/or engineering techniques to produce software, firmware, hardware, or any combination thereof. The term “article of manufacture” (or alternatively, “computer program product”) as used herein is intended to encompass a computer program accessible from any computer-readable device or media. Of course, those skilled in the art will recognize many modifications may be made to this configuration without departing from the scope of the present invention.

Those skilled in the art will recognize that the exemplary environment illustrated in FIG. 1 is not intended to limit the present invention. Indeed, those skilled in the art will recognize that other alternative hardware environments may be used without departing from the scope of the present invention.

Receive and Process Records

FIG. 2 is a flowchart that illustrates the steps performed by the system 10 in receiving records from sources 18₁-18_N and then processing each of the received records.

Block 20 represents the system 10 receiving one or more records from sources 18₁-18_N, each of the records having a plurality of identifiers, into the computer system 10. In this embodiment, the received record corresponds to an entity.

If the received record is not in a standard format (e.g., XML), then Block 22 represents the system 10 converting the received record into a standard format.

Block 24 represents the system 10 identifying, assigning or otherwise attributing the record to a source 18₁-18_N (e.g., one or more identifiers that identifies the record in or to the source 18₁-18_N, such as one or more primary keys of the record, such as an organization ID, system ID and record ID), wherein the identifiers attributed to the source of the received record are known as “Attribution Data.” Alternatively, a coded cross-reference table is sometimes used whereby the Attribution Data is represented by an attribution key and the attribution key is used to locate the Attribution Value when necessary.

Block 26 represents the system 10 processing the received record by analyzing and enhancing one or more of the plurality of identifiers therein, wherein the analyzed and enhanced identifiers of the record are known as “Enhanced Data.” This Block is described in more detail in FIG. 3.

Block 28 represents the system 10 performing a cryptographic algorithm to encrypt or anonymize one or more of the identifiers in the record to form an encrypted record. Specifically, this step represents the system 10 processing all or part of the Enhanced Data and optionally all or part of the Attribution Data through one or more cryptographic algorithms, which may include using secret keys for protection and confidentiality, such as:

(a) utilizing an irreversible cryptographic algorithm (e.g., one-way function) to process the entity-identifiable Enhanced Data (the irreversible processed data being “Anonymized Data”) wherein the secret key is a “salt” value to protect against dictionary attacks, and

(b) sometimes utilizing a reversible cryptographic algorithm (e.g., encryption or encoding) to process the Attribution Data, wherein the reversible processed data is known as the “Protected Attribution Data” wherein the secret key is the decryption key necessary to reveal the owner of the data record).

Block 30 represents the system 10 applying one or more encrypted variants from an encrypted synonym table 32 to the anonymized identifiers, for inclusion in the encrypted record, wherein the encrypted variants are anonymized variants. Specifically, this Block, which is described in more detail in FIG. 4, applies encrypted variants based on pre-computed encrypted synonyms for inclusion with the Anonymized Data.

Block 34 represents the system 10 conjoining the Anonymized Data and the Protected Attribution Data, wherein the conjoined Anonymized Data and the Protected Attribution Data are known as the “Conjoined Data.” Note that this Conjoined Data may also be further processed through a reversible cryptographic algorithm.

Block 36 represents the system 10 processing and/or saving the Conjoined Data in a Repository.

Note that this Repository may be stored in a location in memory 16 or may be stored in or on more local or remote storage locations on the system 10 or other devices. Indeed, the location of the Repository may be of lesser importance because the Conjoined Data in the Repository will be in a secure and confidential format. Furthermore, in this example, only the Attribution Data is susceptible to being reversed (e.g., decrypted or decoded) from the Conjoined Data. As such, even if an unauthorized party was able to reverse the Attribution Data, such party would be unable to access, read or otherwise evaluate the Anonymized Data. However, the entirety of the Conjoined Data may be used for comparison and identity recognition or correlation purposes, while maintaining confidentiality.

Block 36 may also represent the system 10 comparing the encrypted record to previously stored data in the computer system using the anonymized identifiers and encrypted variants, wherein the encrypted record is matched with the previously stored data, for example, in order to determine whether they reflect the same entity. In this regard, the Conjoined Data is compared with previously stored data (such as from other sources and potentially a warehouse of stored data) and matched to any data reflecting the same or related entities.

In addition, Block 36 may represent the system 10 storing the Conjoined Data and any resulting relations and/or matches, and optionally sending one or more messages, based upon user-defined rules, in response to the resulting relations and/or matches, such as: (i) on a set interval basis, (ii) sometimes including a message that is merely noise to minimize a traffic analysis attack, and/or (iii) with respect to the true messages, identifying Protected Attribution Data from matched data.

Analyze and Enhance Records

FIG. 3 is a flowchart that illustrates the steps performed by the system 10 in analyzing and enhancing one or more of the plurality of identifiers of the received records, wherein the analyzed and enhanced identifiers of the record are known as “Enhanced Data.” Specifically, this flowchart illustrates the steps performed by the system 10 in comparing at least a portion of the identifiers of the received record to a user-defined criteria and/or rules to perform several functions, which are set forth below.

Block 38 represents the system 10 performing address hygiene (e.g., comparing to postal delivery standards).

Block 40 represents the system 10 performing location geo-coding (e.g., determining geographic locations, such as latitude and longitude coordinates).

Block 42 represents the system 10 performing field testing and transformations (e.g., comparing the gender field to confirm M/F and possibly transforming Male to M).

Block 44 represents the system 10 performing user-defined formatting (e.g., formatting all social security numbers in a 999-99-9999 format).

Block 46 represents the system 10 supplementing the received record by causing the system 10 to access one or more databases (which may contain the processing previously identified, thus causing the system to access additional databases in a cascading manner) to search for additional data.

Block 48 represents the system 10 adding the additional data to the received record (which may by submitted as new record(s) for receipt and processing).

Block 50 represents the system 10 creating and including hash keys for the subsequent cryptographic algorithms. The hash keys may comprise a combination of certain data in the received record, e.g., the first three letters of a rooted first name, first four letters of last name and last five numbers of a social security number.

Any new, modified or enhanced data can be stored in newly created fields to maintain the integrity of the original data. By analyzing and enhancing the identifiers in each record, identifiers corresponding with the same entity are more likely to match (either through the original identifiers or through the new, modified or enhanced data).

Variant Generation

FIG. 4 is a flowchart that illustrates the steps performed by the system 10 when generating and encrypting variants (e.g., common value alternatives or misspellings) for their inclusion with the Anonymized Data in the encrypted record. This provides for enhanced fuzzy matching in the anonymized domain, i.e., post-anonymous fuzzy comparisons without use of pre-anonymization variants.

The present invention applies variants after their anonymization. Previous anonymization techniques apply variants before their anonymization, such as described in U.S. patent application Ser. No. 10/702,624, filed on Nov. 6, 2003, by Jeffrey J. Jonas, entitled “CONFIDENTIAL DATA SHARING AND ANONYMOUS ENTITY RESOLUTION,” which application was published as U.S. Patent Publication No. 2004-0210763, on Oct. 21, 2004, and which application claims the benefit under 35 U.S.C. §119(e) to U.S. Provisional Patent Application Ser. No. 60/424,240, filed on Nov. 6, 2002, by Jeffrey J. Jonas, entitled “CONFIDENTIAL DATA SHARING AND ANONYMOUS ENTITY RESOLUTION,” which applications are incorporated by reference herein.

For example, previous anonymization techniques apply variants before anonymization for name standardization (e.g., comparing an input name to a root names list in order to standardize the input name). As a result, an input of “Bob” is expanded to include “Robert,” and then both values are anonymized (e.g., irreversibly encrypted). This creates extra work for the system 10, expands the size of the record being submitted requiring more space and, when new pre-processing rules are changed (e.g., name rooting table updates), all parties must re-process their records.

The present invention, on the other hand, provides an alternative approach, that solves some fuzzy-matching scenarios (not completely negating current techniques, but rather augmenting them), involves encrypting or anonymizing both primary values and rooted values (e.g., names, day/month of birth dates, etc.) resulting in an encrypted synonym table.

Assume, for example, that “bob”, “bobby” and “robert” are encrypted or anonymized as follows:bob (encrypted)=>rx11ybobby (encrypted)=>77efrobert (encrypted)=>c676

First, a synonym table (also known as an equivalency table or similarities table) is created that associates variants “bob” with “robert” and “bobby” with “robert”, and the synonym table is then encrypted using the irreversible cryptographic algorithm (e.g., one-way function) that is used during the Apply Variants process, in Block 30, wherein the variants within the encrypted synonym table are used to augment the encrypted record.

The encrypted variants applied using the encrypted synonym table as follows:rx11y (variants)=>c676 (i.e., bob=>robert)77ef (variants)=>c676 (i.e., bobby=>robert)

However, the present invention does require pre-computing the encrypted synonym table, using the same secret key (e.g., any combination of “salt”, commutative encryption or other cryptographic technique) that are used with the Enhanced Data. On the other hand, the present invention will work for encrypted variants, such as encrypted name roots, date-of-birth transpositions, sound-alike equivalencies, etc.

Thus, in one embodiment, Block 52 represents the system 10 creating a synonym table including variants. The synonym table could contain variants comprising primary values, such as name roots, date-of-birth transpositions, sound-alike equivalencies, etc. These and other data types subject to the same kind of evaluations are loaded into the synonym table.

Block 54 represents the system 10 pre-processing the synonym table, by encrypting or anonymizing the variants contained therein, to create the encrypted synonym table 32. Thereafter, the system 10 applies the encrypted variants on all or part of the Anonymized Data using the encrypted synonym table 32, for inclusion in the Anonymized Data, as part of the Block 30 in FIG. 1.

Compare Conjoined Data to Previously Stored Data

As noted above, in Blocks 34 and 36 of FIG. 2, the system 10 compares the Conjoined Data with previously stored data, matches any data reflecting the same or related entities, stores the Conjoined Data and any resulting relations and/or matches, and optionally sends one or more messages in response to the resulting relations and/or matches.

For example, an identifier representing the social security number for a natural person type entity is helpful in differentiating between and across entities. In this regard, the system 10 would determine whether the identifier is generally distinctive across entities when performing the comparisons and matches. However, if the system 10 determines that the identifier is not to be considered a generally distinctive identifier, then the 10 system stops matching based upon the identifier and may un-match previous records that were matched based upon the identifier.

These steps are described in more detail in FIGS. 4-7 of U.S. patent application Ser. No. 10/702,624, filed on Nov. 6, 2003, by Jeffrey J. Jonas, entitled “CONFIDENTIAL DATA SHARING AND ANONYMOUS ENTITY RESOLUTION,” which application was published as U.S. Patent Publication No. 2004-0210763, on Oct. 21, 2004, and which application claims the benefit under 35 U.S.C. §119(e) to U.S. Provisional Patent Application Ser. No. 60/424,240, filed on Nov. 6, 2002, by Jeffrey J. Jonas, entitled “CONFIDENTIAL DATA SHARING AND ANONYMOUS ENTITY RESOLUTION,” all of which applications are incorporated by reference herein.

CONCLUSION

This concludes the description of the preferred embodiments of the present invention. The following describes some alternative embodiments for accomplishing the present invention. For example, any type of computer, such as a mainframe, minicomputer, or personal computer, or computer configuration, could be used with the present invention. In addition, many types of databases could benefit from the present invention.

For example, the techniques described herein may be used by any number of different data handling programs (e.g., semantic reconciliation; relationship awareness; data mining; pattern recognition; analysis; transcoding; other data conversion). Indeed, any anonymization matching engine, and all products that emerge in the “analytics in the anonymized data space” technology class could benefit from the present invention. Generally, any service proving anonymized data matching could benefit from this technique.

The foregoing description of embodiments of the invention has been presented for the purposes of illustration and description. It is not intended to be exhaustive or to limit the invention to the precise forms disclosed. Many modifications and variations are possible in light of the above teaching. It is intended that the scope of the invention be limited not by this detailed description, but rather by the claims appended hereto.

Claims

1. A method for processing data, comprising: (a) receiving a record having a plurality of identifiers into a computer system, the record corresponding to an entity;(b) encrypting one or more of the identifiers in the record to form an encrypted record;(c) applying one or more encrypted variants to the encrypted record using the encrypted identifiers to access pre-computed encrypted synonyms from an encrypted synonym table; and(d) comparing the encrypted record to previously stored data using the encrypted identifiers and the encrypted variants in order to the match or associate the encrypted record with the previously stored data, wherein the record is matched with the previously stored data using fuzzy matching through the use of the encrypted identifiers and encrypted variants, without using pre-anonymization variants.

2. The method of claim 1, further comprising the step of converting the record into a standardized message format.

3. The method of claim 1, further comprising the step of enhancing the record by formatting the identifiers in accordance with a user-defined standard.

4. The method of claim 1, wherein the step of comparing the encrypted record to the previously stored data further comprises the step of assigning a persistent key to the encrypted record.

5. The method of claim 4, wherein the persistent key reflects an existing entity when the encrypted record matches the previously stored data.

6. The method of claim 4, wherein the persistent key reflects a new entity when the encrypted record does not match the previously stored data.

7. The method of claim 1, wherein the encrypted variants comprise name roots, date-of-birth transpositions, sound-alike equivalencies, language transliterations, grid coordinates, or other synonyms.

8. The method of claim 1, wherein the encrypted synonym table is created by processing a synonym table using a cryptographic algorithm.

9. The method of claim 8, wherein the synonym table includes the variants.

10. An apparatus for processing data, comprising: a computer system;logic, performed by the computer system, for (a) receiving a record having a plurality of identifiers into a computer system, the record corresponding to an entity;(b) encrypting one or more of the identifiers in the record to form an encrypted record;(c) applying one or more encrypted variants to the encrypted record using the encrypted identifiers to access pre-computed encrypted synonyms from an encrypted synonym table; and(d) comparing the encrypted record to previously stored data using the encrypted identifiers and the encrypted variants in order to the match or associate the encrypted record with the previously stored data, wherein the record is matched with the previously stored data using fuzzy matching through the use of the encrypted identifiers and encrypted variants, without using pre-anonymization variants.

11. The apparatus of claim 10, further comprising logic for converting the record into a standardized message format.

12. The apparatus of claim 10, further comprising logic for enhancing the record by formatting the identifiers in accordance with a user-defined standard.

13. The apparatus of claim 10, wherein the logic for comparing the encrypted record to the previously stored data further comprises the logic for assigning a persistent key to the encrypted record.

14. The apparatus of claim 13, wherein the persistent key reflects an existing entity when the encrypted record matches the previously stored data.

15. The apparatus of claim 13, wherein the persistent key reflects a new entity when the encrypted record does not match the previously stored data.

16. The apparatus of claim 10, wherein the encrypted variants comprise name roots, date-of-birth transpositions, sound-alike equivalencies, language transliterations, or other synonyms.

17. The apparatus of claim 10, wherein the encrypted synonym table is created by processing a synonym table using a cryptographic algorithm.

18. The apparatus of claim 17, wherein the synonym table includes the variants.

19. A computer program product comprising a non-transitory useable medium including computer readable code, wherein the computer read code when executed by a computer causes the computer to perform a method for processing data, comprising: (a) receiving a record having a plurality of identifiers into a computer system, the record corresponding to an entity;(b) encrypting one or more of the identifiers in the record to form an encrypted record;(c) applying one or more encrypted variants to the encrypted record using the encrypted identifiers to access pre-computed encrypted synonyms from an encrypted synonym table; and(d) comparing the encrypted record to previously stored data using the encrypted identifiers and the encrypted variants in order to the match or associate the encrypted record with the previously stored data, wherein the record is matched with the previously stored data using fuzzy matching through the use of the encrypted identifiers and encrypted variants, without using pre-anonymization variants.

20. The article of claim 19, further comprising the step of converting the record into a standardized message format.

21. The article of claim 19, further comprising the step of enhancing the record by formatting the identifiers in accordance with a user-defined standard.

22. The article of claim 19, wherein the step of comparing the encrypted record to the previously stored data further comprises the step of assigning a persistent key to the encrypted record.

23. The article of claim 22, wherein the persistent key reflects an existing entity when the encrypted record matches the previously stored data.

24. The article of claim 22, wherein the persistent key reflects a new entity when the encrypted record does not match the previously stored data.

25. The article of claim 19, wherein the encrypted variants comprise name roots, date-of-birth transpositions, sound-alike equivalencies, language transliterations, or other synonyms.

26. The article of claim 19, wherein the encrypted synonym table is created by processing a synonym table using a cryptographic algorithm.

27. The article of claim 26, wherein the synonym table includes the variants.