Network Coding and Wireless Physical-layer ... - Jacobs University
Network Coding and Wireless Physical-layer ... - Jacobs University
Network Coding and Wireless Physical-layer ... - Jacobs University
Create successful ePaper yourself
Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.
Chapter 7: <strong>Physical</strong>-<strong>layer</strong> Key Encoding for <strong>Wireless</strong> <strong>Physical</strong>-<strong>layer</strong> Secret-key<br />
Generation (WPSG) with Unequal Security Protection (USP) 99<br />
7.3 The Equivalent Number of Vulnerable Bits for<br />
the Design of <strong>Physical</strong>-Layer Key Encoding<br />
The analysis given in the last section is based on the assumption that the encoder knows<br />
I V K .<br />
However, empirical results in [33, 34] show that the encoder normally can only<br />
estimate the ratio I V K /I K instead of I V K alone. In this section, we derive an equivalent<br />
number of vulnerable bits, denoted by I V ′ K , as a design parameter that can substitute<br />
I V K in the theorems discussed in the last section. To do so, we first propose a model of an<br />
enemy cryptanalyst based on the ratio I V K /I K estimated by the legitimate transmitter.<br />
According to Fig. 7.2 (a), the enemy is modeled to have almost the same structure<br />
as the legitimate transmitter <strong>and</strong> receiver. However, since it can only estimate channel<br />
coefficients from an imaginary channel which differs from the key-generating channel used<br />
by the legitimate terminals, we propose an equivalent model in Fig. 7.2 (b).<br />
In the<br />
equivalent model, the enemy does estimate the key-generating channel, but the quantized<br />
key K is distorted by a binary symmetric channel (BSC), erring each estimated key bit<br />
with a probability p.<br />
The legitimate transmitter has to guess this error probability p<br />
based on its estimate of 1 − (I V K /I K ). For security, the estimated value p should not be<br />
more than the estimated 1 − (I V K /I K ).<br />
Based on the equivalent model, we can specify the relationship between the estimate<br />
of p <strong>and</strong> the design parameter I ′ V K<br />
needed for perfect secrecy in Theorem 7.4.<br />
Theorem 7.4 If the enemy cryptanalyst behaves according to the model in Fig. 7.2 (b)<br />
having p as the error probability of the binary symmetric channel, <strong>and</strong> the generator matrix<br />
prototype in the form of equations (7.10) or (7.11) is used, when I V ′ K + 1, being even or<br />
odd, respectively, substitutes I V K + 1, the following conditions on I ′ V K<br />
are sufficient for<br />
perfect secrecy. [4]