Homomorphic Encryption Secure Symbol Comparison
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
There is a need for a method to securely compare two encrypted symbols without using secret keys or decryption, enabling an untrusted party to determine if they are the same, while maintaining data security.
Innovation Solution
The method employs fully homomorphic encryption (FHE) or sufficient somewhat homomorphic encryption (SHE) schemes to perform a sequence of operations on ciphertexts corresponding to the symbols, including EvalAdd and EvalMult operations, to produce an encrypted result that indicates whether the symbols match, which can be decrypted by a trusted party.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If homomorphic encryption operations are performed on ciphertexts to enable secure comparison, then data security is improved, but computational complexity and processing time increase
Solution Approach 1:
The patent segments the symbol comparison task into multiple bitwise operations. Each symbol is processed bit-by-bit through a series of EvalAdd and EvalMult operations, breaking down the complex comparison into manageable sequential steps that can be performed on encrypted data without decryption.
Solution Approach 2:
The patent performs preliminary encoding of symbols into binary representations before encryption. This preliminary action structures the data in a way that enables efficient homomorphic operations, allowing the comparison logic to be implemented through standardized EvalAdd and EvalMult operations rather than complex custom logic.
2Reliability
If sequential EvalAdd and EvalMult operations are performed on ciphertexts, then secure symbol comparison is achieved, but processing time increases
Solution Approach 1:
The comparison process is segmented into discrete bitwise operations that can be executed sequentially. By processing one bit position at a time through standardized EvalAdd and EvalMult operations, the system achieves secure comparison while maintaining a structured approach that could be optimized through parallelization of independent bit operations.
3Reliability
If an untrusted party processes encrypted data without secret keys, then data confidentiality is improved, but the ability to perform meaningful operations on the data is limited
Solution Approach 1:
The patent implements a universal comparison mechanism that works on any encrypted symbolic data through standardized homomorphic operations. The same EvalAdd and EvalMult operations can be applied to compare any two encrypted symbols, making the system adaptable to different data types and scenarios while maintaining confidentiality, thus achieving multi-functionality in secure comparison tasks.
Data Source
AI summary
A method for secure comparison of encrypted symbols. According to one embodiment, a user may encrypt two symbols, share the encrypted symbols with an untrusted third party that can compute algorithms on these symbols without access the original data or encryption keys such that the result of running the algorithm on the encrypted data can be decrypted to a result which is equivalent to the result of running the algorithm on the original unencrypted data. In one embodiment the untrusted third party may perform a sequence of operations on the encrypted symbols to produce an encrypted result which, when decrypted by a trusted party, indicates whether the two symbols are the same.