Secret-Key-Aided Scheme for Securing Untrusted DF Relaying Networks
Name:
accepted and early access version.pdf
Size:
162.5Kb
Format:
PDF
Description:
Accepted Manuscript
Type
ArticleDate
2018-01-30Preprint Posting Date
2017-06-12Online Publication Date
2018-01-30Print Publication Date
2018-07Permanent link to this record
http://hdl.handle.net/10754/626541
Metadata
Show full item recordAbstract
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.Citation
Shafie AE, Sultan A, Mabrouk A, Tourki K, Al-Dhahir N (2018) Secret-Key-Aided Scheme for Securing Untrusted DF Relaying Networks. IEEE Transactions on Vehicular Technology 67: 6727–6731. Available: http://dx.doi.org/10.1109/TVT.2018.2799900.Sponsors
This paper was made possible by NPRP grant number 8-627-2-260 from the Qatar National Research Fund (a member of Qatar Foundation). The statements made herein are solely the responsibility of the authors. The review of this paper was coordinated by Prof. J. Li.arXiv
1706.03444Additional Links
https://ieeexplore.ieee.org/document/8275036ae974a485f413a2113503eed53cd6c53
10.1109/TVT.2018.2799900