TY - GEN
T1 - Performance evaluation of secure communication systems on turing machines
AU - Boche, Holger
AU - Schaefer, Rafael F.
AU - Poor, H. Vincent
N1 - Publisher Copyright:
© 2018 IEEE.
PY - 2018/7/2
Y1 - 2018/7/2
N2 - Communication systems need to satisfy pre-specified requirements on spectral efficiency and security. Physical layer security is a concept that unifies both and connects them with entropic quantities. This paper presents a frame-work based on Turing machines to address the question of deciding whether or not a communication system meets these requirements. It is known that the class of Turing solvable problems coincides with the class of algorithmically solvable problems so that this framework allows for effective verification of such performance requirements. In this paper, it is shown that certain scenarios such as the wire-tap channel or compound channel are Turing computable so that the corresponding communication protocols can be effectively verified. A condition is presented and proved under which a communication scenario is not Turing computable. The channel with an active jammer falls into this category when deterministic codes are used. Interestingly, random codes robustify the channel with an active jammer in the sense that it becomes Turing computable and the corresponding communication protocol effectively verifiable.
AB - Communication systems need to satisfy pre-specified requirements on spectral efficiency and security. Physical layer security is a concept that unifies both and connects them with entropic quantities. This paper presents a frame-work based on Turing machines to address the question of deciding whether or not a communication system meets these requirements. It is known that the class of Turing solvable problems coincides with the class of algorithmically solvable problems so that this framework allows for effective verification of such performance requirements. In this paper, it is shown that certain scenarios such as the wire-tap channel or compound channel are Turing computable so that the corresponding communication protocols can be effectively verified. A condition is presented and proved under which a communication scenario is not Turing computable. The channel with an active jammer falls into this category when deterministic codes are used. Interestingly, random codes robustify the channel with an active jammer in the sense that it becomes Turing computable and the corresponding communication protocol effectively verifiable.
UR - http://www.scopus.com/inward/record.url?scp=85062865768&partnerID=8YFLogxK
U2 - 10.1109/WIFS.2018.8630789
DO - 10.1109/WIFS.2018.8630789
M3 - Conference contribution
AN - SCOPUS:85062865768
T3 - 10th IEEE International Workshop on Information Forensics and Security, WIFS 2018
BT - 10th IEEE International Workshop on Information Forensics and Security, WIFS 2018
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 10th IEEE International Workshop on Information Forensics and Security, WIFS 2018
Y2 - 10 December 2018 through 13 December 2018
ER -