Quantum Network Key Exchange Without Trusted Relay Nodes
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing quantum key distribution (QKD) networks face limitations in key routing due to the need for trusted relay nodes, which increases costs and vulnerabilities, especially when untrusted or malicious nodes are present, limiting the adoption and confidentiality of key transfers.
Innovation Solution
A method involving an XOR node connected to each QKD network node via conventional links, where relay nodes calculate elementary chains from quantum keys, and the XOR node computes a global chain, which is shared with both the sender and recipient nodes to exchange encryption keys securely, enhancing confidentiality and reducing reliance on trusted relay nodes.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Length of stationary object
If relay nodes are used to extend QKD distance, then communication distance is improved, but security confidentiality deteriorates because relay nodes must be trusted and can access the routed keys
Solution Approach 1:
The patent segments the key routing process by introducing an XOR node that separates key generation from key distribution. Relay nodes only generate quantum keys locally and XOR them with received keys, rather than trusting relay nodes to handle and forward the actual routed keys. This segmentation prevents relay nodes from accessing the complete routed key material.
Solution Approach 2:
The XOR node acts as an intermediary that receives quantum keys from relay nodes, performs XOR operations to derive the routed key, and then distributes the result to the destination. This intermediary mechanism ensures that relay nodes never possess the complete routed key, as they only contribute their local quantum key to the XOR operation.
2Reliability
If trusted relay nodes are implemented to ensure key security, then security confidentiality is improved, but device complexity and cost increase
Solution Approach 1:
The patent implements a self-service mechanism where relay nodes autonomously generate their own quantum keys and perform local XOR operations without requiring external trust verification. Each relay node independently contributes its quantum key to the XOR chain, eliminating the need for complex trust management infrastructure while maintaining security through the mathematical properties of XOR operations.
3Ease of operation
If hop-by-hop encryption is used for key transfer, then key routing is simplified, but security confidentiality deteriorates because each relay node can decrypt and access the routed key
Solution Approach 1:
The patent fundamentally changes the cryptographic parameter from traditional symmetric encryption to XOR-based key combination. Instead of using encryption algorithms that require key management and decryption capabilities at each relay node, the system uses XOR operations that are computationally simple and do not require the relay nodes to possess or process the complete routed key, thereby maintaining simplicity while improving security.
Applied Scientific Principles
This section explains which scientific principles are used to turn an abstract innovation direction into a practical engineering solution.
Function Achieved in This Case
This method enhances the security and efficiency of QKD networks by allowing simultaneous key exchange between sender and recipient nodes, reducing resource consumption, and providing additional encryption keys for future communications, while minimizing the knowledge of keys held by intermediate nodes.
Implementation Method 1
two successive nodes along the path being adapted to generate and share a quantum key through a quantum channel connecting said two nodes
Data Source
Figure 1
Figure 2
Figure 3
AI summary
Method (100) for exchanging, between a transmitter (10) and a recipient (20), first and second quantum keys (K1, Kn) consisting of: calculating (110), by each relay node (30i), an elementary chain (Kei) by summing the quantum keys of the two quantum channels coming from said relay node; calculating (120), by an XOR node, a global chain (K) by summing the elementary chains; extracting (140), by the recipient, the first quantum key (K1) by summing the global chain (K) and the second quantum key (Kn), and, by the transmitter, the second quantum key (Kn) by summing the global chain (K) and the first quantum key (K1).