Privacy-Preserving Data Validation Using Hashed Modulo Values
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing computing systems face challenges in securely and efficiently sharing and validating sensitive information, as traditional encryption methods like homomorphic encryption impose significant performance penalties and risk unauthorized disclosure of sensitive data.
Innovation Solution
The method involves generating hashed values of sensitive data items and calculating modulo values using prime numbers, which are then used to validate the data without exposing the underlying information, allowing for secure and efficient cross-verification across service providers while maintaining privacy.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If homomorphic encryption schemes are used to perform operations on encrypted data without decryption, then data security is improved, but computation overhead increases significantly
Solution Approach 1:
The patent extracts only the essential validation functionality from homomorphic encryption by using simple hashing and modulo operations instead of full homomorphic encryption schemes. This allows the system to achieve the necessary security for validation purposes without the excessive computational overhead of performing complex operations on encrypted data.
Solution Approach 2:
The patent uses computationally inexpensive hashing functions and modulo operations as disposable preprocessing steps before data transmission. These lightweight operations provide sufficient security for the validation use case without the heavy computational burden of homomorphic encryption, enabling efficient cross-provider validation.
2Reliability
If homomorphic encryption schemes are used to perform operations on encrypted data, then data security is improved, but power usage increases
Solution Approach 1:
The patent extracts only the essential validation functionality from homomorphic encryption by using simple hashing and modulo operations instead of full homomorphic encryption schemes. This allows the system to achieve the necessary security for validation purposes without the excessive computational overhead of performing complex operations on encrypted data.
Solution Approach 2:
The patent uses computationally inexpensive hashing functions and modulo operations as disposable preprocessing steps before data transmission. These lightweight operations provide sufficient security for the validation use case without the heavy computational burden of homomorphic encryption, enabling efficient cross-provider validation.
3Reliability
If traditional encryption methods are used to secure sensitive information in transit, then data security is improved, but the recipient system becomes an avenue for unauthorized disclosure
Solution Approach 1:
The patent extracts only the essential validation functionality from homomorphic encryption by using simple hashing and modulo operations instead of full homomorphic encryption schemes. This allows the system to achieve the necessary security for validation purposes without the excessive computational overhead of performing complex operations on encrypted data.
Solution Approach 2:
The patent uses computationally inexpensive hashing functions and modulo operations as disposable preprocessing steps before data transmission. These lightweight operations provide sufficient security for the validation use case without the heavy computational burden of homomorphic encryption, enabling efficient cross-provider validation.
4Ease of operation
If sensitive data is decrypted by the recipient system before processing, then data usability is improved, but security against unauthorized disclosure deteriorates
Solution Approach 1:
The patent extracts only the essential validation functionality from homomorphic encryption by using simple hashing and modulo operations instead of full homomorphic encryption schemes. This allows the system to achieve the necessary security for validation purposes without the excessive computational overhead of performing complex operations on encrypted data.
Solution Approach 2:
The patent uses computationally inexpensive hashing functions and modulo operations as disposable preprocessing steps before data transmission. These lightweight operations provide sufficient security for the validation use case without the heavy computational burden of homomorphic encryption, enabling efficient cross-provider validation.
Data Source
AI summary
Certain aspects of the present disclosure provide techniques for privacy preserving sharing and validation of sensitive information in a computing environment. An example method generally includes generating a hashed value of a sensitive data item. A set of modulo values is calculated for the hashed value of the first sensitive data item using a set of prime numbers between an upper bound number and a lower bound number. A request to validate the first sensitive data item is transmitted to a target computing system. The request includes the set of prime numbers and the set of modulo values. An indication of whether a match was found for each respective modulo value in the set of modulo values is received from the target computing system, and a request associated with the first sensitive data item is processed based on the indication.