.png){kind=icon}
.png){kind=icon}
Return
Asymptotically Secure Network Code for Active Attacks
.png){kind=icon}
PRE
AI
DOI：10.1109/TCOMM.2021.3057112.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
When there exists a malicious attacker in the network, we need to be careful of eavesdropping and contamination. This problem is crucial for network communication when the network is realized by a partially trusted relay of quantum key distribution. We discuss the asymptotic rate in a linear network with the secrecy and robustness conditions when the above type of attacker exists. Also, under the same setting, we discuss the asymptotic rate in a linear network when we impose the secrecy condition alone.
Keywords:
Eavesdropping
Receivers
Robustness
Quantum key distribution
Contamination
Unicast
Network coding
Secure network coding
sequential injection
active attack
universal code
asymptotic rate
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
8.3
Papers:
1.2W
Citations:
3.6W