Rethinking the Intercept Probability of Random Linear Network Coding
Cryptography and Security
2022-03-08 v1 Information Theory
Networking and Internet Architecture
Performance
math.IT
Abstract
This letter considers a network comprising a transmitter, which employs random linear network coding to encode a message, a legitimate receiver, which can recover the message if it gathers a sufficient number of linearly independent coded packets, and an eavesdropper. Closed-form expressions for the probability of the eavesdropper intercepting enough coded packets to recover the message are derived. Transmission with and without feedback is studied. Furthermore, an optimization model that minimizes the intercept probability under delay and reliability constraints is presented. Results validate the proposed analysis and quantify the secrecy gain offered by a feedback link from the legitimate receiver.
Keywords
Cite
@article{arxiv.1508.03664,
title = {Rethinking the Intercept Probability of Random Linear Network Coding},
author = {Amjad Saeed Khan and Andrea Tassi and Ioannis Chatzigeorgiou},
journal= {arXiv preprint arXiv:1508.03664},
year = {2022}
}
Comments
IEEE Communications Letters, to appear