Domain Homomorphic Key Management for Efficient Privacy Computation
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing communication networks face challenges in efficiently managing homomorphic task keys to support privacy computation while ensuring data security and privacy, particularly in the context of emerging applications like immersive extended reality (XR) and digital twins, where data privacy protection is critical.
Innovation Solution
A domain-based key management method is introduced, where each domain corresponds to a single homomorphic encryption key, reducing the number of keys and enhancing reusability and efficiency by decoupling keys from user status and tasks, and allowing for secure key distribution and management across network architecture layers and service types.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If a user-level homomorphic encryption key is used (each homomorphic encryption party corresponds to one homomorphic encryption key), then user-specific security is improved, but the quantity of homomorphic encryption keys increases, leading to increased derivation of homomorphic computation keys and reduced computation efficiency
Solution Approach 1:
The patent segments the key management system into domain-level keys and user-level keys. Domain-level homomorphic encryption keys are shared across multiple users within the same domain, while user-specific security is maintained through separate user keys. This segmentation reduces the total number of domain keys from O(n) to O(1) per domain, significantly decreasing the derivation overhead of homomorphic computation keys while preserving user-specific security through the user key layer.
Solution Approach 2:
The patent merges multiple user-specific domain keys into a single shared domain key for all users within a domain. Instead of each user having a separate domain key, all users in the same domain share the same domain-level homomorphic encryption key. This merging reduces key quantity and derivation complexity while maintaining security through the combination of shared domain keys and individual user keys.
2Reliability
If user-specific homomorphic encryption keys are used, then security is improved, but key derivation complexity and communication overhead increase
Solution Approach 1:
The patent segments key management into two layers: domain-level keys for efficient shared encryption across users, and user-level keys for individual security. This segmentation reduces key derivation complexity at the domain level while maintaining user-specific security through the user key layer, balancing security requirements with operational simplicity.
Solution Approach 2:
The patent introduces domain keys as intermediary elements that mediate between the network infrastructure and individual users. Instead of directly managing complex user-specific domain keys, the system uses domain-level keys as intermediaries that simplify key derivation and distribution, reducing overall system complexity while maintaining security through the intermediary layer.
3Productivity
If domain-based key management is implemented, then key reusability and computation efficiency are improved, but key management structure complexity increases
Solution Approach 1:
The patent implements domain-level homomorphic encryption keys that serve multiple users within the same domain, providing universal key functionality. A single domain key can be reused across multiple users and multiple homomorphic encryption operations, significantly improving key reusability and reducing derivation overhead while maintaining a manageable key management structure through domain-based organization.
4Reliability
If more homomorphic encryption keys are used for user-specific security, then security is improved, but communication overhead and key exchange increase
Solution Approach 1:
The patent merges user-specific domain key requirements into shared domain-level keys. Instead of each user requiring separate domain key exchanges, all users within a domain share the same domain key, significantly reducing communication overhead and key exchange operations while maintaining privacy protection through the combination of shared domain keys and individual user keys.
Data Source
AI summary
The method includes: A first control network element obtains a first homomorphic encryption key corresponding to a first domain; the first control network element sends the first homomorphic encryption key to M first homomorphic enabling units belonging to the first domain, where M is an integer greater than or equal to 1; and the first control network element sends a first homomorphic computation key to N second homomorphic enabling units belonging to the first domain, where N is an integer greater than or equal to 1, and the first homomorphic computation key is determined based on the first homomorphic encryption key and/or a first homomorphic decryption key corresponding to the first homomorphic encryption key.


