On an upper bound of the secrecy capacity for a general wiretap channel
- 1 January 2005
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 21578095,p. 1641-1645
- https://doi.org/10.1109/isit.2005.1523623
Abstract
This paper is concerned with coding theorems for a generalized wiretap channel. In the problem of the wiretap channel it is important to characterize the secrecy capacity, i.e., the maximum achievable rate of information securely transmitted from a sender to a legitimate receiver in the presence of a wiretapper. In our model, channels are not restricted to memoryless channels. We first define the secrecy capacity Cs and evaluate Cs from information-spectrum approach. We give a new upper bound of Cs not including auxiliary random variables and explore conditions under which the obtained upper bound becomes tight for the cascaded wiretap channelKeywords
This publication has 6 references indexed in Scilit:
- Information-Spectrum Methods in Information TheoryPublished by Springer Nature ,2003
- Coding theorems on Shannon's cipher system with a general sourcePublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- A general formula for channel capacityIEEE Transactions on Information Theory, 1994
- Approximation theory of output statisticsIEEE Transactions on Information Theory, 1993
- Broadcast channels with confidential messagesIEEE Transactions on Information Theory, 1978
- The Wire-Tap ChannelBell System Technical Journal, 1975