Homomorphic Encryption Processing for Secure Distance Calculation
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing encryption techniques, such as fully homomorphic encryption, require large sizes of encrypted vector data and significant calculation time for secure distance calculations in biometric authentication and tag search systems, making them inefficient.
Innovation Solution
The use of ideal-lattice-based somewhat homomorphic encryption, which converts vectors into polynomials and employs homomorphic encryption for polynomial arithmetic operations, reduces the size of encrypted data and calculation time by encrypting conversion polynomials and weights, allowing for efficient secure distance calculations like Hamming distances without decrypting the data.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If fully homomorphic encryption is used for secure distance calculations, then data confidentiality is maintained, but encrypted data size and calculation time become excessively large
Solution Approach 1:
The patent segments the encryption process by converting vectors into polynomials with limited degrees, encrypting only the necessary polynomial coefficients, and performing calculations on these segmented representations. This reduces the overall encrypted data size while maintaining security through the homomorphic properties of the polynomial encryptions.
Solution Approach 2:
The patent changes the parameter representation from direct vector encryption to polynomial-based encryption. By representing vectors as polynomials with specific degree constraints and encrypting the polynomial coefficients, the system achieves more efficient encryption size and calculation performance while preserving data confidentiality.
2Reliability
If fully homomorphic encryption is used for secure distance calculations, then data confidentiality is maintained, but calculation time becomes excessively long
Solution Approach 1:
The patent segments the calculation process by breaking down vector operations into polynomial operations. By performing homomorphic encryption on polynomial coefficients and using the homomorphic properties to compute secure distances directly on encrypted polynomials, the system reduces calculation time compared to traditional fully homomorphic encryption approaches.
Solution Approach 2:
The patent changes the computational parameters by using polynomial representations with controlled degrees and coefficients. This parameter transformation enables more efficient homomorphic operations and reduces the computational complexity and time required for secure distance calculations while maintaining data confidentiality.
3Ease of manufacture
If traditional encryption methods are used, then implementation is simple, but secure distance calculations cannot be performed on encrypted data
Solution Approach 1:
The patent creates a universal system where the same polynomial-based homomorphic encryption framework can handle both the encryption/decryption function and the secure distance calculation function. By designing the encryption to work on polynomials that represent vectors, the system achieves multi-functionality, enabling secure distance calculations on encrypted data while maintaining a relatively simple implementation structure.
Data Source
AI summary
A device that uses homomorphic encryption is disclosed. The device obtains a first encrypted polynomial, a second encrypted polynomial, a first encrypted weight, and a second encrypted weight by respectively encrypting a first polynomial, a second polynomial, a first weight, and a second weight by using a homomorphic encryption scheme, and obtains an encrypted secure distance corresponding to encryption of a secure distance.