Homomorphic Encryption for Secure Multiparty Computation Data Verification
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing secure multiparty computation protocols face challenges in balancing data privacy and credibility, particularly in scenarios where data falsification can occur, and they require significant computational and storage resources due to the use of zero-knowledge proof technology.
Innovation Solution
The implementation of homomorphic encryption and blockchain technology to securely share and verify data, where object data is encrypted using a public key and stored on an authorized server, with verification data used to confirm the authenticity of the ciphertext, thereby ensuring data credibility without relying on zero-knowledge proof.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If zero-knowledge proof technology is used to verify data authenticity, then data credibility is improved, but computational resources and storage resources are significantly increased
Solution Approach 1:
The patent extracts the verification mechanism from the complex zero-knowledge proof system and implements it directly through homomorphic encryption properties. The validator can verify ciphertext authenticity by checking mathematical relationships in the encrypted domain without requiring the computationally intensive zero-knowledge proof protocols, thus reducing computational resource consumption while maintaining verification reliability
Solution Approach 2:
The patent creates a copy of the verification capability within the encrypted domain through homomorphic encryption. Instead of requiring separate verification processes that consume additional computational resources, the encryption scheme itself embeds verifiable properties that allow direct verification of data authenticity, eliminating the need for resource-heavy copying and verification of proof structures
2Reliability
If zero-knowledge proof technology is used to verify data authenticity, then data credibility is improved, but storage resources are significantly increased
Solution Approach 1:
The patent extracts only the essential verification elements from the zero-knowledge proof system and implements them through homomorphic encryption properties. The verification process relies on mathematical relationships inherent in the encrypted data structure rather than storing separate proof structures, significantly reducing storage requirements while maintaining credibility verification capability
Solution Approach 2:
The patent creates a compact representation of verification capability within the ciphertext structure itself through homomorphic encryption. Instead of storing separate copies of proof data and verification structures, the encryption scheme embeds verifiable properties directly in the ciphertext, reducing storage overhead while enabling authenticity verification
3Loss of information
If data is encrypted using homomorphic encryption, then data privacy is protected, but verification of data authenticity becomes more complex
Solution Approach 1:
The patent applies preliminary action by pre-structuring the homomorphic encryption scheme to include inherent verification capabilities. The encryption process is designed to embed mathematical properties that enable direct verification of data authenticity and completeness, eliminating the need for complex post-encryption verification procedures and reducing overall system complexity
Data Source
AI summary
Privacy protection methods, systems, and apparatus, including computer programs encoded on computer storage media, are provided. One of the methods is performed by a second computing device and includes: receiving a data request for object data from a first computing device, wherein the object data is associated with an object and is stored in the second computing device; performing encryption of the object data using a public key associated with the object based on the data request to generate a first ciphertext; obtaining verification data based on the first ciphertext for verifying whether a ciphertext to be verified corresponds to the object data; and sending the verification data to the first computing device for the first computing device to execute a cryptography protocol with a third computing device based on the verification data.


