Principles of Physical Layer Security in Multiuser Wireless Networks: A Survey

This paper provides a comprehensive review of the domain of physical layer security in multiuser wireless networks. The essential premise of physical-layer security is to enable the exchange of confidential messages over a wireless medium in the presence of unauthorized eavesdroppers without relying on higher-layer encryption. This can be achieved primarily in two ways: without the need for a secret key by intelligently designing transmit coding strategies, or by exploiting the wireless communication medium to develop secret keys over public channels. The survey begins with an overview of the foundations dating back to the pioneering work of Shannon and Wyner on information-theoretic security. We then describe the evolution of secure transmission strategies from point-to-point channels to multiple-antenna systems, followed by generalizations to multiuser broadcast, multiple-access, interference, and relay networks. Secret-key generation and establishment protocols based on physical layer mechanisms are subsequently covered. Approaches for secrecy based on channel coding design are then examined, along with a description of inter-disciplinary approaches based on game theory and stochastic geometry. The associated problem of physical-layer message authentication is also introduced briefly. The survey concludes with observations on potential research directions in this area.Comment: 23 pages, 10 figures, 303 refs. arXiv admin note: text overlap with arXiv:1303.1609 by other authors. IEEE Communications Surveys and Tutorials, 201

Securing Cognitive Radio Networks using blockchains

Due to the increase in industrial applications of Internet of Things (IoT), number of internet connected devices have been increased accordingly. This has resulted in big challenges in terms of accessibility, scalability, connectivity and adaptability. IoT is capable of creating connections between devices on wireless medium but the utilization of scarce spectrum in efficient manner for the establishment of these connections is the biggest concern. To accommodate spectrum allocation problem different radio technologies are being utilized. One of the most efficient technique being used is cognitive radio, which dynamically allocate the unlicensed spectrum for IoT applications. Spectrum sensing being the fundamental component of Cognitive Radio Network (CRN) is threatened by security attacks. Process of spectrum sensing is disturbed by the malicious user (MU) which attacks the primary signal detection and affects the accuracy of sensing outcome. The presence of such MU in system, sending false sensing data can degrade the performance of cognitive radios. Therefore, in this article a blockchain based method is proposed for the MU detection in network. By using this method an MU can easily be discriminated from a reliable user through cryptographic keys. The efficiency of the proposed mechanism is analyzed through proper simulations using MATLAB. Consequently, this mechanism can be deployed for the validation of participating users in the process of spectrum sensing in CRN for IoTs.publishe

Spectrum Sensing and Security Challenges and Solutions: Contemporary Affirmation of the Recent Literature

Cognitive radio (CR) has been recently proposed as a promising technology to improve spectrum utilization by enabling secondary access to unused licensed bands. A prerequisite to this secondary access is having no interference to the primary system. This requirement makes spectrum sensing a key function in cognitive radio systems. Among common spectrum sensing techniques, energy detection is an engaging method due to its simplicity and efficiency. However, the major disadvantage of energy detection is the hidden node problem, in which the sensing node cannot distinguish between an idle and a deeply faded or shadowed band. Cooperative spectrum sensing (CSS) which uses a distributed detection model has been considered to overcome that problem. On other dimension of this cooperative spectrum sensing, this is vulnerable to sensing data falsification attacks due to the distributed nature of cooperative spectrum sensing. As the goal of a sensing data falsification attack is to cause an incorrect decision on the presence/absence of a PU signal, malicious or compromised SUs may intentionally distort the measured RSSs and share them with other SUs. Then, the effect of erroneous sensing results propagates to the entire CRN. This type of attacks can be easily launched since the openness of programmable software defined radio (SDR) devices makes it easy for (malicious or compromised) SUs to access low layer protocol stacks, such as PHY and MAC. However, detecting such attacks is challenging due to the lack of coordination between PUs and SUs, and unpredictability in wireless channel signal propagation, thus calling for efficient mechanisms to protect CRNs. Here in this paper we attempt to perform contemporary affirmation of the recent literature of benchmarking strategies that enable the trusted and secure cooperative spectrum sensing among Cognitive Radios

Wireless communication, sensing, and REM: A security perspective

The diverse requirements of next-generation communication systems necessitate awareness, flexibility, and intelligence as essential building blocks of future wireless networks. The awareness can be obtained from the radio signals in the environment using wireless sensing and radio environment mapping (REM) methods. This is, however, accompanied by threats such as eavesdropping, manipulation, and disruption posed by malicious attackers. To this end, this work analyzes the wireless sensing and radio environment awareness mechanisms, highlighting their vulnerabilities and provides solutions for mitigating them. As an example, the different threats to REM and its consequences in a vehicular communication scenario are described. Furthermore, the use of REM for securing communications is discussed and future directions regarding sensing/REM security are highlighted

A Game-Theoretic Framework for Optimum Decision Fusion in the Presence of Byzantines

Optimum decision fusion in the presence of malicious nodes - often referred to as Byzantines - is hindered by the necessity of exactly knowing the statistical behavior of Byzantines. By focusing on a simple, yet widely studied, set-up in which a Fusion Center (FC) is asked to make a binary decision about a sequence of system states by relying on the possibly corrupted decisions provided by local nodes, we propose a game-theoretic framework which permits to exploit the superior performance provided by optimum decision fusion, while limiting the amount of a-priori knowledge required. We first derive the optimum decision strategy by assuming that the statistical behavior of the Byzantines is known. Then we relax such an assumption by casting the problem into a game-theoretic framework in which the FC tries to guess the behavior of the Byzantines, which, in turn, must fix their corruption strategy without knowing the guess made by the FC. We use numerical simulations to derive the equilibrium of the game, thus identifying the optimum behavior for both the FC and the Byzantines, and to evaluate the achievable performance at the equilibrium. We analyze several different setups, showing that in all cases the proposed solution permits to improve the accuracy of data fusion. We also show that, in some instances, it is preferable for the Byzantines to minimize the mutual information between the status of the observed system and the reports submitted to the FC, rather than always flipping the decision made by the local nodes as it is customarily assumed in previous works