Exploiting Mapping Diversity for Enhancing Security at Physical Layer in the Internet of Things
TL;DR: This work proposes a novel scheme, channel-based mapping diversity, which uses the inherent randomness of the wireless channel and multiple mappings available for an ${M}$ -ary phase shift keying constellation in confusing an eavesdropper.
Abstract: Application of Internet of Things (IoT) in health, defense, banking, and other confidential information transfer urges the need for secure IoT. As most of the IoT devices are resource-limited (antennas, bandwidth, energy), securing the information transfer has always been a challenge. Looking at a solution for enhancing the security of single antenna, single carrier, energy efficient devices, we propose a novel scheme, channel-based mapping diversity. This scheme uses the inherent randomness of the wireless channel and multiple mappings available for an ${M}$ -ary phase shift keying constellation in confusing an eavesdropper. When the legitimate and the eavesdropper channels are independent of each other, it is shown that a symbol error rate (SER) of $\frac {(M-1)}{M}$ is induced at the eavesdropper. Whereas, when the channels are correlated, optimal and suboptimal strategies at source and eavesdropper are derived for their respective optimal performances. Further, a closed-form expression for a lower-bound on the SER at the eavesdropper is derived. Simulation results show that for the correlated case, as SNR at the eavesdropper increases, SER initially decreases, later saturates to a relatively high SER, hence making the job of the eavesdropper difficult in getting the legitimate data. Furthermore, the effect of the correlation is more pronounced on SER at higher levels of correlation. This indicates that for practical correlation scenarios, SER is high enough to confuse the eavesdropper.
Citations
More filters
TL;DR: A methodology is developed in which the influence on security due to artificially generated rain and artificially generated dust on the wireless communication network is studied and a half-duplex attack in D2D communication is attained.
18 citations
TL;DR: The presented results verify that the security performance of the cooperative NOMA-based IoT network can be improved through an appropriate power control scheme and by generating AN at the BS and the strong IoT node.
Abstract: With the increasing demand for security in many sectors, such as defense and health systems, developing secure Internet of Things (IoT) networks is a matter of great urgency. Looking at a potential solution for secure IoT systems, we investigate the physical layer security of cooperative non-orthogonal multiple access (NOMA) systems. After decoding information signal, the idea that a strong IoT node can serve as a relay node for other weak IoT nodes in enhancing their signal reception reliability, is known as cooperative NOMA. We consider both single-antenna and multi-antenna aided transmission scenarios, where the base station (BS) communicates with two IoT nodes of different strengths. In the multi-antenna scenario, artificial noise (AN) is generated at the BS and the strong IoT node for improving the security of the system. In order to characterize the secrecy performance, we derive new exact expressions of the security outage probability for both the IoT nodes under both the single-antenna and multi-antenna aided scenarios. For the single-antenna scenario, we show that the power optimization at the BS and the strong IoT node can enhance the secrecy performance to some extent. For this case, we further study the secrecy diversity order of the overall system, which is mainly determined by the IoT node with worse channel condition. For the multi-antenna scenario, we derive the asymptotic secrecy outage probability when the number of antennas tends to infinity. Extensive simulations have been conducted to verify the accuracy and effectiveness of the proposed analytical derivations. The presented results verify that the security performance of the cooperative NOMA-based IoT network can be improved through an appropriate power control scheme and by generating AN at the BS and the strong IoT node. The simulation results further illustrate that the asymptotic secrecy outage probability is close to the exact one.
14 citations
Cites background from "Exploiting Mapping Diversity for En..."
...INTRODUCTION Assuring security for Internet of Things (IoT) networks nowadays is the matter great urgency due to several applications, such as defense, banking and health systems [1]....
[...]
01 Oct 2019
TL;DR: The concept of trustworthiness in IoT, its main pillars namely, security, privacy and data protection, is introduced and the state-of-the-art in research and standardisation for each of these subareas is analyzed.
Abstract: With the emergence of new digital trends like Internet of Things (IoT), more industry actors and technical committees pursue research in utilising such technologies as they promise a better and optimised management, improved energy efficiency and a better quality living through a wide array of value-added services. However, as sensing, actuation, communication and control become increasingly more sophisticated, such promising data-driven systems generate, process, and exchange larger amounts of security-critical and privacy-sensitive data, which makes them attractive targets of attacks. In turn this affirms the importance of trustworthiness in IoT and emphasises the need of a solid technical and regulatory foundation. The goal of this paper is to first introduce the concept of trustworthiness in IoT, its main pillars namely, security, privacy and data protection, and then analyse the state-of-the-art in research and standardisation for each of these subareas. Throughout the paper, we develop and refer to Unmanned Aerial Vehicles (UAVs) as a promising value-added service example of mobile IoT devices. The paper then presents a thorough gap analysis and concludes with recommendations for future work.
14 citations
Cites background from "Exploiting Mapping Diversity for En..."
...Going further, with regard to the use case, even though the technology is evolving rapidly, certain IoT applications cannot be further developed without a regulatory framework in place as explained in [29]....
[...]
TL;DR: Results show the significant benefits of PHY-RC for guaranteeing the Quality-of-Service (QoS) requirements essential in IIoT applications.
Abstract: Integrating the Internet-of-Things (IoT) paradigm with industrial wireless sensor networks (IWSNs) has led to a technological evolution known as Industrial IoT (IIoT). To ensure reliable, secure, and low-latency communication in IIoT applications like healthcare, we use rateless codes (RCs) for forward error correction (FEC) at the physical layer (PHY) in a cooperative delay-constrainted environment. Probability of violation $({\mathrm{ Pr}}_{\mathrm{ vio}})$ is used as a performance metric which consists of: 1) reliability outage probability, i.e., the probability with which the information cannot be successfully decoded within the time constraint ${T}$ and 2) information intercept probability, which reflects the secrecy performance. Since RC can adjust the rate on the fly, we analyze the performance when relay transmits a fraction of the message and the receiver does energy accumulation (EA). We derive a closed-form expression of ${\mathrm{ Pr}}_{\mathrm{ vio}}$ in a single-relay system at a high signal-to-noise ratio (SNR) when the receiver either accumulates energy or mutual information (MI) from the received signals. Furthermore, ${\mathrm{ Pr}}_{\mathrm{ vio}}$ of various relay selection schemes is evaluated in a multirelay system. Such kind of analysis in which relay selection is done using RC for PHY-FEC is first of its kind and it is compared to fixed-rate codes. Overall, results show the significant benefits of PHY-RC for guaranteeing the Quality-of-Service (QoS) requirements essential in IIoT applications.
9 citations
Cites background from "Exploiting Mapping Diversity for En..."
...Besides, due to the widespread deployment of IIoT, secure information transfer is also a critical issue in its implementation [3], [4]....
[...]
Journal Article•
TL;DR: A tutorial on several new methods to ensure security at physical layer in wireless communication, from the theoretical base of the physical layer security, secure code design, cooperative jamming, to secret key generation, and comparing of the different techniques.
Abstract: Security is one of the key issues in wireless communication. It is critical to send confidential data to legitimate user rather than intruders in an open space. In recent years, physical layer security attracts much research interest. This article offers a tutorial on several new methods to ensure security at physical layer in wireless communication. The introduction includes several aspects, from the theoretical base of the physical layer security, secure code design, cooperative jamming, to secret key generation, and comparing of the different techniques. Finally we make a view on the future works in this area.
8 citations
References
More filters
Proceedings Article•
01 Jan 2005
TL;DR: This book aims to provide a chronology of key events and individuals involved in the development of microelectronics technology over the past 50 years and some of the individuals involved have been identified and named.
Abstract: Alhussein Abouzeid Rensselaer Polytechnic Institute Raviraj Adve University of Toronto Dharma Agrawal University of Cincinnati Walid Ahmed Tyco M/A-COM Sonia Aissa University of Quebec, INRSEMT Huseyin Arslan University of South Florida Nallanathan Arumugam National University of Singapore Saewoong Bahk Seoul National University Claus Bauer Dolby Laboratories Brahim Bensaou Hong Kong University of Science and Technology Rick Blum Lehigh University Michael Buehrer Virginia Tech Antonio Capone Politecnico di Milano Javier Gómez Castellanos National University of Mexico Claude Castelluccia INRIA Henry Chan The Hong Kong Polytechnic University Ajit Chaturvedi Indian Institute of Technology Kanpur Jyh-Cheng Chen National Tsing Hua University Yong Huat Chew Institute for Infocomm Research Tricia Chigan Michigan Tech Dong-Ho Cho Korea Advanced Institute of Science and Tech. Jinho Choi University of New South Wales Carlos Cordeiro Philips Research USA Laurie Cuthbert Queen Mary University of London Arek Dadej University of South Australia Sajal Das University of Texas at Arlington Franco Davoli DIST University of Genoa Xiaodai Dong, University of Alberta Hassan El-sallabi Helsinki University of Technology Ozgur Ercetin Sabanci University Elza Erkip Polytechnic University Romano Fantacci University of Florence Frank Fitzek Aalborg University Mario Freire University of Beira Interior Vincent Gaudet University of Alberta Jairo Gutierrez University of Auckland Michael Hadjitheodosiou University of Maryland Zhu Han University of Maryland College Park Christian Hartmann Technische Universitat Munchen Hossam Hassanein Queen's University Soong Boon Hee Nanyang Technological University Paul Ho Simon Fraser University Antonio Iera University "Mediterranea" of Reggio Calabria Markku Juntti University of Oulu Stefan Kaiser DoCoMo Euro-Labs Nei Kato Tohoku University Dongkyun Kim Kyungpook National University Ryuji Kohno Yokohama National University Bhaskar Krishnamachari University of Southern California Giridhar Krishnamurthy Indian Institute of Technology Madras Lutz Lampe University of British Columbia Bjorn Landfeldt The University of Sydney Peter Langendoerfer IHP Microelectronics Technologies Eddie Law Ryerson University in Toronto
7,826 citations
[...]
TL;DR: This paper finds the trade-off curve between R and d, assuming essentially perfect (“error-free”) transmission, and implies that there exists a Cs > 0, such that reliable transmission at rates up to Cs is possible in approximately perfect secrecy.
Abstract: We consider the situation in which digital data is to be reliably transmitted over a discrete, memoryless channel (dmc) that is subjected to a wire-tap at the receiver. We assume that the wire-tapper views the channel output via a second dmc). Encoding by the transmitter and decoding by the receiver are permitted. However, the code books used in these operations are assumed to be known by the wire-tapper. The designer attempts to build the encoder-decoder in such a way as to maximize the transmission rate R, and the equivocation d of the data as seen by the wire-tapper. In this paper, we find the trade-off curve between R and d, assuming essentially perfect (“error-free”) transmission. In particular, if d is equal to Hs, the entropy of the data source, then we consider that the transmission is accomplished in perfect secrecy. Our results imply that there exists a C s > 0, such that reliable transmission at rates up to C s is possible in approximately perfect secrecy.
7,129 citations
"Exploiting Mapping Diversity for En..." refers background in this paper
...Wyner [4] and Csiszar and Korner [5] are a few among the pioneers in PLS to show that the information transfer can indeed be perfectly secure....
[...]
Book•
01 Jan 2004
TL;DR: The book gives many numerical illustrations expressed in large collections of system performance curves, allowing the researchers or system designers to perform trade-off studies of the average bit error rate and symbol error rate.
Abstract: noncoherent communication systems, as well as a large variety of fading channel models typical of communication links often found in the real world, including single- and multichannel reception with a large variety of types. The book gives many numerical illustrations expressed in large collections of system performance curves, allowing the researchers or system designers to perform trade-off studies of the average bit error rate and symbol error rate. This book is a very good reference book for researchers and communication engineers and may also be a source for supplementary material of a graduate course on communication or signal processing. Nowadays, many new books attach a CD-ROM for more supplementary material. With the many numerical examples in this book, it appears that an attached CD-ROM would be ideal for this book. It would be even better to present the computer program in order to be interactive so that the readers can plug in their arbitrary parameters for the performance evaluation. —H. Hsu
6,469 citations
"Exploiting Mapping Diversity for En..." refers background in this paper
...Therefore, the cross over probability in converting “0” to “1” or 1 to 0 at the receiver due to the error induced by the channel is given by [19]...
[...]
TL;DR: Given two discrete memoryless channels (DMC's) with a common input, a single-letter characterization is given of the achievable triples where R_{e} is the equivocation rate and the related source-channel matching problem is settled.
Abstract: Given two discrete memoryless channels (DMC's) with a common input, it is desired to transmit private messages to receiver 1 rate R_{1} and common messages to both receivers at rate R_{o} , while keeping receiver 2 as ignorant of the private messages as possible. Measuring ignorance by equivocation, a single-letter characterization is given of the achievable triples (R_{1},R_{e},R_{o}) where R_{e} is the equivocation rate. Based on this channel coding result, the related source-channel matching problem is also settled. These results generalize those of Wyner on the wiretap channel and of Korner-Marton on the broadcast Channel.
3,570 citations
"Exploiting Mapping Diversity for En..." refers background in this paper
...Wyner [4] and Csiszar and Korner [5] are a few among the pioneers in PLS to show that the information transfer can indeed be perfectly secure....
[...]