US 12,118,125 B1
Method of consortium hashing
Trisha Kothari, San Francisco, CA (US); Jay Crumb, San Francisco, CA (US); Christopher Benjamin James Walton, San Francisco, CA (US); Quinn Flagg, San Francisco, CA (US); Clarence Chio, San Francisco, CA (US); and Dhiraj Bhat, San Francisco, CA (US)
Assigned to Unit21, Inc., San Francisco, CA (US)
Filed by Unit21, Inc., San Francisco, CA (US)
Filed on Feb. 9, 2024, as Appl. No. 18/438,197.
Application 18/438,197 is a continuation of application No. 18/536,591, filed on Dec. 12, 2023.
Int. Cl. G06F 21/62 (2013.01)
CPC G06F 21/6254 (2013.01) [G06F 21/6209 (2013.01)] 9 Claims
OG exemplary drawing
 
1. A method of sharing Personal Identifying Information (“PII”) comprising the steps:
inputting, by a search institution, one or more fields of PII data to be matched;
normalizing said one or more fields of PII data into a standard format;
generating, from said one or more fields of PII data that has been converted into said standard format, one or more data combinations of said PII data;
creating a Bloom filter, wherein said Bloom filter concatenates said one or more data combinations of said PII data;
hashing said one or more concatenated data combinations of said PII data by multiplying said data combinations of said PII data, such that one or more Bloom filter combinations are created;
encoding each of said one or more Bloom filter combinations, such that one or more converted combinations are created;
sending said one or more converted combinations to a matching service;
hashing by a private key said one or more converted combinations, wherein said private key is stored by said matching service;
matching, by said matching service, said one or more hashed converted combinations with a stored hashed file, wherein said stored hashed file is stored on said matching service; and
reporting, by said matching service, to said search institution whether said hashed converted combinations match any of said stored hashed file.