METHOD AND SYSTEM FOR COMPILING A MULTI-SOURCE DATABASE OF COMPOSITE INVESTOR-SPECIFIC DATA RECORDS WITH NO DISCLOSURE OF INVESTOR IDENTITY

• US 20110035414A1
• Filed: 12/29/2009
• Published: 02/10/2011
• Est. Priority Date: 12/29/2008
• Status: Active Grant

• Current Assignee: Plutometry Corporation
• Original Assignee: Plutopian Corporation
• Inventors: O'Hara, Casey V., Goldwasser, Todd, Ketkar, Bhalchandra R., Barton, Samuel G.
• Granted Patent: US 8,478,765 B2
• Time in Patent Office: Days
• US Class Current: 707/802
• CPC Class Codes: G06F 16/22 Indexing; Data structures therefor; Storage structures
• CPC Class Codes: G06F 16/9017 using directory or table look-up use of a directory or look-up table in file systems G06F16/13
• CPC Class Codes: G06F 16/9535 Search customisation based on user profiles and personalisation
• CPC Class Codes: G06F 16/955 using information identifiers, e.g. uniform resource locators [URL]
• CPC Class Codes: G06F 21/6254 by anonymising data, e.g. decorrelating personal data from the owner's identification
• CPC Class Codes: G06Q 30/02 Marketing; Price estimation or determination; Fundraising
• CPC Class Codes: G06Q 30/0201 Market modelling; Market analysis; Collecting market data
• CPC Class Codes: G06Q 30/0203 Market surveys; Market polls
• CPC Class Codes: G06Q 40/06 Asset management; Financial planning or analysis

Abstract

A system and method are disclosed for compiling a database of investor-related data by gathering and linking customer-specific data records from multiple unaffiliated financial institutions, where such data records are coded in such a manner that the database compiler is enabled to link, across data providers and/or time periods, data records that pertain to the same investor without being provided any information that reveals the identity of any investor.

Claims

1. A method of compiling an electronic database of entity-specific information maintained by a plurality of unaffiliated institutions, comprising the steps of:

providing each institution with a computer-based device that provides surrogate entity codes, wherein each surrogate entity code (i) corresponds to a unique value of entity identification information maintained by such institution, and (ii) is generated in such manner that no entity identification information can be derived from such surrogate entity code, and wherein the computer-based devices provide, with respect to any specific value of such entity identification information, surrogate entity codes that are different for each institution but all convertible to a common surrogate entity code;

receiving from each institution a set of data records, each of which contains information that pertains to a particular entity and is associated with a surrogate entity code, but which is otherwise free of entity identification information;

installing in the database the data records provided by the plurality of institutions; and

linking the data records at the entity-specific level by converting the different surrogate entity codes from the different institutions into common surrogate entity codes and then, with respect to each common surrogate entity code, logically associating all data records with which such common surrogate entity code is associated.

2. The method of claim 1 wherein the entity identification information is a person'"'"'s social security number.

3. The method of claim 1 wherein the entity identification information is any one of a person'"'"'s social security number and any other entity'"'"'s taxpayer ID.

4. The method of claim 1 wherein the entity identification information is any one of the entity'"'"'s social security number, taxpayer ID, and mailing address.

5. The method of claim 1 wherein the entity identification information is any combination of information elements that uniquely identifies specific entities that are the subject of the database.

6. The method of claim 1 wherein the computer-based device is a processor having a software module that executes an algorithm to create a surrogate entity code that corresponds to a specific value of entity identification information.

7. The method of claim 6 wherein the execution of the algorithm causes, in succession, (i) an irreversible transformation of the entity identification information that, with respect to any specific value of entity identification information, yields the same output value for each institution, and then (ii) a reversible transformation of the output values of the irreversible transformation that, with respect to any specific output value resulting from the irreversible transformation, yields a different value for each institution.

8. The method of claim 7 wherein the irreversible transformation is a cryptographic hash function.

9. The method of claim 8 wherein a seed is used with the cryptographic hash function.

10. The method of claim 9 wherein the seed is created and distributed to the institutions by a trusted third party.

11. The method of claim 7 wherein the reversible transformation is a cryptographic encryption function.

12. The method of claim 11 wherein a symmetric key is used to seed the cryptographic encryption function.

13. The method of claim 11 wherein an asymmetric key is used to seed the cryptographic encryption function.

14. The method of claim 7 wherein the output values resulting from the reversible transformation function as the surrogate entity codes.

15. The method of claim 14 wherein surrogate entity codes are converted into common surrogate entity codes by reversing the reversible transformation to obtain the output values of the irreversible transformation, and those output values function as the common surrogate entity codes.

16. The method of claim 14 wherein surrogate entity codes are converted into common surrogate entity codes by (i) first reversing the reversible transformation to obtain the output values of the irreversible transformation, and then (ii) performing a second transformation of those output values to yield common surrogate entity codes, generated in such manner that the surrogate entity codes cannot be derived from them.

17. The method of claim 16 in which the second transformation is an irreversible transformation.

18. The method of claim 17 wherein the irreversible transformation is a cryptographic hash function.

19. The method of claim 18 wherein a seed is used with the cryptographic hash function.