Node-Group User Intersection With Homomorphic Encryption
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing data processing methods in secure multi-party computation expose participants' private data to excessive access, leading to security risks.
Innovation Solution
A node group-based data processing method involving homomorphic encryption and mapping relationships is employed, where nodes construct mapping relationships, perform homomorphic encryption, and share fragment information to determine a user identifier intersection set without revealing complete identifiers, ensuring privacy and security.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If conventional data processing methods are used, then data processing can be performed, but private data is exposed to excessive access causing security risks
Solution Approach 1:
The patent segments user identifiers into multiple fragments distributed across different nodes. Each node stores only its portion of the identifier fragments, and the complete identifier is reconstructed only when needed for processing. This segmentation prevents any single node from accessing complete private data, thereby resolving the contradiction between enabling data processing and preventing privacy leakage.
Solution Approach 2:
The patent introduces a trusted third party (TTP) as an intermediary that coordinates the data processing operations. The TTP manages the mapping relationships between user identifiers and data locations, facilitates secure communication between nodes, and orchestrates the aggregation process. This intermediary enables data processing while maintaining security by controlling access and ensuring that only authorized operations occur.
2Reliability
If mapping relationships are constructed and homomorphic encryption is performed, then data processing can proceed with privacy protection, but system complexity increases
Solution Approach 1:
The patent employs homomorphic encryption as a universal mechanism that enables multiple data processing operations (comparison, aggregation, filtering) to be performed directly on encrypted data without requiring decryption. This multi-functional approach allows a single encryption scheme to support various processing needs, reducing the need for multiple specialized security mechanisms and thereby managing system complexity while maintaining privacy protection.
Solution Approach 2:
The patent transforms data from plaintext to ciphertext form through homomorphic encryption, changing the parameter state of the data while preserving its computational properties. This parameter change enables secure processing without exposing the actual data values. The system manages complexity by establishing clear protocols for when encryption is applied and how decryption is selectively performed only when necessary, rather than requiring continuous encryption/decryption operations.
3Reliability
If fragment information is shared and aggregated, then user data can be processed securely, but data processing efficiency may be reduced
Solution Approach 1:
The patent performs preliminary actions by pre-establishing mapping relationships between user identifiers and data locations before actual data processing occurs. These pre-computed mappings enable nodes to quickly locate and aggregate the correct fragment information without performing complex search operations during processing. This preliminary preparation significantly reduces the time required for subsequent data aggregation operations, thereby improving processing efficiency while maintaining data integrity through the structured fragment distribution.
Data Source
AI summary
This application relates to a node group-based data processing method performed by a first node in the node group, and includes: constructing, according to a first user identifier, a mapping relationship for mapping the first user identifier to a target value; performing homomorphic encryption on a mapping parameter of the mapping relationship, to obtain a mapping parameter ciphertext, and transferring the mapping parameter ciphertext to the second node in the node group; receiving the reference value and the fragment information returned by the second node; and maintaining, when a result obtained after homomorphic decryption is performed on the reference value is consistent with the target value, the fragment information returned corresponding to the reference value, and triggering the first node to collect fragment information maintained in each first node, to aggregate the collected fragment information to obtain a user identifier intersection set of the node group.