52 research outputs found
Secure Wireless Communications Based on Compressive Sensing: A Survey
IEEE Compressive sensing (CS) has become a popular signal processing technique and has extensive applications in numerous fields such as wireless communications, image processing, magnetic resonance imaging, remote sensing imaging, and anology to information conversion, since it can realize simultaneous sampling and compression. In the information security field, secure CS has received much attention due to the fact that CS can be regarded as a cryptosystem to attain simultaneous sampling, compression and encryption when maintaining the secret measurement matrix. Considering that there are increasing works focusing on secure wireless communications based on CS in recent years, we produce a detailed review for the state-of-the-art in this paper. To be specific, the survey proceeds with two phases. The first phase reviews the security aspects of CS according to different types of random measurement matrices such as Gaussian matrix, circulant matrix, and other special random matrices, which establishes theoretical foundations for applications in secure wireless communications. The second phase reviews the applications of secure CS depending on communication scenarios such as wireless wiretap channel, wireless sensor network, internet of things, crowdsensing, smart grid, and wireless body area networks. Finally, some concluding remarks are given
A review of compressive sensing in information security field
The applications of compressive sensing (CS) in the fi eld of information security have captured a great deal of researchers\u27 attention in the past decade. To supply guidance for researchers from a comprehensive perspective, this paper, for the fi rst time, reviews CS in information security field from two aspects: theoretical security and application security. Moreover, the CS applied in image cipher is one of the most widespread applications, as its characteristics of dimensional reduction and random projection can be utilized and integrated into image cryptosystems, which can achieve simultaneous compression and encryption of an image or multiple images. With respect to this application, the basic framework designs and the corresponding analyses are investigated. Speci fically, the investigation proceeds from three aspects, namely, image ciphers based on chaos and CS, image ciphers based on optics and CS, and image ciphers based on chaos, optics, and CS. A total of six frameworks are put forward. Meanwhile, their analyses in terms of security, advantages, disadvantages, and so on are presented. At last, we attempt to indicate some other possible application research topics in future
Byzantine Attack and Defense in Cognitive Radio Networks: A Survey
The Byzantine attack in cooperative spectrum sensing (CSS), also known as the
spectrum sensing data falsification (SSDF) attack in the literature, is one of
the key adversaries to the success of cognitive radio networks (CRNs). In the
past couple of years, the research on the Byzantine attack and defense
strategies has gained worldwide increasing attention. In this paper, we provide
a comprehensive survey and tutorial on the recent advances in the Byzantine
attack and defense for CSS in CRNs. Specifically, we first briefly present the
preliminaries of CSS for general readers, including signal detection
techniques, hypothesis testing, and data fusion. Second, we analyze the spear
and shield relation between Byzantine attack and defense from three aspects:
the vulnerability of CSS to attack, the obstacles in CSS to defense, and the
games between attack and defense. Then, we propose a taxonomy of the existing
Byzantine attack behaviors and elaborate on the corresponding attack
parameters, which determine where, who, how, and when to launch attacks. Next,
from the perspectives of homogeneous or heterogeneous scenarios, we classify
the existing defense algorithms, and provide an in-depth tutorial on the
state-of-the-art Byzantine defense schemes, commonly known as robust or secure
CSS in the literature. Furthermore, we highlight the unsolved research
challenges and depict the future research directions.Comment: Accepted by IEEE Communications Surveys and Tutoiral
Relaying in the Internet of Things (IoT): A Survey
The deployment of relays between Internet of Things (IoT) end devices and gateways can improve link quality. In cellular-based IoT, relays have the potential to reduce base station overload. The energy expended in single-hop long-range communication can be reduced if relays listen to transmissions of end devices and forward these observations to gateways. However, incorporating relays into IoT networks faces some challenges. IoT end devices are designed primarily for uplink communication of small-sized observations toward the network; hence, opportunistically using end devices as relays needs a redesign of both the medium access control (MAC) layer protocol of such end devices and possible addition of new communication interfaces. Additionally, the wake-up time of IoT end devices needs to be synchronized with that of the relays. For cellular-based IoT, the possibility of using infrastructure relays exists, and noncellular IoT networks can leverage the presence of mobile devices for relaying, for example, in remote healthcare. However, the latter presents problems of incentivizing relay participation and managing the mobility of relays. Furthermore, although relays can increase the lifetime of IoT networks, deploying relays implies the need for additional batteries to power them. This can erode the energy efficiency gain that relays offer. Therefore, designing relay-assisted IoT networks that provide acceptable trade-offs is key, and this goes beyond adding an extra transmit RF chain to a relay-enabled IoT end device. There has been increasing research interest in IoT relaying, as demonstrated in the available literature. Works that consider these issues are surveyed in this paper to provide insight into the state of the art, provide design insights for network designers and motivate future research directions
On Secrecy Metrics for Physical Layer Security over Quasi-Static Fading Channels
Theoretical studies on physical layer security often adopt the secrecy outage
probability as the performance metric for wireless communications over
quasi-static fading channels. The secrecy outage probability has two
limitations from a practical point of view: a) it does not give any insight
into the eavesdropper's decodability of confidential messages; b) it cannot
characterize the amount of information leakage to the eavesdropper when an
outage occurs. Motivated by the limitations of the secrecy outage probability,
we propose three new secrecy metrics for secure transmissions over quasi-static
fading channels. The first metric establishes a link between the concept of
secrecy outage and the decodability of messages at the eavesdropper. The second
metric provides an error-probability-based secrecy metric which is typically
used for the practical implementation of secure wireless systems. The third
metric characterizes how much or how fast the confidential information is
leaked to the eavesdropper. We show that the proposed secrecy metrics
collectively give a more comprehensive understanding of physical layer security
over fading channels and enable one to appropriately design secure
communication systems with different views on how secrecy is measured.ARC Discovery Projects Grant DP15010390
Physical Layer Security in Large-Scale Random Multiple Access Wireless Sensor Networks: A Stochastic Geometry Approach
This paper investigates physical layer security for a large-scale WSN with random multiple access, where each fusion center in the network randomly schedules a number of sensors to upload their sensed data subject to the overhearing of randomly distributed eavesdroppers. We propose an uncoordinated random jamming scheme in which those unscheduled sensors send jamming signals with a certain probability to defeat the eavesdroppers. With the aid of stochastic geometry theory and order statistics, we derive analytical expressions for the connection outage probability and secrecy outage probability to characterize transmission reliability and secrecy, respectively. Based on the obtained analytical results, we formulate an optimization problem for maximizing the sum secrecy throughput subject to both reliability and secrecy constraints, considering a joint design of the wiretap code rates for each scheduled sensor and the jamming probability for the unscheduled sensors. We provide both optimal and low-complexity sub-optimal algorithms to tackle the above problem, and further reveal various properties on the optimal parameters which are useful to guide practical designs. In particular, we demonstrate that the proposed random jamming scheme is beneficial for improving the sum secrecy throughput, and the optimal jamming probability is the result of trade-off between secrecy and throughput. We also show that the throughput performance of the sub-optimal scheme approaches that of the optimal one when facing a stringent reliability constraint or a loose secrecy constraint
Physical Layer Security in Wireless Networks: Design and Enhancement.
PhDSecurity and privacy have become increasingly significant concerns in wireless communication
networks, due to the open nature of the wireless medium which makes the wireless
transmission vulnerable to eavesdropping and inimical attacking. The emergence and
development of decentralized and ad-hoc wireless networks pose great challenges to the
implementation of higher-layer key distribution and management in practice. Against
this background, physical layer security has emerged as an attractive approach for performing
secure transmission in a low complexity manner. This thesis concentrates on
physical layer security design and enhancement in wireless networks.
First, this thesis presents a new unifying framework to analyze the average secrecy
capacity and secrecy outage probability. Besides the exact average secrecy capacity
and secrecy outage probability, a new approach for analyzing the asymptotic behavior is
proposed to compute key performance parameters such as high signal-to-noise ratio slope,
power offset, secrecy diversity order, and secrecy array gain. Typical fading environments
such as two-wave with diffuse power and Nakagami-m are taken into account.
Second, an analytical framework of using antenna selection schemes to achieve secrecy
is provided. In particular, transmit antenna selection and generalized selection combining
are considered including its special cases of selection combining and maximal-ratio
combining.
Third, the fundamental questions surrounding the joint impact of power constraints on
the cognitive wiretap channel are addressed. Important design insights are revealed
regarding the interplay between two power constraints, namely the maximum transmit
at the secondary network and the peak interference power at the primary network.
Fourth, secure single carrier transmission is considered in the two-hop decode-andi
forward relay networks. A two-stage relay and destination selection is proposed to minimize
the eavesdropping and maximize the signal power of the link between the relay and
the destination. In two-hop amplify-and-forward untrusted relay networks, secrecy may
not be guaranteed even in the absence of external eavesdroppers. As such, cooperative
jamming with optimal power allocation is proposed to achieve non-zero secrecy rate.
Fifth and last, physical layer security in large-scale wireless sensor networks is introduced.
A stochastic geometry approach is adopted to model the positions of sensors, access
points, sinks, and eavesdroppers. Two scenarios are considered: i) the active sensors
transmit their sensing data to the access points, and ii) the active access points forward
the data to the sinks. Important insights are concluded
- …