IEEE Information Theory Workshop (ITW)

Simultaneously generating multiple keys over a cascade of a noiseless channel and a wiretap channel

Wenwen Tu, Mario Goldenbaum, Lifeng Lai, H. Vincent Poor

Published Sep 1, 2016• 2 citations

Abstract

In this paper, the problem of simultaneously generating multiple keys over a cascade of a noiseless channel and a wiretap channel is considered. The problem consists of three legitimate parties, i.e., Alice, Bob and Carol, where Alice and Bob wish to agree with Carol on independent secret keys. Alice and Bob are connected via a noiseless channel, and Bob is connected with Carol via a wiretap channel, while there is no direct connection between Alice and Carol. To Alice and Carol, Bob acts as a relay. Under this model, a single-letter characterization of the secret-key capacity region is provided. The result shows that there exists a trade-off between the individual secret-key rates.

DOI: 10.1109/itw.2016.7606825

Related papers

On Simultaneously Generating Multiple Keys in a Joint Source-Channel Model

Wenwen Tu, Mario Goldenbaum, Lifeng Lai +1 more

In this paper, the problem of simultaneously generating multiple keys over a cascade of a noiseless channel and a wiretap channel is considered. The problem consists of three legitimate parties (i.e., Alice, Bob, and Carol) and an eavesdropper (Eve), where Alice and Bob wish to agree with Carol on independent secret keys, both of which should be kept secret from Eve. Alice and Bob are connected via a noiseless channel, and Bob is connected with Carol via a wiretap channel, while there is no direct connection between Alice and Carol. To Alice and Carol, Bob acts as a relay. Under this model, a full characterization of the secret-key capacity region is provided for the case in which Eve has no side information. This result shows that there exists a tradeoff between the individual secret-key rates. Then, this result is generalized to the case in which Eve has side information, and the corresponding secret-key capacity region is fully characterized.

IEEE Transactions on Information Forensics and SecuritySep 21, 201611 citations

Multiple key generation with restricted public discussion structure

Wenwen Tu, Mario Goldenbaum, Lifeng Lai +1 more

In this paper, the problem of simultaneously generating multiple keys in a model where the key generating parties have restricted access to public discussions is considered. The model consists of four terminals, i.e., Alice, Bob, Carol and Eve. Alice and Bob are connected via a noiseless channel while Bob connects with Carol and Eve via a wiretap channel. There is no direct link connecting Alice with Carol or Eve, and hence Carol and Eve cannot directly access the discussion between Alice and Bob. Alice wishes to share a secret key with Carol while Bob wishes to share another independent secret key with Carol. Under this model, inner and outer bounds on the secret-key capacity region are provided. It is shown that the two bounds match when a certain Markov chain relationship holds.

IEEE Conference on Communications and Network SecurityOct 1, 20160 citations

Capacity Region for Covert Secret Key Generation Over Multiple Access Channels

Yingxin Zhang, Lin Zhou, Qiaosheng Eric Zhang

We study covert secret key generation over a two-user multiple access channel with one-way public discussion and derive bounds on the capacity region. Specifically, in this problem, there are three legitimate parties: Alice, Bob and Charlie. The goal is to allow Charlie to generate a secret key with Alice and another secret key with Bob, reliably, secretly and covertly. Reliability ensures that the key generated by Alice and Charlie is the same and the key generated by Bob and Charlie is the same. Secrecy ensures that the secret keys generated are only known to specific legitimate parties. Covertness ensures that the key generation process is undetectable by a warden Willie. As a corollary of our result, we establish bounds on the capacity region of wiretap secret key generation without the covertness constraint and discuss the impact of covertness. Our results generalize the point-to-point result of Tahmasbi and Bloch (TIFS 2020) to the setting of multiterminal communication.

IEEE Transactions on Information TheoryNov 17, 20250 citations

Capacity Region for Covert Secret Key Generation over Multiple Access Channels

Yingxin Zhang, Lin Zhou, Qiaosheng Eric Zhang

We study covert secret key generation over a binary-input two-user multiple access channel with one-way public discussion and derive bounds on the capacity region. Specifically, in this problem, there are three legitimate parties: Alice, Bob and Charlie. The goal is to allow Charlie to generate a secret key with Alice and another secret key with Bob, reliably, secretly and covertly. Reliability ensures that the key generated by Alice and Charlie is the same and the key generated by Bob and Charlie is the same. Secrecy ensures that the secret keys generated are only known to specific legitimate parties. Covertness ensures that the key generation process is undetectable by a warden Willie. As a corollary of our result, we establish bounds on the capacity region of wiretap secret key generation without the covertness constraint and discuss the impact of covertness. Our results generalize the point-to-point result of Tahmasbi and Bloch (TIFS 2020) to the setting of multiterminal communication.

arXiv:2504.05828Apr 8, 20250 citations

Capacity Region for Covert Secret Key Generation over Multiple Access Channels

Yingxin Zhang, Lin Zhou, Qiaosheng Eric Zhang

IEEE Information Theory Workshop (ITW)Sep 29, 20251 citation

Private Key and Group Key Generation Using Correlated Sources and Wiretap Broadcast Channel in Presence of One-Way Public Communication

Shixun Gong, Xiaofeng Tao, Na Li +1 more

Encryption with shared key is one of the methods to ensure secure communication. To meet the requirements of keys, this paper investigates the problem of generating private key (PK) and group key (GK) using correlated sources and discrete memoryless wiretap broadcast channel (DM-WBC), in presence of one-way public communication. In the model considered, one transmitter (Alice) and three receivers (Bob, Carol and Eve) are connected via a DM-WBC, and a one-way communication over a public noiseless channel, initiated by Alice, is available. Alice and Bob wish to share a PK that is concealed from Carol and Eve, and they also want to generate a GK with Carol that needs to keep secret from Eve. Under this model, the key capacity regions of PK and GK are established by designing joint source-channel coding schemes to achieve these regions. In PK-generation, the considered model can be viewed as a one receiver two-eavesdropper model, and Alice and Bob have access to correlated source sequences. In GK-generation, the considered model can be viewed as a two-receiver one eavesdropper model, and the three legitimate parties (Alice, Bob and Carol) all have the source observations. Furthermore, the security performance of the generated keys are analyzed by analyzing key leakage rate of each key.

IEEE AccessJan 1, 20196 citations