TY - GEN
T1 - Resource Allocation for Secure Communication Systems
T2 - 2019 IEEE International Workshop on Information Forensics and Security, WIFS 2019
AU - Boche, Holger
AU - Schaefer, Rafael F.
AU - Vincent Poor, H.
N1 - Funding Information:
This work of H. Boche was supported in part by the German Federal Ministry of Education and Research (BMBF) within the national initiative for “Molecular Communication (MAMOKO)” under Grant 16KIS0914 and in part by the German Research Foundation (DFG) within the Gottfried Wilhelm Leibniz Prize under Grant BO 1734/20-1 and within Germany’s Excellence Strategy – EXC-2111 – 390814868. This work of R. F. Schaefer was supported in part by the BMBF within the national initiative for “Post Shannon Communication (NewCom)” under Grant 16KIS1004 and in part by the DFG under Grant SCHA 1944/6-1. This work of H. V. Poor was supported by the U.S. National Science Foundation under Grants CCF-0939370 and CCF-1513915.
Publisher Copyright:
© 2019 IEEE.
PY - 2019/12
Y1 - 2019/12
N2 - Medium access control and in particular resource allocation is one of the most important tasks when designing wireless communication systems as it determines the overall performance of a system. For the particular allocation of the available resources it is of crucial importance to know whether or not a channel supports a certain quality-of-service (QoS) requirement. This paper develops a decision framework based on Turing machines and studies the algorithmic decidability of whether or not a QoS requirement is met. Turing machines have no limitations on computational complexity, computing capacity, and storage. They can simulate any given algorithm and therewith characterize the fundamental performance limits for today's digital computers. In this paper, secure communication and identification systems are considered both under channel uncertainty and adversarial attacks. While for perfect channel state information, the question is decidable since the corresponding capacity function is computable, it is shown that the corresponding questions become semidecidable in the case of channel uncertainty and adversarial attacks. This means there exist Turing machines that stop and output the correct answer if and only if a channel supports the given QoS requirement. Interestingly, the opposite question of whether a channel capacity is below a certain threshold is not semidecidable.
AB - Medium access control and in particular resource allocation is one of the most important tasks when designing wireless communication systems as it determines the overall performance of a system. For the particular allocation of the available resources it is of crucial importance to know whether or not a channel supports a certain quality-of-service (QoS) requirement. This paper develops a decision framework based on Turing machines and studies the algorithmic decidability of whether or not a QoS requirement is met. Turing machines have no limitations on computational complexity, computing capacity, and storage. They can simulate any given algorithm and therewith characterize the fundamental performance limits for today's digital computers. In this paper, secure communication and identification systems are considered both under channel uncertainty and adversarial attacks. While for perfect channel state information, the question is decidable since the corresponding capacity function is computable, it is shown that the corresponding questions become semidecidable in the case of channel uncertainty and adversarial attacks. This means there exist Turing machines that stop and output the correct answer if and only if a channel supports the given QoS requirement. Interestingly, the opposite question of whether a channel capacity is below a certain threshold is not semidecidable.
UR - http://www.scopus.com/inward/record.url?scp=85083032235&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85083032235&partnerID=8YFLogxK
U2 - 10.1109/WIFS47025.2019.9035108
DO - 10.1109/WIFS47025.2019.9035108
M3 - Conference contribution
AN - SCOPUS:85083032235
T3 - 2019 IEEE International Workshop on Information Forensics and Security, WIFS 2019
BT - 2019 IEEE International Workshop on Information Forensics and Security, WIFS 2019
PB - Institute of Electrical and Electronics Engineers Inc.
Y2 - 9 December 2019 through 12 December 2019
ER -