Homomorphic Matrix Multiplication Without Decryption Overhead
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing encryption technologies require decryption of encrypted data for operations, leading to resource waste and potential data leakage risks, especially when operated by untrusted servers.
Innovation Solution
An operation apparatus and method for performing matrix multiplication in homomorphic encryption, allowing operations on encrypted data without decryption, using a processor to generate and manipulate homomorphic ciphertexts through specific matrix operations and masking techniques.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If traditional encryption technology is used, then data security is maintained during transmission, but decryption is required for operations leading to resource waste and potential data leakage
Solution Approach 1:
The patent applies preliminary action by pre-encrypting data using homomorphic encryption before transmission, enabling operations to be performed on encrypted data without requiring decryption. This resolves the contradiction by maintaining data security throughout the entire processing pipeline while eliminating the time-consuming decryption step that traditionally precedes operations.
Solution Approach 2:
The patent introduces homomorphic encryption as an intermediary mechanism that allows untrusted servers to perform computations on encrypted data. This mediator enables secure cloud computing by allowing operations on ciphertexts directly, thus maintaining security while avoiding the need to decrypt data before processing, thereby eliminating both security risks and decryption time overhead.
2Ease of operation
If decryption is performed for operations, then data can be processed, but resource waste occurs and data leakage risk increases
Solution Approach 1:
The patent applies preliminary action by pre-encrypting data using homomorphic encryption before transmission, enabling operations to be performed on encrypted data without requiring decryption. This resolves the contradiction by maintaining data security throughout the entire processing pipeline while eliminating the time-consuming decryption step that traditionally precedes operations.
Solution Approach 2:
The patent introduces homomorphic encryption as an intermediary mechanism that allows untrusted servers to perform computations on encrypted data. This mediator enables secure cloud computing by allowing operations on ciphertexts directly, thus maintaining security while avoiding the need to decrypt data before processing, thereby eliminating both security risks and decryption time overhead.
3Reliability
If homomorphic encryption is used for matrix multiplication, then data security is maintained during computation, but computational complexity increases
Solution Approach 1:
The patent applies segmentation by dividing the large-scale matrix multiplication operation into smaller sub-matrix operations. The first matrix is divided into multiple first sub-matrices and the second matrix into multiple second sub-matrices, which are then processed in parallel. This segmentation reduces the computational complexity of each individual homomorphic encryption operation while maintaining overall data security, as each sub-operation can be performed independently on encrypted data.
Data Source
AI summary
An operation apparatus performing matrix multiplication of a homomorphic encryption is disclosed. The operation apparatus includes a memory configured to store at least one instruction and a plurality of homomorphic ciphertexts, and a processor configured to execute the at least one instruction. The processor is configured to generate first matrix data having a row of a predetermined size and a column of a predetermined size using the plurality of homomorphic ciphertexts, generate a plurality of third matrix data having a row which is the size of the predetermined column and the column of the predetermined size by arranging second matrix data having a row which is 1/n size of the predetermined column and the column of the predetermined size sequentially n-times, and perform a homomorphic multiplication operation between same rows and same columns using the first matrix data and the generated respective third matrix data.


