Secret-Key-Aided Scheme for Securing Untrusted DF Relaying Networks

Handle URI:
http://hdl.handle.net/10754/626541
Title:
Secret-Key-Aided Scheme for Securing Untrusted DF Relaying Networks
Authors:
Shafie, Ahmed El; Salem, Ahmed Sultan; Mabrouk, Asma; Tourki, Kamel; Al-Dhahir, Naofal
Abstract:
This paper proposes a new scheme to secure the transmissions in an untrusted decode-and-forward (DF) relaying network. A legitimate source node, Alice, sends her data to a legitimate destination node, Bob, with the aid of an untrusted DF relay node, Charlie. To secure the transmissions from Charlie during relaying time slots, each data codeword is secured using a secret-key codeword that has been previously shared between Alice and Bob during the perfectly secured time slots (i.e., when the channel secrecy rate is positive). The secret-key bits exchanged between Alice and Bob are stored in a finite-length buffer and are used to secure data transmission whenever needed. We model the secret-key buffer as a queueing system and analyze its Markov chain. Our numerical results show the gains of our proposed scheme relative to benchmarks. Moreover, the proposed scheme achieves an upper bound on the secure throughput.
KAUST Department:
Computer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division
Publisher:
arXiv
Issue Date:
12-Jun-2017
ARXIV:
arXiv:1706.03444
Type:
Preprint
Additional Links:
http://arxiv.org/abs/1706.03444v1; http://arxiv.org/pdf/1706.03444v1
Appears in Collections:
Other/General Submission; Computer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division

Full metadata record

DC FieldValue Language
dc.contributor.authorShafie, Ahmed Elen
dc.contributor.authorSalem, Ahmed Sultanen
dc.contributor.authorMabrouk, Asmaen
dc.contributor.authorTourki, Kamelen
dc.contributor.authorAl-Dhahir, Naofalen
dc.date.accessioned2017-12-28T07:32:15Z-
dc.date.available2017-12-28T07:32:15Z-
dc.date.issued2017-06-12en
dc.identifier.urihttp://hdl.handle.net/10754/626541-
dc.description.abstractThis paper proposes a new scheme to secure the transmissions in an untrusted decode-and-forward (DF) relaying network. A legitimate source node, Alice, sends her data to a legitimate destination node, Bob, with the aid of an untrusted DF relay node, Charlie. To secure the transmissions from Charlie during relaying time slots, each data codeword is secured using a secret-key codeword that has been previously shared between Alice and Bob during the perfectly secured time slots (i.e., when the channel secrecy rate is positive). The secret-key bits exchanged between Alice and Bob are stored in a finite-length buffer and are used to secure data transmission whenever needed. We model the secret-key buffer as a queueing system and analyze its Markov chain. Our numerical results show the gains of our proposed scheme relative to benchmarks. Moreover, the proposed scheme achieves an upper bound on the secure throughput.en
dc.publisherarXiven
dc.relation.urlhttp://arxiv.org/abs/1706.03444v1en
dc.relation.urlhttp://arxiv.org/pdf/1706.03444v1en
dc.rightsArchived with thanks to arXiven
dc.titleSecret-Key-Aided Scheme for Securing Untrusted DF Relaying Networksen
dc.typePreprinten
dc.contributor.departmentComputer, Electrical and Mathematical Sciences and Engineering (CEMSE) Divisionen
dc.eprint.versionPre-printen
dc.contributor.institutionElectrical Engineering Dept., University of Texas at Dallasen
dc.contributor.institutionHANA Research Lab, ENSI, Manouba Universityen
dc.contributor.institutionMathematical and Algorithmic Sciences Lab, France Research Center, Huawei Technologies Co. Ltden
dc.identifier.arxividarXiv:1706.03444en
kaust.authorSalem, Ahmed Sultanen
All Items in KAUST are protected by copyright, with all rights reserved, unless otherwise indicated.