National Conference on Communications

Implementation of physical layer key sharing schemes using Software Defined Radios

Venkata Sreenath, Andrew Thangaraj

Published Feb 1, 2013• 0 citations

Abstract

We present implementations of two secret key sharing schemes over a Gaussian wire-tap channel and an error-free public side channel. Information-theoretic secrecy is the basis for these schemes. The first scheme uses only one-way communication between transmitter and receiver. In this case, without interaction, we share randomness from transmitter to receiver and extract a secret key from this randomness with the help of extra information sent by the transmitter on the side channel. In this scheme, we show it is possible to agree on a secret key, if the channel conditions between transmitter and receiver are better than that of the transmitter and any eavesdropper. The second scheme is with two-way communication between transmitter and receiver. In this case, we model the AWGN channel as a Binary Symmetric Channel, and show that it is possible for secret key sharing even if the transmitter-eavesdropper channel quality is better than that of the transmitter-receiver channel. We present simulation and experimental results for both these schemes with the help of Software Defined Radio tools.

DOI: 10.1109/ncc.2013.6487957

Related papers

On the use of secret keys in broadcast channels with receiver side information

Rafael F. Schaefer, Ashish J. Khisti, Holger Boche

The use of secret keys in broadcast channels with receiver side information is studied. The particular scenario is analyzed where a transmitter wants to send two confidential messages to two receivers, while keeping an external eavesdropper ignorant. Each receiver has one of the confidential messages as side information available for decoding. In addition to that, the transmitter shares independent secret keys of arbitrary rates with both receivers. The secret keys can be used in different ways: They can act as one-time pads to encrypt the confidential messages or they can be used as randomization resources for wiretap coding. Both approaches are discussed and an achievable rate region based on superposition coding is established for the one-time pad approach. For the wiretap coding approach, the secrecy capacity for degraded channels is derived. In the optimal coding scheme, the available secret keys are used as the randomization part of the wiretap code to keep the eavesdropper ignorant. In establishing the capacity region, a new upper bound on the sum-rate is derived. This bound shows that in an optimal coding scheme, in the degraded case, the total equivocation-rate of the (opposite) secret-keys at the legitimate receivers must equal the equivocation-rate of the secret-keys at the eavesdropper, when informed about the messages.

IEEE International Conference on Acoustics Speech and Signal ProcessingMay 1, 20142 citations

Double-Layered Random Coding for Secret Key Generation in Gaussian Wiretap Channels

Ming Xu, Jiahui Liu

Most of the existing information-theoretic secure key generation schemes have characterized maximum achievable secrecy rate or secrecy capacity over noiseless public broadcast channels. However, in many practical systems even legitimate nodes have to communicate over noisy channels. In this letter, we propose a secret key generation scheme based on secure network coding in Gaussian wiretap channels. We prove that even when the channel from the sender to the receiver is weaker than that to the eavesdropper, secret communication at a positive rate is still possible if the condition σ1<; √σ2/2 + σ 2/3 is satisfied. Moreover, we establish an upper bound on the secrecy leakage rate after privacy amplification using double-layered random coding and joint typicality encoding and decoding over noisy public channels. The proof of achievability and the converse is given to demonstrate that the proposed scheme can achieve information-theoretic security.

IEEE Communications LettersDec 23, 20191 citation

Secret key agreement on wiretap channel with transmitter side information

Ashish J. Khisti

The secret-key agreement problem over wiretap channels controlled by a state parameter is studied. The entire state sequence is known (non-causally) to the sender but not to the receiver and the eavesdropper. Upper and lower bounds on the secret-key capacity are established both with and without public discussion. In absence of public-discussion, our lower bound is strictly better than the best known lower bound for transmitting an independent secret message. This illustrates that the coding schemes for secret-key agreement are substantially different than secret-message transmission. For the special case of Gaussian channels, we establish the secret-key capacity when the legitimate receiver's signal-to-noise-ratio is greater than 0 dB. When a public discussion channel is available between the sender and the receiver, upper and lower bounds on the secret-key capacity are again established. These bounds coincide, yielding the capacity, when then the channels of the receiver and the eavesdropper satisfy an independent noise condition.

European Wireless ConferenceJan 1, 201011 citations

Threat on Physical Layer Security: Side Channel vs. Wiretap Channel

Peng Hui Luo, Huiyun Li, Guoqing Xu +1 more

The location-specific channel state information can be exploited to generate secret keys for wireless system services, In the multipath wireless environment. Its secrecy capacity was usually studied with the wiretap channel model. This paper proposes a side channel model which is even more threatening to the security of the physical layer randomness based secret keys. We present the information-theoretic analysis of the side channel model, and compare it with the wire-tap model. The analysis indicates that the secret key capacity of the side-channel will be lower than that of the wire-tap channel, especially with a fading scenario. We conduct MATLAB simulation of physical layer randomness based key generation and SPICE simulation of key extraction to observe the side channel leakage of the circuit. The simulation results confirm the consistency of the key bits, thus verifying the feasibility of our proposed side-channel attack scheme against the physical layer security.

IEEE International Conference on Computational Science and Engineering (CSE)Dec 1, 20133 citations

Key agreement over a 3-receiver broadcast channel

Bahrami, Mohsen, Ali Bereyhi, Sadaf Salehkalaibar +1 more

In this paper, we consider the problem of secret key agreement in state-dependent 3-receiver broadcast channels. In the proposed model, there are two legitimate receivers, an eavesdropper and a transmitter where the channel state information is non-causally available at the transmitter. We consider two setups. In the first setup, the transmitter tries to agree on a common key with the legitimate receivers while keeping it concealed from the eavesdropper. Simultaneously, the transmitter agrees on a private key with each of the legitimate receivers that needs to be kept secret from the other legitimate receiver and the eavesdropper. For this setup, we derive inner and outer bounds on the secret key capacity region. In the second setup, we assume that a backward public channel is available among the receivers and the transmitter. Each legitimate receiver wishes to share a private key with the transmitter. For this setup, an inner bound on the private key capacity region is found. Furthermore, the capacity region of the secret key in the state-dependent wiretap channel can be deduced from our inner and outer bounds.

arXiv:1301.5142Jan 22, 20130 citations

Secret key agreement on wiretap channels with transmitter side information

Ashish J. Khisti

Secret-key agreement protocols over wiretap channels controlled by a state parameter are studied. The entire state sequence is known (non-causally) to the sender but not to the receiver and the eavesdropper. Upper and lower bounds on the secret-key capacity are established both with and without public discussion. The proposed coding scheme involves constructing a codebook to create common reconstruction of the state sequence at the sender and the receiver and another secret-key codebook constructed by random binning. For the special case of Gaussian channels, with no public discussion, - the secret-key generation with dirty paper problem, the gap between our bounds is at-most 1/2 bit and the bounds coincide in the high signal-to-noise ratio and high interference-to-noise ratio regimes. In the presence of public discussion our bounds coincide, yielding the capacity, when then the channels of the receiver and the eavesdropper satisfy an in- dependent noise condition.

arXiv:1006.5901Jun 30, 20107 citations