In this work, we aim to design a stealthy secret key generation (SSKG) scheme for a completely concealed communication system. More specifically, the data transmission is accomplished by covert communications, which requires additional keys to guarantee the covertness when Bob's channel quality is worse than a warden Willie's in a special definition. However, normal SKG schemes may raise Willie's attention and violate the design goal. Therefore, we resort to the SSKG. The derived results show that the SK capacity lower and upper bounds of the source-model SKG are not affected by the additional stealth constraint. This result implies that we can attain the stealthy SKG capacity for free when the common randomness observed at each node forms a Markov chain. We then prove that the sufficient condition to attain the SK capacity can be relaxed from physical to stochastic degradedness. In order to underline the practical relevance, we also derive a sufficient condition to attain the degradedness by the usual stochastic order for the fast fading Gaussian Maurer's (satellite) model for the source of common randomness.
In this work, we aim to design a stealthy secret key generation (SSKG) scheme for a completely concealed communication system. More specifically, the data transmission is accomplished by covert communications, which requires additional keys to guarantee the covertness when Bob's channel quality is worse than a warden Willie's in a special definition. However, normal SKG schemes may raise Willie's attention and violate the design goal. Therefore, we resort to the SSKG. The derived results show that the SK capacity lower and upper bounds of the source-model SKG are not affected by the additional stealth constraint. This result implies that we can attain the stealthy SKG capacity for free when the common randomness observed at each node forms a Markov chain. We then prove that the sufficient condition to attain the SK capacity can be relaxed from physical to stochastic degradedness. In order to underline the practical relevance, we also derive a sufficient condition to attain the degradedness by the usual stochastic order for the fast fading Gaussian Maurer's (satellite) model for the source of common randomness.
In this work, we consider a complete covert communication system, which includes the source-model of a stealthy secret key generation (SSKG) as the first phase. The generated key will be used for the covert communication in the second phase of the current round and also in the first phase of the next round. We investigate the stealthy SK rate performance of the first phase. The derived results show that the SK capacity lower and upper bounds of the source-model SKG are not affected by the additional stealth constraint. This result implies that we can attain the SSKG capacity for free when the sequences observed by the three terminals Alice (Xn), Bob (Yn) and Willie (Zn) follow a Markov chain relationship, i.e., Xn−Yn−Zn. We then prove that the sufficient condition to attain both, the SK capacity as well as the SSK capacity, can be relaxed from physical to stochastic degradedness. In order to underline the practical relevance, we also derive a sufficient condition to attain the degradedness by the usual stochastic order for Maurer's fast fading Gaussian (satellite) model for the source of common randomness.
To conceal the behavior of communications, we may adopt covert or stealthy communications under different scenarios and demands. However, when legitimate users have worse channels than the eavesdropper, the legitimate users may need additional keys to attain the concealment. Normal secret key generation (SKG) schemes may raise Willie's attention due to the public discussion breaking the concealment. Therefore, in this work, we investigate how to conceal the SKG itself, especially according to the stealth constraint. We prove that if the virtual channel between the common random source observed by the legitimate Alice and Bob, namely, X and Y, respectively, is more capable than that between Bob and Willie (the warden), namely, Y and Z, respectively, the same stealthy SK rate as in the case without stealth constraint can be achieved. Furthermore, if (X, Y, Z) form a Markov chain, then the key capacity of the SKG with the stealth constraint can be achieved for free.
In order to make a warden, Willie, unaware of the existence of meaningful communications, there have been different schemes proposed including covert and stealth communications. When legitimate users have no channel advantage over Willie, the legitimate users may need additional secret keys to confuse Willie, if the stealth or covert communication is still possible. However, secret key generation (SKG) may raise Willie's attention since it has a public discussion, which is observable by Willie. To prevent Willie's attention, we consider the source model for SKG under a strong secrecy constraint, which has further to fulfill a stealth constraint. Our first contribution is that, if the stochastic dependence between the observations at Alice and Bob fulfills the strict more capable criterion with respect to the stochastic dependence between the observations at Alice and Willie or between Bob and Willie, then a positive stealthy secret key rate is identical to the one without the stealth constraint. Our second contribution is that, if the random variables observed at Alice, Bob, and Willie induced by the common random source form a Markov chain, then the key capacity of the source model SKG with the strong secrecy constraint and the stealth constraint is equal to the key capacity with the strong secrecy constraint, but without the stealth constraint. For the case of fast fading models, a sufficient condition for the existence of an equivalent model, which is degraded, is provided, based on stochastic orders. Furthermore, we present an example to illustrate our results.
In order to make a warden, Willie, unaware of the existence of meaningful communications, there have been different schemes proposed including covert and stealth communications. When legitimate users have no channel advantage over Willie, the legitimate users may need additional secret keys to confuse Willie, if the stealth or covert communication is still possible. However, secret key generation (SKG) may raise Willie’s attention since it has a public discussion, which is observable by Willie. To prevent Willie’s attention, we consider the source model for SKG under a strong secrecy constraint, which has further to fulfill a stealth constraint. Our first contribution is that, if the stochastic dependence between the observations at Alice and Bob fulfills the strict more capable criterion with respect to the stochastic dependence between the observations at Alice and Willie or between Bob and Willie, then a positive stealthy secret key rate is identical to the one without the stealth constraint. Our second contribution is that, if the random variables observed at Alice, Bob, and Willie induced by the common random source form a Markov chain, then the key capacity of the source model SKG with the strong secrecy constraint and the stealth constraint is equal to the key capacity with the strong secrecy constraint, but without the stealth constraint. For the case of fast fading models, a sufficient condition for the existence of an equivalent model, which is degraded, is provided, based on stochastic orders. Furthermore, we present an example to illustrate our results.
Although physical-layer secret key generation (SKG) techniques generally show promising performance in many wireless communication systems, they may not be applicable to satellite systems mainly because of the long coherence time. For the satellite systems, we need a technique to introduce randomness and it should be resistant to long round-trip delays. To achieve this, this paper proposes a novel SKG scheme using the information contained in the transmitted data, which can act as a random signal, instead of additionally generating random probing signals. The proposed method effectively increases secret key rates, without security risk. Simulation results demonstrated that the proposed scheme enhances the data transmission efficiency while maintaining lower secret key disagreement rate.
We consider secret key (SK) generation by two terminals, each of which observes an i.i.d. source which is correlated with the other; the two sources are jointly Gaussian with known distribution. The terminals are then allowed to communicate with each other, possibly interactively in many rounds and without rate restrictions, over a noiseless two-way public channel. Randomization is permitted at each terminal. The goal is for the terminals to generate a SK comprising discrete common randomness which is concealed from an eavesdropper that has access to the public interterminal communication. We establish that this maximum rate of SK generation, i.e., SK capacity, is, as expected, the per-symbol mutual information I of the correlated sources. Our main technical contribution is a new scheme for achieving SK capacity using structured codes. In our scheme, vector quantization at rate R nats/source symbol of the source at terminal 1 is performed by employing nested lattice codes with dithering. Then, a SK is generated by the terminals from the quantized random sequence at terminal 1 and the (unquantized) Gaussian source at terminal 2, using both lossy and lossless data compression techniques. Our algorithm, using a rate-R lattice quantizer, achieves a maximum SK rate of 1/2 log 1/(e-2I+(1-e-2I)e-2R), which tends to the SK capacity I with increasing R. Thus, our result also specifies the associated tradeoff between quantization rate R and the maximum achievable SK rate. This tradeoff is shown to be optimum among a certain restricted class of schemes for SK generation that involve quantization at rate R of a Gaussian source at one terminal.