IEEE International Symposium on Information Theory (ISIT)

Secret Key Capacity and Advantage Distillation Capacity

Jun Muramatsu, Kazuyuki Yoshimura, Peter Davis

Published Jul 1, 2006• 12 citations

Abstract

Secret key agreement is a procedure for agreeing on a secret key by exchanging messages over a public channel when a sender, a legitimate receiver and an eavesdropper have access to correlated sources. Maurer, IEEE Trans. Inf. Theory 1993 defined secret key capacity, which is the least upper bound of the key generation rate of the secret key agreement, and presented an upper and a lower bound for the secret key capacity. In this paper, the advantage distillation capacity is introduced and it is shown that this quantity equals to the secret key capacity. A naive information theoretical expression of the secret key capacity and the advantage distillation capacity is also presented. An example of correlated sources, for which an analytic expression of the secret key capacity can be obtained, is also presented

DOI: 10.1109/isit.2006.262102

Related papers

Secret Key Capacity and Advantage Distillation Capacity

Jun Muramatsu, Kazuyuki Yoshimura, P. DAVIS

Secret key agreement is a procedure for agreeing on a secret key by exchanging messages over a public channel when a sender, a legitimate receiver (henceforth referred to as a receiver), and an eavesdropper have access to correlated sources. Maurer [6] defined secret key capacity, which is the least upper bound of the key generation rate of the secret key agreement, and presented an upper and a lower bound for the secret key capacity. The advantage distillation capacity is introduced and it is shown that this quantity equals to the secret key capacity. Naive information theoretical expressions of the secret key capacity and the advantage distillation capacity are also presented. An example of correlated sources, for which an analytic expression of the secret key capacity can be obtained, is also presented.

IEICE Transactions on Fundamentals of Electronics Communications and Computer SciencesOct 1, 20068 citations

Some Results on Secret Key Agreement Using Correlated Sources

Jun Muramatsu, Kazuyuki Yoshimura, Kenichi Arai +1 more

This paper introduces some results related to secret key agreement.We consider the situation in which legitimate users Alice and Bob and an eavesdropper Eve each has access to a correlated source.To transmit messages securely, Alice and Bob must agree on a secret key.Secret key agreement is the procedure for agreeing on a secret key by exchanging messages over a public channel.

NTT technical reviewFeb 1, 20085 citations

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

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

1 Secret-Key Generation using Correlated Sources and Channels

Ashish J. Khisti, Student Member, Suhas N. Diggavi +1 more

Abstract—We study the secret-key capacity in a joint source-channel coding setup—the terminals are connected over a discrete memoryless channel and have access to side information, modelled as a pair of discrete memoryless source sequences. As our main result, we establish the upper and lower bounds on the secret-key capacity. In the lower bound expression, the equivocation terms of the source and channel components are functionally additive even though the coding scheme generates a single secret-key by jointly taking into account the source and channel equivocations. Our bounds coincide, thus establishing the capacity, when the underlying wiretap channel can be decomposed into a set of independent, parallel, and reversely degraded channels. For the case of parallel Gaussian channels and jointly Gaussian sources we show that Gaussian codebooks achieve the secret-key capacity. In addition, when the eavesdropper also observes a correlated side information sequence, we establish the secret-key capacity when both the source and channel of the eavesdropper are a degraded version of the legitimate receiver. We finally also treat the case when a public discussion channel is available, propose a separation based coding scheme, and establish its optimality when the channel output symbols of the legitimate receiver and eavesdropper are conditionally independent given the input. Index Terms—Information theoretic security, joint sourcechannel coding, public discussion, secret-key agreement, wiretap channel. I.

Jan 1, 201155 citations

Secret-Key Agreement With Channel State Information at the Transmitter

Ashish J. Khisti, Suhas N. Diggavi, Gregory W. Wornell

We study the capacity of secret-key agreement over a wiretap channel with state parameters. The transmitter, the legitimate receiver, and the eavesdropper are connected by a discrete memoryless wiretap channel with a memoryless state sequence. The transmitter and the legitimate receiver generate a secret-key that must be concealed from the eavesdropper. We assume that the state sequence is known noncausally to the transmitter and no public discussion channel is available. We derive lower and upper bounds on the secret-key capacity. The lower bound involves a source-channel codebook for constructing a common reconstruction sequence at the legitimate terminals and then mapping this sequence to a secret-key using a secret-key codebook. For the special case of Gaussian channels with additive interference (secret-keys from dirty paper channel) our bounds differ by 0.5 bit/symbol and coincide in the high signal-to-noise-ratio and high interference-to-noise-ratio regimes. In another special case-symmetric channel state information (CSI)-when the legitimate receiver is also revealed the state sequence, we establish optimality of our lower bound. In addition, only causal side information at the transmitter and the receiver suffices to attain the secret-key capacity in the case of symmetric CSI.

arXiv:1009.3052IEEE Transactions on Information Forensics and SecurityJun 10, 201163 citations