IEEE International Symposium on Information Theory (ISIT)

Secret Key Generation From Vector Gaussian Sources With Public and Private Communications

Yinfei Xu, Daming Cao

Published Jun 1, 2020• 2 citations

Abstract

In this paper, we consider the problem of secret key generation with one-way communication through both a rate-limited public channel and a rate-limited secure channels where the public channel is from Alice to Bob and Eve and the secure channel is from Alice to Bob. In this model, we do not pose any constraints on the sources, i.e. Bob is not degraded to or less noisy than Eve. We obtain the optimal secret key rate in this problem, for the vector Gaussian sources setting. The characterization is derived by suitably applying the enhancement argument, and Proving a new extremal inequality. The extremal inequality can be seen as coupling of two extremal inequalities, which are related to the degraded compound MIMO Gaussian broadcast channel, and the vector generalization of Costa's entropy power inequality, accordingly.

DOI: 10.1109/isit44484.2020.9174516

Related papers

Secret Key Generation From Vector Gaussian Sources With Public and Private Communications

Yinfei Xu, Daming Cao

In this paper, we consider the problem of secret key generation with one-way communication through both a rate-limited public channel and a rate-limited secure channels where the public channel is from Alice to Bob and Eve and the secure channel is from Alice to Bob. In this model, we do not pose any constraints on the sources, i.e. Bob is not degraded to or less noisy than Eve. We obtain the optimal secret key rate in this problem, both for the discrete memoryless sources and vector Gaussian sources. The vector Gaussian characterization is derived by suitably applying the enhancement argument, and proving a new extremal inequality. The extremal inequality can be seen as coupling of two extremal inequalities, which are related to the degraded compound MIMO Gaussian broadcast channel, and the vector generalization of Costa's entropy power inequality, accordingly.

IEEE Transactions on Information TheoryJun 4, 20218 citations

Secret Key Generation from Vector Gaussian Sources with Public and Private Communications

Yinfei Xu, Daming Cao

In this paper, we consider the problem of secret key generation with one-way communication through both a rate-limited public channel and a rate-limited secure channels where the public channel is from Alice to Bob and Eve and the secure channel is from Alice to Bob. In this model, we do not pose any constraints on the sources, i.e. Bob is not degraded to or less noisy than Eve. We obtain the optimal secret key rate in this problem, both for the discrete memoryless sources and vector Gaussian sources. The vector Gaussian characterization is derived by suitably applying the enhancement argument, and Proving a new extremal inequality. The extremal inequality can be seen as coupling of two extremal inequalities, which are related to the degraded compound MIMO Gaussian broadcast channel, and the vector generalization of Costa's entropy power inequality, accordingly.

arXiv:2004.05086Apr 9, 20200 citations

Secret key generation from correlated sources and secure link

Daming Cao, Wei Kang

In this paper, we study the problem of secret key generation with one-way communication, where in addition to the rate limited public channel, which can be observed by both Bob and Eve, we add a secure channel, which only connects Alice and Bob. In this model, we do not pose any constraints on the sources, i.e. Bob is not degraded to or less noisy than Eve. We propose an achievability scheme, and we also suggest a converse, which meets the achievability. Therefore, we obtain the secret key capacity for this model.

arXiv:1704.05220International Conference on Wireless Communications and Signal Processing (WCSP)Oct 1, 20174 citations

Secret Key Agreement From Vector Gaussian Sources by Rate Limited Public Communication

Shun Watanabe, Yasutada Oohama

We investigate the secret key agreement from correlated vector Gaussian sources in which legitimate parties can use public communication with limited rate. For the class of protocols with one-way public communication, we show that the optimal trade-off between the rate of key generation and the rate of the public communication is characterized as an optimization problem of a Gaussian random variable. The characterization is derived by using the enhancement technique introduced by Weingarten for multiple-input-multiple-output (MIMO) Gaussian broadcast channel.

arXiv:1009.5760IEEE Transactions on Information Forensics and SecurityMar 29, 201172 citations

Secret key agreement from vector Gaussian sources by rate limited public communication

Shun Watanabe, Yasutada Oohama

We investigate the secret key agreement from correlated vector Gaussian sources in which the legitimate parties can use the public communication with limited rate. For the class of protocols with the one-way public communication, we show that the optimal trade-off between the rate of key generation and the rate of the public communication is characterized as an optimization problem of a Gaussian random variable. The characterization is derived by using the enhancement technique introduced by Weingarten et. al. for MIMO Gaussian broadcast channel.

IEEE International Symposium on Information Theory (ISIT)Jun 1, 201018 citations

Secrecy via Sources and Channels 1

Vinod M. Prabhakaran, Krishnan Eswaran, Kannan Ramch

Alice and Bob want to share a secret key and to communicate an independent message, both of which they desire to be kept secret from an eavesdropper Eve. We study this problem of secret communication and secret key generation when two resources are available – correlated sources at Alice, Bob, and Eve, and a noisy broadcast channel from Alice to Bob and Eve which is independent of the sources. We are interested in characterizing the fundamental trade-off between the rates of the secret message and secret key. We present an achievable solution and prove its optimality for the parallel channels and sources case when each sub-channel and source component satisfies a degradation order (either in favor of the legitimate receiver or the eavesdropper). This includes the case of jointly Gaussian sources and an additive Gaussian channel, for which the secrecy region is evaluated. I.

Mar 17, 201141 citations