Home > Research > Publications & Outputs > Rethinking the intercept probability of random ...

Electronic data

  • CL2015_1842_CameraReady

    Rights statement: ©2015 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.

    Accepted author manuscript, 143 KB, PDF document

    Available under license: CC BY: Creative Commons Attribution 4.0 International License

Links

Text available via DOI:

View graph of relations

Rethinking the intercept probability of random linear network coding

Research output: Contribution to journalJournal article

Published

Standard

Rethinking the intercept probability of random linear network coding. / Khan, Amjad; Tassi, Andrea; Chatzigeorgiou, Ioannis.

In: IEEE Communications Letters, Vol. 19, No. 10, 08.10.2015, p. 1762-1765.

Research output: Contribution to journalJournal article

Harvard

APA

Vancouver

Author

Bibtex

@article{4041532a63a14acf909ed180e68c3ad6,
title = "Rethinking the intercept probability of random linear network coding",
abstract = "This paper 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.",
author = "Amjad Khan and Andrea Tassi and Ioannis Chatzigeorgiou",
note = "{\circledC}2015 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.",
year = "2015",
month = "10",
day = "8",
doi = "10.1109/LCOMM.2015.2470662",
language = "English",
volume = "19",
pages = "1762--1765",
journal = "IEEE Communications Letters",
issn = "1089-7798",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "10",

}

RIS

TY - JOUR

T1 - Rethinking the intercept probability of random linear network coding

AU - Khan, Amjad

AU - Tassi, Andrea

AU - Chatzigeorgiou, Ioannis

N1 - ©2015 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.

PY - 2015/10/8

Y1 - 2015/10/8

N2 - This paper 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.

AB - This paper 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.

U2 - 10.1109/LCOMM.2015.2470662

DO - 10.1109/LCOMM.2015.2470662

M3 - Journal article

VL - 19

SP - 1762

EP - 1765

JO - IEEE Communications Letters

JF - IEEE Communications Letters

SN - 1089-7798

IS - 10

ER -