24,747 research outputs found
Secret-Key Generation using Correlated Sources and Channels
We study the problem of generating a shared secret key between two terminals
in a joint source-channel setup -- the sender communicates to the receiver over
a discrete memoryless wiretap channel and additionally the terminals have
access to correlated discrete memoryless source sequences. We establish lower
and upper bounds on the secret-key capacity. These bounds coincide,
establishing the capacity, when the underlying channel consists of independent,
parallel and reversely degraded wiretap channels. In the lower bound, the
equivocation terms of the source and channel components are functionally
additive. The secret-key rate is maximized by optimally balancing the the
source and channel contributions. This tradeoff is illustrated in detail for
the Gaussian case where it is also shown that Gaussian codebooks achieve the
capacity. When the eavesdropper also observes a source sequence, the secret-key
capacity is established when the sources and channels of the eavesdropper are a
degraded version of the legitimate receiver. Finally the case when the
terminals also have access to a public discussion channel is studied. We
propose generating separate keys from the source and channel components and
establish the optimality of this approach when the when the channel outputs of
the receiver and the eavesdropper are conditionally independent given the
input.Comment: 29 Pages, Submitted IEEE Trans. Information Theor
The Private Key Capacity of a Cooperative Pairwise-Independent Network
This paper studies the private key generation of a cooperative
pairwise-independent network (PIN) with M+2 terminals (Alice, Bob and M
relays), M >= 2. In this PIN, the correlated sources observed by every pair of
terminals are independent of those sources observed by any other pair of
terminal. All the terminals can communicate with each other over a public
channel which is also observed by Eve noiselessly. The objective is to generate
a private key between Alice and Bob under the help of the M relays; such a
private key needs to be protected not only from Eve but also from individual
relays simultaneously. The private key capacity of this PIN model is
established, whose lower bound is obtained by proposing a novel random binning
(RB) based key generation algorithm, and the upper bound is obtained based on
the construction of M enhanced source models. The two bounds are shown to be
exactly the same. Then, we consider a cooperative wireless network and use the
estimates of fading channels to generate private keys. It has been shown that
the proposed RB-based algorithm can achieve a multiplexing gain M-1, an
improvement in comparison with the existing XOR- based algorithm whose
achievable multiplexing gain is about [M]/2.Comment: 5 pages, 3 figures, IEEE ISIT 2015 (to appear
Key Generation in Wireless Sensor Networks Based on Frequency-selective Channels - Design, Implementation, and Analysis
Key management in wireless sensor networks faces several new challenges. The
scale, resource limitations, and new threats such as node capture necessitate
the use of an on-line key generation by the nodes themselves. However, the cost
of such schemes is high since their secrecy is based on computational
complexity. Recently, several research contributions justified that the
wireless channel itself can be used to generate information-theoretic secure
keys. By exchanging sampling messages during movement, a bit string can be
derived that is only known to the involved entities. Yet, movement is not the
only possibility to generate randomness. The channel response is also strongly
dependent on the frequency of the transmitted signal. In our work, we introduce
a protocol for key generation based on the frequency-selectivity of channel
fading. The practical advantage of this approach is that we do not require node
movement. Thus, the frequent case of a sensor network with static motes is
supported. Furthermore, the error correction property of the protocol mitigates
the effects of measurement errors and other temporal effects, giving rise to an
agreement rate of over 97%. We show the applicability of our protocol by
implementing it on MICAz motes, and evaluate its robustness and secrecy through
experiments and analysis.Comment: Submitted to IEEE Transactions on Dependable and Secure Computin
Secret-key generation from wireless channels: Mind the reflections
Secret-key generation in a wireless environment exploiting the randomness and
reciprocity of the channel gains is considered. A new channel model is proposed
which takes into account the effect of reflections (or re-radiations) from
receive antenna elements, thus capturing an physical property of practical
antennas. It turns out that the reflections have a deteriorating effect on the
achievable secret-key rate between the legitimate nodes at high
signal-to-noise-power-ratio (SNR). The insights provide guidelines in the
design and operation of communication systems using the properties of the
wireless channel to prevent eavesdropping.Comment: 6 pages, 9 figure
- …