Anonymous User Profile Verification via Distributed Hash Comparison
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing methods for verifying user profile data are often insecure, inefficient, and prone to errors, with users' data being accessed without their control, leading to potential identity theft and misuse.
Innovation Solution
A method involving encryption of user profile data using a public key, transmission to a relying party for decryption and verification against a hash value stored in a distributed database, ensuring secure and anonymous data handling.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If user profile data is accessed without user control for verification, then verification efficiency is improved, but user security and privacy are compromised
Solution Approach 1:
The patent segments user data into two distinct components: the original user profile data stored securely with the user, and cryptographic hash values stored on the distributed database. This segmentation allows verification operations to act on the hash values without exposing the actual user data, thereby maintaining verification efficiency while protecting user privacy and security.
Solution Approach 2:
The patent introduces cryptographic hash values as an intermediary element between the user profile data and the verification process. The hash values serve as a mediator that enables third-party verification without requiring direct access to the sensitive user data, thus resolving the contradiction between efficient verification and data security.
2Object-affected harmful factors
If user profile data is encrypted and transmitted to relying parties, then data security is improved, but verification complexity increases
Solution Approach 1:
The patent applies preliminary action by pre-computing and storing cryptographic hash values of user profile data on the distributed database before any verification requests occur. When verification is needed, the system only needs to retrieve and compare these pre-stored hash values, which simplifies the verification process despite the encryption of original data.
Solution Approach 2:
The patent creates a cryptographic copy (hash value) of the user profile data that can be independently verified without accessing the original encrypted data. This copying approach allows relying parties to perform verification operations on the hash copy, reducing the complexity of handling encrypted data while maintaining security.
3Reliability
If hash values are stored on a distributed database for verification, then data integrity is improved, but storage requirements increase
Solution Approach 1:
The patent treats cryptographic hash values as lightweight, disposable data structures that can be freely replicated across the distributed database. These hash values occupy minimal storage space compared to actual user profile data, and their replication across multiple nodes enables integrity verification without significantly increasing overall storage requirements.
Data Source
AI summary
In some embodiments, a method can include retrieving, from a data management server, a public key associated with a relying party. The method can further include encrypting and using the public key, a user profile data to define encrypted user profile data. The method can further include transmitting, via the data management server, the encrypted user profile data to a compute device associated with the relying party that (1) decrypts the encrypted user profile data using a private key corresponding to the public key to define decrypted user profile data, (2) generates a hash value of the decrypted user profile data, and (3) compares the hash value of the decrypted user profile data and a hash value of the user profile data stored in a distributed database to determine integrity of the decrypted user profile data.