Quantum Key Distribution Relay Network with Path Diversity
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current quantum cryptography systems face challenges in securely sharing random numbers over long distances, particularly when some relay parties are compromised, as the confidentiality of shared random numbers can be compromised if any relay party is hacked.
Innovation Solution
An information sharing system that uses multiple paths and relay devices to share secret information, where each device shares secret information with adjacent relay devices and generates public information through XOR operations, ensuring that even if some relay devices are wiretapped, the shared information remains secure as long as there is a path through untapped devices.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Length of stationary object
If a relay scheme is used to extend the distance for random number sharing, then the sharing distance is improved, but the system reliability deteriorates because any compromised relay party can compromise the shared random numbers
Solution Approach 1:
The patent divides the communication path into multiple independent segments, each protected by quantum key distribution between adjacent nodes. By segmenting the long path into shorter segments with individual key sharing, the system maintains security even when some relay nodes are compromised, as each segment can be independently protected.
Solution Approach 2:
The patent introduces a path diversity dimension by establishing multiple alternative paths between the two ends. This allows the system to switch between different paths based on the reliability status of relay nodes, adding a dimensional approach to security that goes beyond simple distance extension.
2Length of stationary object
If multiple relay parties are used to share random numbers over long distances, then the sharing distance is improved, but the device complexity increases due to multiple XOR operations and public information transmissions
Solution Approach 1:
The patent employs partial action by having relay nodes perform only the necessary XOR operations with adjacent nodes rather than processing the entire path. Each relay node operates locally with minimal computation, and the system achieves the overall goal through the collective partial actions of multiple nodes, reducing individual complexity while maintaining long-distance capability.
Data Source
AI summary
A first information sharing device shares secret information with each relay device adjacent to the first information sharing device along a plurality of paths. A second information sharing device shares secret information with each relay device adjacent to the second information sharing device along the plurality of path. Each of the plurality of relay devices shares secret information with each relay device adjacent to each of the relay devices along the plurality of paths, generates public information using the shared secret information, and transmits the generated public information to the second information sharing device. The first information sharing device generates shared information using the secret information shared with each relay device adjacent to the first information sharing device along the plurality of paths. The second information sharing device generates shared information using the secret information shared with each relay device adjacent to the second information sharing device along the plurality of paths and the public information received from the relay device.