The present communication deals with the development of new coding theorems in terms of channel equivocation, that is, coding is done for a source which selects a new set of source statistics after each output symbol is received from the channel. New proof for Fano’s bound on Shannon’s equivocation is provided by using log sum inequality. Moreover, bounds on various generalizations of Shannon’s...

This paper investigates the problem of secure distributed lossless compression in the presence of arbitrarily correlated side information at an eavesdropper. This scenario consists of two encoders (referred to as Alice and Charlie) that wish to reliably transmit their respective (correlated) sources to a legitimate receiver (referred to as Bob) while satisfying some requirement on the equivocat...

A new applicable wiretap channel with separated side information is considered here which consist of a sender, a legitimate receiver and a wiretapper. In the considered scenario, the links from the transmitter to the legitimate receiver and the eavesdropper experience different conditions or channel states. So, the legitimate receiver and the wiretapper listen to the transmitted signal through ...

This paper establishes the utility of user cooperation in facilitating secure wireless communications. In particular, the four-terminal relay-eavesdropper channel is introduced and an outer-bound on the optimal rate-equivocation region is derived. Several cooperation strategies are then devised and the corresponding achievable rate-equivocation region are characterized. Of particular interest i...

Discrete memoryless interference and broadcast channels in which independent confidential messages are sent to two receivers are considered. Confidential messages are transmitted to each receiver with perfect secrecy, as measured by the equivocation at the other receiver. In this paper, we derive inner and outer bounds for the achievable rate regions for these two communication systems.

In this paper, new inner and outer bounds on the achievable compression-equivocation rate region for generalized secure data compression with side information are given that do not match in general. In this setup, two senders, Alice and Charlie intend to transmit information to Bob via channels with limited capacity so that he can reliably reconstruct their observations. The eavesdropper, Eve, ...

In this paper, bounds to the rate-equivocation region for the general 3-receiver broadcast channel (BC) with degraded message sets, are presented for confidential messages to be kept secret from one of the receivers. This model is more general than the 2-receiver BCs with confidential messages with an external wiretapper, and the recently studied 3-receiver degraded BCs with confidential messag...

In this paper, the model of wiretap channel has been reconsidered for the case that the main channel is controlled by channel state information (side information), and it is available at the transmitter in a noncausal manner (termed here noncausal side information) or causal manner (termed here causal side information). Inner and outer bounds are derived on the capacity-equivocation regions for...

Wyner’s results for discrete memoryless wire-tap channels are extended to the Gaussian wire-tap channel. It is shown that the secrecy capacity C, is the difference between tbe capacit ies of the main and wire-tap channels. It is further shown tbat Rd= C, is the upper boundary of the achievable rate-equivocation region.