A new model for the two-user multiple-access wiretap channel is considered. In this model, the legitimate (main) channel is a discrete memoryless channel (DMC), and the wiretapper chooses a fixed-length subset of the channel uses where she has perfect access to the transmitted symbols of the both users, while observing the remainder of the transmitted codewords through a second DMC. As such, it generalizes the existing multiple-access wiretap channel models and extends the recently proposed new wiretap channel model to a multiple access setting. An achievable strong secrecy rate region for the model is derived. The achievability is established by solving a dual multi-terminal secret key agreement problem in the source model, where two independent sources are communicating confidential keys to a common decoder over a public channel in the presence of a compound wiretapping source. The secrecy of the two keys in the dual source model is established by deriving a lemma which provides a doubly exponential convergence rate for the probability of the keys being uniform and independent from the public discussion and the wiretapping source observation.
A new model for the two-user multiple-access wiretap channel is considered. In this model, the legitimate (main) channel is a discrete memoryless channel (DMC), and the wiretapper chooses a fixed-length subset of the channel uses where she has perfect access to the transmitted symbols of the both users, while observing the remainder of the transmitted codewords through a second DMC. As such, it generalizes the existing multiple-access wiretap channel models and extends the recently proposed new wiretap channel model to a multiple access setting. An achievable strong secrecy rate region for the model is derived. The achievability is established by solving a dual multi-terminal secret key agreement problem in the source model, where two independent sources are communicating confidential keys to a common decoder over a public channel in the presence of a compound wiretapping source. The secrecy of the two keys in the dual source model is established by deriving a lemma which provides a doubly exponential convergence rate for the probability of the keys being uniform and independent from the public discussion and the wiretapping source observation.
In this paper, a new wiretap channel model is proposed, where the legitimate transmitter and receiver communicate over a discrete memoryless channel. The wiretapper has perfect access to a fixed-length subset of the transmitted code word symbols of her choosing. Additionally, she observes the remainder of the transmitted symbols through a discrete memoryless channel. This new model subsumes the classical wiretap channel and wiretap channel II with noisy main channel as its special cases, and is termed as the generalized wiretap channel for that reason. The strong secrecy capacity of the proposed channel model is identified. Achievability is established by solving a dual secret key agreement problem in the source model, and converting the solution to the original channel model using probability distribution approximation arguments. In the dual problem, a source encoder and decoder, who observe random sequences independent and identically distributed according to the input and output distributions of the legitimate channel in the original problem, communicate a confidential key over a public error-free channel using a single forward transmission, in the presence of a compound wiretapping source who has perfect access to the public discussion. The security of the key is guaranteed for the exponentially many possibilities of the subset chosen at the wiretapper by deriving a lemma which provides a doubly-exponential convergence rate for the probability that, for a fixed choice of the subset, the key is uniform and independent from the public discussion and the wiretapping source's observation. The converse is derived by using Sanov's theorem to upper bound the secrecy capacity of the generalized wiretap channel by the secrecy capacity when the tapped subset is randomly chosen by nature.
In this paper, new two-user multiple access wiretap channel models are studied. First, the multiple access wiretap channel II with a discrete memoryless main channel under different wiretapping scenarios is introduced. The wiretapper, as in the classical wiretap channel II model, chooses a fixed-size subset of the channel uses, in which it obtains noise-free observations of one of the codewords: a deterministic function, e.g., superposition, of the two codewords or each of the two codewords. A fourth wiretapping scenario is considered, in which the wiretapper, in each position it chooses, decides to observe either one of the codewords or both codewords, with an overall budget on the number of its noiselessly observed symbols. These, thus, extend the recently examined wiretap channel II with a noisy main channel to a multiple access setting with a variety of attack models for the wiretapper. Next, the proposed multiple access wiretap channel II models are further generalized to the case when the wiretapper observes the outputs of a discrete memoryless channel, instead of erasures, outside the subset of noiseless observations. Achievable strong secrecy rate regions for all the proposed models are derived. Achievability is established by solving dual multi-terminal secret key agreement problems in the source model and converting the solution to the original channel models using probability distribution approximation arguments. The derived achievable rate regions quantify the secrecy cost due to the additional capabilities of the wiretapper with respect to the previous multiple access wiretap models.
A two transmitter multiple access wiretap channel II (MAC-WT-II) with a discrete memoryless (DM) main channel is investigated. Two models for the wiretapper, who chooses a fixed-length subset of the channel uses and observes erasures outside this subset, are proposed. In the first model, in each position of the subset, the wiretapper noiselessly observes either the first or the second user's symbol, while in the second model, the wiretapper observes a noiseless superposition of the two symbols. Achievable strong secrecy rate regions for the two models are derived. The achievability is established by solving a dual secret key agreement problem in the source model. The secrecy of the keys in the dual source model is established by deriving a lemma which provides a doubly exponential convergence rate for the probability of the keys being uniform and independent from the wiretapper's observation. The results extend the recently examined WTC-II with a DM main channel to a multiple access setting.
In this paper, a new wiretap channel (WTC) model with a discrete memoryless (DM) main channel and a wiretapper who noiselessly observes a fixed portion, of her choice, of the transmitted symbols, while observing the remaining transmitted symbols through another DM channel (DMC), is considered. The strong secrecy capacity of the model is identified. The achievability is established using the output statistics of random binning framework which exploits the duality between source and channel coding problems. The converse is derived by upper bounding the secrecy capacity of an equivalent model with the secrecy capacity of a DM-WTC. This result generalizes both the classical DM-WTC and the WTC-II with a DM main channel.
The secrecy capacity of an extended communication model of wiretap channelII is determined. In this channel model, the source message is encoded into a digital sequence of length N and transmitted to the legitimate receiver through a discrete memoryless channel (DMC). There exists an eavesdropper who is able to observe arbitrary μ = N α digital symbols from the transmitter through a second DMC, where 0 ≤ α ≤ 1 is a constant real number. A pair of an encoder and a decoder is designed to let the receiver be able to recover the source message with a vanishing decoding error probability and keep the eavesdropper ignorant of the message. This communication model includes a variety of wiretap channels as special cases. The coding scheme is based on that designed by Ozarow and Wyner for the classic wiretap channel II.
The concept of the wiretap channel was first proposed by Wyner. He considered the case in which data is to be transmitted reliably over a discrete memoryless main channel to a legitimate receiver. The wiretapper views the output of the main channel through another discrete memoryless channel. It is assumed that the wiretapper knows the code being used and his only handicap is the additional noise in his signal. The problem is to maximize the transmission rate R to the legitimate receiver and the equivocation d of the wiretapper. In this dissertation, the additive white Gaussian noise wiretap channel is introduced and the set of all achievable (R,d) pairs is determined explicitly through the use of certain special properties of the Gaussian channel. Some useful characterizations of a special class of wiretap channels are also explored. A model of the wiretap channel with feedback is proposed. It turns out that with the introduction of feedback, even when the main channel is inferior to the wiretapper's channel, it is still possible to reliably communicate with the legitimate receiver in complete secrecy. The binary erasure wiretap channel with feedback is examined and inner and outer bounds on the achievable (R,d) region are given. Finally, a scheme for enlarging the capacity region of multiple-access channels using feedback is analyzed. It is shown that conditions under which an enlargement is possible are fairly weak, indicating that feedback can almost increase the capacity region. (Author)