Results 1  10
of
19
Secure communication in stochastic wireless networks – Part II: Maximum rate and collusion
 IEEE Trans. Inf. Forens.Security
, 2012
"... Abstract—In Part I of this paper, we introduced the intrinsically secure communications graph (graph)—a random graph which describes the connections that can be established with strong secrecy over a largescale network, in the presence of eavesdroppers. We focused on the local connectivity of the ..."
Abstract

Cited by 25 (4 self)
 Add to MetaCart
(Show Context)
Abstract—In Part I of this paper, we introduced the intrinsically secure communications graph (graph)—a random graph which describes the connections that can be established with strong secrecy over a largescale network, in the presence of eavesdroppers. We focused on the local connectivity of thegraph, and proposed techniques to improve it. In this second part, we characterize the maximum secrecy rate (MSR) that can be achieved between a node and its neighbors. We then consider the scenario where the eavesdroppers are allowed to collude, i.e., exchange and combine information. We quantify exactly how eavesdropper collusion degrades the secrecy properties of the network, in comparison to a noncolluding scenario. Our analysis helps clarify how the presence of eavesdroppers can jeopardize the success of wireless physicallayer security. Index Terms—Colluding eavesdroppers, physicallayer security, secrecy capacity, stochastic geometry, wireless networks. I.
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 rely ..."
Abstract

Cited by 16 (1 self)
 Add to MetaCart
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 higherlayer 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 informationtheoretic security. We then describe the evolution of secure transmission strategies from pointtopoint channels to multipleantenna systems, followed by generalizations to multiuser broadcast, multipleaccess, interference, and relay networks. Secretkey 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 interdisciplinary approaches based on game theory and stochastic geometry. The associated problem of physical layer message authentication is also briefly introduced. The survey concludes with observations on potential research directions in this area.
Secret Communication in Large Wireless Networks without Eavesdropper Location Information
"... Abstract—We present achievable scaling results on the pernode secure throughput that can be realized in a large random wireless network of n legitimate nodes in the presence of m eavesdroppers of unknown location. We consider both onedimensional and twodimensional networks. In the onedimensional ..."
Abstract

Cited by 15 (2 self)
 Add to MetaCart
(Show Context)
Abstract—We present achievable scaling results on the pernode secure throughput that can be realized in a large random wireless network of n legitimate nodes in the presence of m eavesdroppers of unknown location. We consider both onedimensional and twodimensional networks. In the onedimensional case, we show that a pernode secure throughput of order 1/n is achievable if the number of eavesdroppers satisfies m = o(n/log n). We obtain similar results for the twodimensional case, where a secure throughput of order 1 / √ n log n is achievable under the same condition. The number of eavesdroppers that can be tolerated is significantly higher than previous works that address the case of unknown eavesdropper locations. The key technique introduced in our construction to handle unknown eavesdropper locations forces adversaries to intercept a number of packets to be able to decode a single message. The whole network is divided into regions, where a certain subset of packets is protected from adversaries located in each region. In the onedimensional case, our construction makes use of artificial noise generation by legitimate nodes to degrade the signal quality at the potential locations of eavesdroppers. In the twodimensional case, the availability of many paths to reach a destination is utilized to handle collaborating eavesdroppers of unknown location. I.
Physical Layer Security from InterSession Interference in Large Wireless Networks
"... Abstract—Physical layer secrecy in wireless networks in the presence of eavesdroppers of unknown location is considered. In contrast to prior schemes, which have expended energy in the form of cooperative jamming to enable secrecy, we develop schemes where multiple transmitters send their signals in ..."
Abstract

Cited by 10 (3 self)
 Add to MetaCart
(Show Context)
Abstract—Physical layer secrecy in wireless networks in the presence of eavesdroppers of unknown location is considered. In contrast to prior schemes, which have expended energy in the form of cooperative jamming to enable secrecy, we develop schemes where multiple transmitters send their signals in a cooperative fashion to confuse the eavesdroppers. Hence, power is not expended on “artificial noise”; rather, the signal of a given transmitter is protected by the aggregate interference produced by the other transmitters. We introduce a twohop strategy for the case of equal pathloss between all pairs of nodes, and then consider its embedding within a multihop approach for the general case of an extended network. In each case, we derive an achievable number of eavesdroppers that can be present in the region while secure communication between all sources and intended destinations is ensured. I.
Percolation and connectivity in the intrinsically secure communications graph
 IEEE Trans. Inf. Theory
, 2012
"... Abstract—The ability to exchange secret information is critical to many commercial, governmental, and military networks. The intrinsically secure communications graph (graph) is a random graph which describes the connections that can be securely established over a largescale network, by exploitin ..."
Abstract

Cited by 8 (3 self)
 Add to MetaCart
(Show Context)
Abstract—The ability to exchange secret information is critical to many commercial, governmental, and military networks. The intrinsically secure communications graph (graph) is a random graph which describes the connections that can be securely established over a largescale network, by exploiting the physical properties of the wireless medium. This paper aims to characterize the global properties of the graph in terms of 1) percolation on the infinite plane, and 2) full connectivity on a finite region. First, for the Poisson graph defined on the infinite plane, the existence of a phase transition is proven, whereby an unbounded component of connected nodes suddenly arises as the density of legitimate nodes is increased. This shows that longrange secure communication is still possible in the presence of eavesdroppers. Second, full connectivity on a finite region of the Poisson graph is considered. The exact asymptotic behavior of full connectivity in the limit of a large density of legitimate nodes is characterized. Then, simple, explicit expressions are derived in order to closely approximate the probability of full connectivity for a finite density of legitimate nodes. These results help clarify how the presence of eavesdroppers can compromise longrange secure communication. Index Terms—Connectivity, percolation, physicallayer security, stochastic geometry, wireless networks.
1Minimum Energy Routing and Jamming to Thwart Wireless Network Eavesdroppers
"... Abstract—There is a rich recent literature on informationtheoretically secure communication at the physical layer of wireless networks, where secret communication between a single transmitter and receiver has been studied extensively. In this paper, we consider how singlehop physical layer securi ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
(Show Context)
Abstract—There is a rich recent literature on informationtheoretically secure communication at the physical layer of wireless networks, where secret communication between a single transmitter and receiver has been studied extensively. In this paper, we consider how singlehop physical layer security techniques can be extended to multihop wireless networks. We show that guaranteed security can be achieved in multihop networks by augmenting physical layer security techniques, such as cooperative jamming, with the higher layer network mechanisms, such as routing. Specifically, we consider the secure minimum energy routing problem, in which the objective is to compute a minimum energy path between two network nodes subject to constraints on the endtoend communication secrecy and goodput over the path. This problem is formulated as a constrained optimization of transmission power and link selection, which is proved to be NPhard. Nevertheless, we show that efficient algorithms exist to compute both exact and approximate solutions for the problem. In particular, we develop an exact solution of pseudopolynomial complexity, as well as an ϵoptimal approximation of polynomial complexity. Simulation results are also provided to show the utility of our algorithms and quantify their energy savings compared to a combination of (standard) securityagnostic minimum energy routing and physical layer security. In the simulated scenarios, we observe that, by jointly optimizing link selection at the network layer and cooperative jamming at the physical layer, our algorithms reduce the network energy consumption by half. Index Terms—Wireless security, cooperative secrecy, minimum energy, secure routing.
Security Versus Capacity Tradeoffs in Large Wireless Networks Using Keyless Secrecy
"... We investigate the scalability of a class of algorithms that exploit dynamics of wireless fading channels to achieve secret unicast communication between multiple sourcedestination pairs in the presence of eavesdroppers. We first describe a construction that allows artificial noise generation to su ..."
Abstract
 Add to MetaCart
(Show Context)
We investigate the scalability of a class of algorithms that exploit dynamics of wireless fading channels to achieve secret unicast communication between multiple sourcedestination pairs in the presence of eavesdroppers. We first describe a construction that allows artificial noise generation to suppress eavesdroppers, yet yields a pernode throughput of Ω((n f(n)) −1/2) in a wireless network of n randomly located nodes, where f(n) denotes the average number of neighbors of a node. We then derive scaling laws for the number of eavesdroppers that can be tolerated in the network for both independent and collaborating eavesdropper models. In particular, we show that for some constant c such that 0 < c < 1, o( ( f(n)) c) and o(ln f(n)) eavesdroppers can be tolerated under the independent and collaborating eavesdropper models respectively, while guaranteeing that the aggregate rate at which eavesdroppers intercept packets goes to 0. Thus, achievable security (in number of eavesdroppers) can be traded off against the pernode throughput by varying the average number of neighbors of a node (or equivalently, by varying the transmit power). 1
Security Versus Capacity Tradeoffs in Large Wireless Networks Using Keyless Secrecy
"... We investigate the scalability of a class of algorithms that exploit the dynamics of wireless fading channels to achieve secret communication in a large wireless network of n randomly located nodes. We describe a construction in which nodes transmit artificial noise to suppress eavesdroppers, yet ac ..."
Abstract
 Add to MetaCart
(Show Context)
We investigate the scalability of a class of algorithms that exploit the dynamics of wireless fading channels to achieve secret communication in a large wireless network of n randomly located nodes. We describe a construction in which nodes transmit artificial noise to suppress eavesdroppers, yet achieving a pernode throughput of Ω((n f(n)) −1/2), where f(n) is any arbitrary function satisfying ω(1) ≤ f(n) ≤ o(n) 1. In conjunction with a guaranteed pernode throughput of Ω((n f(n)) −1/2), we show that for some constant c1 such that 0 < c1 < 1, the network can tolerate o( ( f(n)) c1) independent and o(ln f(n)) collaborating eavesdroppers, while ensuring that the aggregate rate at which eavesdroppers intercept packets goes to 0. Thus, achievable security (in number of eavesdroppers) can be traded off against the pernode throughput by simply choosing a suitable f(n). We also show that O( ( f(n)) c2) independent and O(ln f(n)) eavesdroppers are sufficient to achieve a nonzero eavesdropper throughput, for some constant c2> c1. 1