Universal Reference Token Matching for Secure Data Reconciliation
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Entities face inefficiencies and risks in reconciling incomplete and inconsistent data records, leading to decreased data integrity and potential exposure of personally identifiable information during manual matching processes.
Innovation Solution
Implementing a system that uses a universal reference token repository for secure data matching, where client and reference source data are tokenized and encrypted, enabling efficient data consolidation and enrichment through A-B matching and transitive matching algorithms, while maintaining data security.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Loss of information
If manual record combination is performed to reconcile incomplete data records, then data completeness can be improved, but time consumption and operational complexity increase significantly
Solution Approach 1:
The patent introduces a third-party consolidation platform as an intermediary that receives data from multiple sources, performs automated matching and reconciliation, and returns consolidated results. This mediator handles the complex task of combining incomplete records from different entities, saving significant time and resources while improving data completeness.
Solution Approach 2:
The patent replaces manual mechanical processes of record combination with automated computational systems. Algorithms automatically match records across different data sources, compare data elements, and consolidate information without human intervention, dramatically reducing time consumption while maintaining or improving data completeness.
2Reliability
If manual data matching processes are implemented to reconcile records, then data reconciliation can be performed, but exposure of personally identifiable information increases
Solution Approach 1:
The consolidation platform acts as a secure intermediary that processes data without requiring direct access to sensitive PII between participating entities. Data is transmitted through the platform which performs matching using hashed or encrypted identifiers, ensuring that no single entity gains unauthorized access to other entities' sensitive information while still enabling reliable reconciliation.
Solution Approach 2:
The patent uses copies of data (such as hashed versions, encrypted replicas, or anonymized duplicates) instead of original sensitive records for the matching process. These copies contain sufficient information for reconciliation but cannot be reverse-engineered to reveal original PII, thus maintaining data reliability while minimizing security risks.
3Loss of information
If multiple incomplete records are matched to the same data subject, then data consolidation can be achieved, but data integrity may be compromised due to inconsistencies
Solution Approach 1:
The patent implements feedback mechanisms where the system continuously monitors and evaluates the quality, consistency, and reliability of matched records. When inconsistencies are detected during the consolidation process, the system can request additional verification, adjust matching thresholds, or flag records for manual review, ensuring that data integrity is maintained while achieving comprehensive consolidation.
Data Source
AI summary
The present disclosure is directed to systems and methods for reference source matching. Specifically, the systems and methods disclosed enable matching among tokens using a reference source. In one example, a Consolidation Platform may receive tokens from a customer environment and tokens from a reference source environment. The customer tokens may be compared to each other using AB matching. If a match does not occur, the customer tokens may further be compared to the reference source tokens via transitive matching. If a match does occur, then the customer tokens may be denoted as a match. In further example aspects, the reference source may be a universal reference token repository that comprises unique tokens. If, after a match is indicated, the matched token(s) may be compared to the universal reference token repository. If the matched token(s) does not exist, it may be added to the repository for future use.