Encryption Node Pre-computes Noise Factors for Homomorphic Throughput
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current homomorphic encryption methods, such as the Paillier cryptosystem, are complex and time-consuming, limiting their use in high-throughput data processing scenarios, particularly in cloud environments where high data throughput is required for big data analytics.
Innovation Solution
An encryption node pre-computes a set of noise factors and selects a subset to compute a total noise factor on the fly, reducing the time needed for encryption operations, allowing for higher throughput by using these pre-computed noise factors to generate cipher texts efficiently.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If homomorphic encryption methods (e.g., Paillier cryptosystem) are used to encrypt data before processing in cloud environments, then data security and privacy are improved, but encryption complexity and processing time increase significantly
Solution Approach 1:
The patent applies preliminary action by pre-computing noise factors (s1, s2, ..., sk) before the actual encryption process. These pre-computed noise factors are stored and can be quickly combined during encryption without performing full modular exponentiation operations at encryption time, thus reducing the computational complexity while maintaining security
Solution Approach 2:
The patent segments the encryption process into distinct components: pre-computed noise factors (s1, s2, ..., sk) and message-related computations. By separating the noise generation into pre-computed segments, the system reduces the computational burden during actual encryption operations, addressing the complexity issue while preserving the homomorphic properties
2Reliability
If homomorphic encryption methods are used to protect sensitive data in cloud environments, then data privacy is improved, but encryption processing speed decreases
Solution Approach 1:
The patent significantly improves encryption throughput by performing preliminary computation of noise factors before encryption requests arrive. The pre-computed noise factors (s1, s2, ..., sk) are stored in memory and can be rapidly combined using simple modular multiplication during encryption, rather than performing computationally intensive modular exponentiation operations in real-time, thus achieving high throughput while maintaining strong privacy protection
Solution Approach 2:
The patent creates reusable copies of noise factors that can be combined in different ways for different encryption operations. Instead of generating new noise factors from scratch for each encryption, the system uses pre-computed copies (s1, s2, ..., sk) that can be efficiently combined through modular multiplication, dramatically increasing encryption speed while maintaining the cryptographic security required for data privacy
3Ease of operation
If traditional encryption methods are used where data must be decrypted before processing, then computational operations are simpler, but data exposure risk increases during decryption
Solution Approach 1:
The patent introduces an intermediary approach by using pre-computed noise factors as mediators between the plaintext message and the ciphertext. These noise factors enable homomorphic operations to be performed on encrypted data without decryption, acting as an intermediate computational layer that preserves data privacy while allowing necessary processing operations to occur on the encrypted values
Data Source
AI summary
A method and encryption node (300) for providing encryption of a message m according to a selected encryption scheme. A set of k noise factors are pre-compiled (3:1) from random numbers and predefined integer parameters of the selected encryption scheme by the encryption node (300) in advance. The k noise factors are saved (300a) to be used for encrypting the message m when later requested (3:2) by a client (302). A subset of/noise factors are then selected (3:3) out of the pre-computed set of k noise factors and used as input to the encryption scheme when encrypting (3:5) the message m by computing a cipher text c which is delivered (3:6) as an encrypted message, e.g. to the client (302). Thereby, less time needs to be spent for computing the necessary noise factors after receiving the encryption request and higher throughput can thus be achieved for messages to be encrypted. In particular, the solution may be used to increase the throughput for a stream of messages.