Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:1301.5142

Key agreement over a 3-receiver broadcast channel

Bahrami, Mohsen, Ali Bereyhi, Sadaf Salehkalaibar, Mohammad Reza Aref

Published Jan 22, 2013• 0 citations
arXivHTMLPDF

Abstract

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.

DOI
10.48550/arxiv.1301.5142

Related papers

Key agreement over a state-dependent 3-receiver broadcast channel

Mohsen Bahrami, 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.

Iran Workshop on Communication and Information Theory (IWCIT)•May 1, 2013•0 citations

Secret Key Agreement Using Conferencing in State- Dependent Multiple Access Channels with An Eavesdropper

Bahrami, Mohsen, Ali Bereyhi, Mahtab Mirmohseni +1 more

In this paper, the problem of secret key agreement in state-dependent multiple access channels with an eavesdropper is studied. For this model, the channel state information is non-causally available at the transmitters; furthermore, a legitimate receiver observes a degraded version of the channel state information. The transmitters can partially cooperate with each other using a conferencing link with a limited rate. In addition, a backward public channel is assumed between the terminals. The problem of secret key sharing consists of two rounds. In the first round, the transmitters wish to share a common key with the legitimate receiver. Lower and upper bounds on the common key capacity are established. In a special case, the capacity of the common key is obtained. In the second round, the legitimate receiver agrees on two independent private keys with the corresponding transmitters using the public channel. Inner and outer bounds on the private key capacity region are characterized. In a special case, the inner bound coincides with the outer bound. We provide some examples to illustrate our results.

arXiv:1301.5136•Jan 22, 2013•0 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.3052•IEEE Transactions on Information Forensics and Security•Jun 10, 2011•59 citations

On the secrecy capacity of 3-receiver Broadcast Channel with causal states and conferencing

Sadaf Salehkalaibar, Mohammad Reza Aref

We investigate the secrecy capacity region of 2-receiver, 1-eavesdropper Broadcast Channel (BC) with two causal states and conferencing decoders. The encoder sends two messages, one of them for both legitimate receivers and the other one for the first legitimate receiver. It keeps these messages secret from the eavesdropper. Each state is causally available at the corresponding receiver, while both states are known causally at the encoder. Each receiver wishes to send the state which is not available at the other receiver, through a noiseless link with limited capacity. We find an inner bound on the secrecy capacity region of this channel. The achievability scheme employs block Markov coding and Shannon strategy for channels with state. In each block, we make use of the states to generate two keys which will be used in the next block. The idea is to utilize the cooperation of both receivers to recover both keys at each receiver while ensuring secrecy. We also establish an outer bound on the secrecy capacity region of the 2-rec, 1-eav. BC with Causal Channel State Information (CCSI) and conferencing. We prove that the proposed bounds coincide for a special case.

IEEE International Symposium on Information Theory (ISIT)•Jul 1, 2012•0 citations

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 Processing•May 1, 2014•2 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 Conference•Jan 1, 2010•11 citations
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.
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.
In this paper, the problem of secret key agreement in state-dependent multiple access channels with an eavesdropper is studied. For this model, the channel state information is non-causally available at the transmitters; furthermore, a legitimate receiver observes a degraded version of the channel state information. The transmitters can partially cooperate with each other using a conferencing link with a limited rate. In addition, a backward public channel is assumed between the terminals. The problem of secret key sharing consists of two rounds. In the first round, the transmitters wish to share a common key with the legitimate receiver. Lower and upper bounds on the common key capacity are established. In a special case, the capacity of the common key is obtained. In the second round, the legitimate receiver agrees on two independent private keys with the corresponding transmitters using the public channel. Inner and outer bounds on the private key capacity region are characterized. In a special case, the inner bound coincides with the outer bound. We provide some examples to illustrate our results.
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.
We investigate the secrecy capacity region of 2-receiver, 1-eavesdropper Broadcast Channel (BC) with two causal states and conferencing decoders. The encoder sends two messages, one of them for both legitimate receivers and the other one for the first legitimate receiver. It keeps these messages secret from the eavesdropper. Each state is causally available at the corresponding receiver, while both states are known causally at the encoder. Each receiver wishes to send the state which is not available at the other receiver, through a noiseless link with limited capacity. We find an inner bound on the secrecy capacity region of this channel. The achievability scheme employs block Markov coding and Shannon strategy for channels with state. In each block, we make use of the states to generate two keys which will be used in the next block. The idea is to utilize the cooperation of both receivers to recover both keys at each receiver while ensuring secrecy. We also establish an outer bound on the secrecy capacity region of the 2-rec, 1-eav. BC with Causal Channel State Information (CCSI) and conferencing. We prove that the proposed bounds coincide for a special case.
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.
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.