Homomorphic Encryption Circuit Verification
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current homomorphic encryption schemes lack reliable computer-based verification measures, leading to weak security and privacy guarantees, particularly in settings where distrusting parties must collaborate, necessitating a level of trust that may not be practical.
Innovation Solution
The implementation of privacy-enhancing circuit verification and pseudorandom pseudonyms in fully homomorphic encryption schemes, allowing authorized parties to deduce the number of circuit evaluations without significant computational overhead, and enabling computer systems to verify computations performed by other parties, thereby enhancing data security and privacy.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If existing fully or partially homomorphic encryption schemes are used, then data aggregation can be performed, but security and privacy guarantees are weak due to lack of verification measures
Solution Approach 1:
The patent applies preliminary action by embedding verification markers into the encrypted data structure before the homomorphic evaluation process. These markers are pre-positioned in a way that allows later verification of the computation path without requiring additional trust assumptions during the actual computation phase.
Solution Approach 2:
The patent introduces an intermediary verification mechanism that acts as a mediator between the encrypted data and the decryption process. This intermediary layer provides computer-verifiable evidence that the homomorphic operations were performed correctly, enabling security guarantees without requiring the decryptor to trust the evaluator.
2Reliability
If trust is required among distrusting parties for homomorphic encryption, then security can be maintained, but practicality is reduced in competitive collaboration scenarios
Solution Approach 1:
The patent enables self-service verification where the encrypted data structure carries its own verification evidence. The computation path markers are embedded such that the system itself provides the means for verification, eliminating the need for external trust relationships or manual verification processes between distrusting parties.
Solution Approach 2:
The patent implements a feedback mechanism where the verification markers provide information back to the decryptor about the computation history. This feedback loop allows the system to automatically verify that the homomorphic operations were performed as intended, enabling distrusting parties to collaborate without requiring mutual trust.
3Reliability
If computer-based verification of homomorphic operations is implemented, then security is improved, but computational overhead increases
Solution Approach 1:
The patent applies partial action by implementing verification only for the critical computation path through embedded markers, rather than requiring full verification of all homomorphic operations. This selective verification approach provides sufficient security guarantees while minimizing the computational overhead associated with complete verification.
Data Source
AI summary
A method of improving data security or privacy in a computing environment includes providing a group identifier value to at least a first user of one or more users and associating a first pseudonym with the first user. The method further includes encrypting a first data set according to a private key and marking the encrypted first data set according to the group identifier and the first pseudonym. The method also includes performing a first operation on the encrypted first data set and transforming the encrypted first data set into an encrypted second data set according to the first operation performed and the first pseudonym, decrypting the encrypted second data set using the private key, and analyzing the decrypted second data set.