1,272 research outputs found
On the Throughput Cost of Physical Layer Security in Decentralized Wireless Networks
This paper studies the throughput of large-scale decentralized wireless
networks with physical layer security constraints. In particular, we are
interested in the question of how much throughput needs to be sacrificed for
achieving a certain level of security. We consider random networks where the
legitimate nodes and the eavesdroppers are distributed according to independent
two-dimensional Poisson point processes. The transmission capacity framework is
used to characterize the area spectral efficiency of secure transmissions with
constraints on both the quality of service (QoS) and the level of security.
This framework illustrates the dependence of the network throughput on key
system parameters, such as the densities of legitimate nodes and eavesdroppers,
as well as the QoS and security constraints. One important finding is that the
throughput cost of achieving a moderate level of security is quite low, while
throughput must be significantly sacrificed to realize a highly secure network.
We also study the use of a secrecy guard zone, which is shown to give a
significant improvement on the throughput of networks with high security
requirements.Comment: Accepted for publication in IEEE Transactions on Wireless
Communication
Secret-key Agreement with Channel State Information at the Transmitter
We study the capacity of secret-key agreement over a wiretap channel with
state parameters. The transmitter communicates to the legitimate receiver and
the eavesdropper over a discrete memoryless wiretap channel with a memoryless
state sequence. The transmitter and the legitimate receiver generate a shared
secret key, that remains secret from the eavesdropper. No public discussion
channel is available. The state sequence is known noncausally to the
transmitter. We derive lower and upper bounds on the secret-key capacity. The
lower bound involves constructing a common state reconstruction sequence at the
legitimate terminals and binning the set of reconstruction sequences to obtain
the secret-key. For the special case of Gaussian channels with additive
interference (secret-keys from dirty paper channel) our bounds differ by 0.5
bit/symbol and coincide in the high signal-to-noise-ratio and high
interference-to-noise-ratio regimes. For the case when the legitimate receiver
is also revealed the state sequence, we establish that our lower bound achieves
the the secret-key capacity. In addition, for this special case, we also
propose another scheme that attains the capacity and requires only causal side
information at the transmitter and the receiver.Comment: 10 Pages, Submitted to IEEE Transactions on Information Forensics and
Security, Special Issue on Using the Physical Layer for Securing the Next
Generation of Communication System
Interoperable ADS-B Confidentiality
The worldwide air traffic infrastructure is in the late stages of transition from legacy transponder systems to Automatic Dependent Surveillance - Broadcast (ADS-B) based systems. ADS-B relies on position information from GNSS and requires aircraft to transmit their identification, state, and position. ADS-B promises the availability of high-fidelity air traffic information; however, position and identification data are not secured via authentication or encryption. This lack of security for ADS-B allows non-participants to observe and collect data on both government and private flight activity. This is a proposal for a lightweight, interoperable ADS-B confidentiality protocol which uses existing format preserving encryption and an innovative unidirectional key handoff to ensure backward compatibility. Anonymity and data confidentiality are achieved selectively on a per-session basis. This research also investigates the effect of false replies unsynchronized in time (FRUIT) on the packet error ratio (PER) for Mode S transmissions. High PERs result in range and time limits being imposed on the key handoff mechanism of this proposal. Overall, this confidentiality protocol is ready for implementation, however further research is required to validate a revised key handoff mechanism
A Survey on Wireless Security: Technical Challenges, Recent Advances and Future Trends
This paper examines the security vulnerabilities and threats imposed by the
inherent open nature of wireless communications and to devise efficient defense
mechanisms for improving the wireless network security. We first summarize the
security requirements of wireless networks, including their authenticity,
confidentiality, integrity and availability issues. Next, a comprehensive
overview of security attacks encountered in wireless networks is presented in
view of the network protocol architecture, where the potential security threats
are discussed at each protocol layer. We also provide a survey of the existing
security protocols and algorithms that are adopted in the existing wireless
network standards, such as the Bluetooth, Wi-Fi, WiMAX, and the long-term
evolution (LTE) systems. Then, we discuss the state-of-the-art in
physical-layer security, which is an emerging technique of securing the open
communications environment against eavesdropping attacks at the physical layer.
We also introduce the family of various jamming attacks and their
counter-measures, including the constant jammer, intermittent jammer, reactive
jammer, adaptive jammer and intelligent jammer. Additionally, we discuss the
integration of physical-layer security into existing authentication and
cryptography mechanisms for further securing wireless networks. Finally, some
technical challenges which remain unresolved at the time of writing are
summarized and the future trends in wireless security are discussed.Comment: 36 pages. Accepted to Appear in Proceedings of the IEEE, 201
State Amplification Subject To Masking Constraints
This paper considers a state dependent broadcast channel with one
transmitter, Alice, and two receivers, Bob and Eve. The problem is to
effectively convey ("amplify") the channel state sequence to Bob while
"masking" it from Eve. The extent to which the state sequence cannot be masked
from Eve is referred to as leakage. This can be viewed as a secrecy problem,
where we desire that the channel state itself be minimally leaked to Eve while
being communicated to Bob. The paper is aimed at characterizing the trade-off
region between amplification and leakage rates for such a system. An achievable
coding scheme is presented, wherein the transmitter transmits a partial state
information over the channel to facilitate the amplification process. For the
case when Bob observes a stronger signal than Eve, the achievable coding scheme
is enhanced with secure refinement. Outer bounds on the trade-off region are
also derived, and used in characterizing some special case results. In
particular, the optimal amplification-leakage rate difference, called as
differential amplification capacity, is characterized for the reversely
degraded discrete memoryless channel, the degraded binary, and the degraded
Gaussian channels. In addition, for the degraded Gaussian model, the extremal
corner points of the trade-off region are characterized, and the gap between
the outer bound and achievable rate-regions is shown to be less than half a bit
for a wide set of channel parameters.Comment: Revised versio
Survey and Systematization of Secure Device Pairing
Secure Device Pairing (SDP) schemes have been developed to facilitate secure
communications among smart devices, both personal mobile devices and Internet
of Things (IoT) devices. Comparison and assessment of SDP schemes is
troublesome, because each scheme makes different assumptions about out-of-band
channels and adversary models, and are driven by their particular use-cases. A
conceptual model that facilitates meaningful comparison among SDP schemes is
missing. We provide such a model. In this article, we survey and analyze a wide
range of SDP schemes that are described in the literature, including a number
that have been adopted as standards. A system model and consistent terminology
for SDP schemes are built on the foundation of this survey, which are then used
to classify existing SDP schemes into a taxonomy that, for the first time,
enables their meaningful comparison and analysis.The existing SDP schemes are
analyzed using this model, revealing common systemic security weaknesses among
the surveyed SDP schemes that should become priority areas for future SDP
research, such as improving the integration of privacy requirements into the
design of SDP schemes. Our results allow SDP scheme designers to create schemes
that are more easily comparable with one another, and to assist the prevention
of persisting the weaknesses common to the current generation of SDP schemes.Comment: 34 pages, 5 figures, 3 tables, accepted at IEEE Communications
Surveys & Tutorials 2017 (Volume: PP, Issue: 99
- …