27,873 research outputs found
Secret Key Generation from Correlated Sources and Secure Link
In this paper, we study the problem of secret key generation from both
correlated sources and a secure channel. We obtain the optimal secret key rate
in this problem and show that the optimal scheme is to conduct secret key
generation and key distribution jointly, where every bit in the secret channel
will yield more than one bit of secret key rate. This joint scheme is better
than the separation-based scheme, where the secure channel is used for key
distribution, and as a result, every bit in the secure channel can only provide
one bit of secret key rate.Comment: 5 pages, 1 figur
Channel-based key generation for encrypted body-worn wireless sensor networks
Body-worn sensor networks are important for rescue-workers, medical and many other applications. Sensitive data are often transmitted over such a network, motivating the need for encryption. Body-worn sensor networks are deployed in conditions where the wireless communication channel varies dramatically due to fading and shadowing, which is considered a disadvantage for communication. Interestingly, these channel variations can be employed to extract a common encryption key at both sides of the link. Legitimate users share a unique physical channel and the variations thereof provide data series on both sides of the link, with highly correlated values. An eavesdropper, however, does not share this physical channel and cannot extract the same information when intercepting the signals. This paper documents a practical wearable communication system implementing channel-based key generation, including an implementation and a measurement campaign comprising indoor as well as outdoor measurements. The results provide insight into the performance of channel-based key generation in realistic practical conditions. Employing a process known as key reconciliation, error free keys are generated in all tested scenarios. The key-generation system is computationally simple and therefore compatible with the low-power micro controllers and low-data rate transmissions commonly used in wireless sensor networks
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
- …