Homomorphic Encryption Aggregation via Number Identifier Segmentation
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing homomorphic encryption methods are computationally expensive, making them costly and resource-intensive for organizations to implement, which discourages their use despite their ability to perform computations on encrypted data without decrypting it.
Innovation Solution
A homomorphic encryption system that encrypts numbers using a number identifier and performs mathematical operations with the encrypted number identifier, allowing for efficient aggregation and decryption of encrypted data, reducing computational costs through sequential encryption and compression of identifiers.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If homomorphic encryption is used to encrypt data, then data privacy is preserved during storage and processing, but computational cost increases significantly
Solution Approach 1:
The encryption process is segmented into two distinct parts: (1) encrypting only the number identifier rather than the entire number, and (2) combining the encrypted identifier with the plaintext number using a mathematical operation. This segmentation reduces the amount of data requiring complex homomorphic encryption operations, thereby lowering computational cost while preserving privacy for the identifier portion.
Solution Approach 2:
The invention extracts and separates the number identifier from the main number value. The identifier (which contains the privacy-critical information) is encrypted using homomorphic encryption, while the main value can be processed more efficiently. This extraction allows selective application of expensive encryption only where privacy is most critical.
2Reliability
If traditional homomorphic encryption is used for aggregation, then encrypted data can be processed without decryption, but the computational complexity increases due to complex mathematical operations
Solution Approach 1:
The encryption structure is segmented so that only the identifier portion undergoes complex homomorphic encryption operations, while the value portion uses simpler combining operations. This reduces the overall computational complexity of aggregation operations on encrypted data.
Solution Approach 2:
The invention uses a disposable mathematical operation (XOR or addition) to combine the encrypted identifier with the plaintext value. This simple, computationally inexpensive operation replaces the need for complex homomorphic encryption on the entire data structure, reducing device complexity while maintaining security through the encrypted identifier.
Data Source
AI summary
In some embodiments, an encryption system secures data using a homomorphic encryption. The encryption system encrypts a number by encrypting a number identifier of the number and combining the number and the encrypted number identifier using a mathematical operation to generate an encrypted number. The encrypted numbers may be stored at a server system along with their number identifiers. The server system can then generate an aggregation (e.g., sum) of the encrypted numbers and provide the aggregation, the encrypted numbers, and the number identifiers. The encryption system can then separate the aggregation of the numbers from the aggregation of the encrypted numbers using an inverse of the mathematical operation used in the encryption to effect removal of an aggregation of the encrypted number identifiers of the numbers from the aggregation of the encrypted numbers. The separated aggregation of the numbers is an aggregation of the plurality of the numbers.