In practice, Internet of Things (IoT) applications may face two different hostile attacks, i.e., overhearing the broadcasted data and detecting the presence of data communication. Previous works have assumed that only one of these attacks is present in the network and have addressed these attacks separately. In this article, we investigate the security of a simple but practical IoT-based point-to-point communication which is facing with the above-mentioned two attacks under some realistic assumptions. In other words, we aim to protect the data against two adversary nodes, namely Eve (who tries to capture the broadcasted data) and warden Willie (who tries to detect the presence of data communication between legitimate nodes). To tackle these attacks, we jointly employ the information-theoretic security and covert communication techniques. To hide information from Willies, we force the source to transmit its message in the selected time slot and the multiple-antennas cooperative jammer to inject jamming during all time slots contentiously which leads to deceive Eves and Willies jointly. To enhance the performance of this security design, we formulate an optimization problem, with the goal of maximizing the secrecy rate subject to power constraints at the source and jammer, while satisfying a covert communication requirement. Since the mentioned optimization problem is nonconvex, we propose an algorithm to solve it. Then, to obtain further insights, we extend our proposed system model to noncolluding and colluding Willies. Next, we study a practical communication scenario, where the source has uncertainty about Willie’s location and knows the channel state information (CSI) of Eves imperfectly. Our numerical results highlight that a more accurate estimation of Willie’s location has a more positive efficacy on the secrecy performance compared to the case with more accuracy of Eves’ CSI estimation.
In practice, Internet of Things (IoT) applications may face two different hostile attacks, i.e., overhearing the broadcasted data and detecting the presence of data communication. Previous works have assumed that only one of these attacks is present in the network and have addressed these attacks separately. In this article, we investigate the security of a simple but practical IoT-based point-to-point communication which is facing with the above-mentioned two attacks under some realistic assumptions. In other words, we aim to protect the data against two adversary nodes, namely Eve (who tries to capture the broadcasted data) and warden Willie (who tries to detect the presence of data communication between legitimate nodes). To tackle these attacks, we jointly employ the information-theoretic security and covert communication techniques. To hide information from Willies, we force the source to transmit its message in the selected time slot and the multiple-antennas cooperative jammer to inject jamming during all time slots contentiously which leads to deceive Eves and Willies jointly. To enhance the performance of this security design, we formulate an optimization problem, with the goal of maximizing the secrecy rate subject to power constraints at the source and jammer, while satisfying a covert communication requirement. Since the mentioned optimization problem is nonconvex, we propose an algorithm to solve it. Then, to obtain further insights, we extend our proposed system model to noncolluding and colluding Willies. Next, we study a practical communication scenario, where the source has uncertainty about Willie’s location and knows the channel state information (CSI) of Eves imperfectly. Our numerical results highlight that a more accurate estimation of Willie’s location has a more positive efficacy on the secrecy performance compared to the case with more accuracy of Eves’ CSI estimation.
In this article, we investigate joint information-theoretic secrecy and covert communication in a single-input-multioutput (SIMO) system where a transmitter (Alice) is communicating with two legitimate users (Bob and Carol). We consider that an untrusted user and a warden node are also present in the network attempting to attack the secure and covert communications to Bob and Carol, respectively. Specifically, Bob requires secure communications such that his messages from Alice are not decoded by the untrusted user, while Carol requires covert communications such that her messages from Alice are not detected by the warden. To do so, we consider that Alice transmits Carol's messages during selected time slots to hide them from the warden while also transmitting Bob's messages in each time slot contentiously. We formulate an optimization problem with the aim of maximizing the average rate subject to a covert communication requirement and a secure communications constraint. Since the proposed optimization problem is nonconvex, we utilize successive convex approximation to obtain a tractable solution. Moreover, we extend our proposed system model to multiple antenna Alice scenario and find beamforming vectors so that the average sum rate is maximized. Furthermore, we consider practical assumptions that Alice has imperfect knowledge of the warden's location and imperfect channel state information (CSI) of Bob and Carol. Our numerical examples highlight that the imperfect CSI at Carol has a more detrimental impact on the average rate compared to imperfect CSI at Bob.
Abstract This paper addresses the power allocation problem in a network where joint information-theoretic secrecy and covert communication are required. In this network, a single transmitter (Alice) sends information to two legitimate users (Bob and Carol). There is also an untrusted user who attempts to detect the content of Bob’s message and a warden (Willie) who wants to detect the existence of communication between Alice and the two users. Thus, Carol requires covert transmission, and Bob requires secure and covert communication. The network utilizes a friendly jammer to address these demands and overcome the low transmission rate of covert communication. To achieve covert communication, Alice sends both users’ data simultaneously in selected time slots to hide it from Willie, while the jammer continuously transmits signals in all time slots. The objective is to maximize the average transmission rate over the allocated powers of Bob, Carol, and the jammer while meeting the two users’ requirements. A novel iterative algorithm is proposed to obtain an effective solution. Simulation results indicate that the proposed method can enhance the network’s average rate while satisfying the users’ demands.
Jamming antenna selection (JAS) serves as a low-complexity approach to enhance covert communication in Internet of Things (IoT) networks subject to stringent energy and computational limitations. Unlike conventional JAS strategies that assume a fully cooperative jammer selecting a single antenna for artificial noise transmission, this work investigates the optimal number of selected jamming antennas to maximize covert performance with a limited-cooperation jammer. In the considered scenario, the jammer does not provide the necessary cooperation, which prevents the legitimate receiver from acquiring the jammer–receiver channel state information (CSI). According to the degree of CSI availability at the jammer, two practical JAS schemes, random JAS (RJAS) and minimum JAS (MJAS), are investigated to effectively impair the warden’s detection performance. Closed-form expressions are derived for the warden’s expected minimum detection error probability and the legitimate receiver’s transmission outage probability, with the latter evaluated under interference-limited conditions. Leveraging these results, an optimization framework is developed to jointly determine the transmit power, transmission rate, and number of selected jamming antennas to maximize the effective covert rate. Numerical results illustrate that the effective covert rate under the RJAS strategy increases monotonically with the number of selected antennas, whereas the effective covert rate under the MJAS strategy is maximized when selecting two antennas. Both theoretical analysis and simulation results validate the effectiveness of the proposed schemes and highlight the significant covert performance gains achieved by employing multiple jamming antennas in IoT networks with limited cooperation.
In the context of Internet-of-Things (IoT) applications, ensuring secure and covert wireless communication remains a critical challenge, especially when using energy harvesting relays. Moreover, the analysis of hardware impairments is a pivotal practical aspect in the evaluation of IoT communication networks. This paper investigates four scenarios to address security and covert communication. In the first scenario, the focus is on guaranteeing the security in the presence of hardware impairments. In this case, the external jammer transmits interference signals toward both the relay and Bob to prevent information leakage from the untrusted relay. However, in this scenario, since the state of the untrusted relay is always superior to that of Bob, security cannot be guaranteed under any network parameters. Accordingly, in the second scenario, to tackle this problem, a receiver equipped with the capability to transmit jamming signals (receiver jammer) is proposed, aiming to protect the communication against potential information leakage from the untrusted relay. In the third and fourth scenarios, the relay is considered a trusted node, and warden (Willie) is introduced into the system. Here, the external jammer plays a crucial role when transmitting interference signals simultaneously toward Bob, relay, and Willie to ensure communication security. This scenario incorporates covert communication designed to counter threats from Willie’s detection. Covert communication in these two scenarios is analyzed under the following two conditions: 1) When Willie has Channel State Information (CSI); 2) When Willie lacks CSI, in which case he equips himself with multiple antennas. Simulation results show that the proposed power allocation can enhance secure and covert communications, even in the presence of hardware impairments and a multi-antenna Willie. Moreover, it is shown that when Willie has CSI, the performance of covert communication is severely reduced.
Covert communication enhances the security of information transmission by protecting communication behavior, which has been widely investigated in various wireless communication systems. In this paper, we develop a covert Internet of things (IoT) network, where energy-limited IoT nodes selectively transmit information or artificial noise based on channel state information. Specifically, if the channel gains of all legitimate links are less than a given threshold, the energy-limited node emits artificial noise, otherwise, it transmits covert information. Meanwhile, we adopt the strategy of channel inversion power control (CIPC) to hide the location information of the nodes. Then, we derive Willie's detection error probability (DEP), propose an optimization problem for covert throughput, and obtain the optimal threshold and transmission energy. The results indicate that the probability of covert transmission significantly affects Willie's DEP. Moreover, the average covert throughput can be maximized by a relatively small threshold.
In this paper, we investigate the problem of secure communication with covert requirement in untrusted relaying networks. Our considered system model contains one source, one destination, one untrusted relay, and one Willie. The untrusted relay tries to extract the information signal, while the goal of Willie is to detect the presence of the information signal transmitted by the source, in the current time slot. To overcome these two attacks, it is assumed that the destination and the source inject jamming signal to the network in phase I and phase II, respectively. Accordingly, the communication in our proposed system model is accomplished in two phases. In the first phase, when the source transmits its data to the untrusted relay, the destination broadcasts its jamming signal. In the second phase, when the relay retransmits the received signal, the source transmits a jamming signal with one of its antennas. For this system model, we suggest a novel power allocation strategy to maximize the instantaneous secrecy rate subject to satisfying the covert requirements in both of the phases. Since the proposed optimization problem is non-convex, the Successive Convex Approximation (SCA) method is used to change it to a convex optimization problem. Numerical curves are presented to reveal the impact of the untrusted relay's location an number of source antennas on the secrecy performance.