The Wire-Tap Channel | RDL Research Database

Abstract

We consider the situation in which digital data is to be reliably transmitted over a discrete, memoryless channel (dmc) that is subjected to a wire-tap at the receiver. We assume that the wire-tapper views the channel output via a second dmc). Encoding by the transmitter and decoding by the receiver are permitted. However, the code books used in these operations are assumed to be known by the wire-tapper. The designer attempts to build the encoder-decoder in such a way as to maximize the transmission rate R, and the equivocation d of the data as seen by the wire-tapper. In this paper, we find the trade-off curve between R and d, assuming essentially perfect (“error-free”) transmission. In particular, if d is equal to Hs, the entropy of the data source, then we consider that the transmission is accomplished in perfect secrecy. Our results imply that there exists a C <inf xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">s</inf> > 0, such that reliable transmission at rates up to C <inf xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">s</inf> is possible in approximately perfect secrecy.

Keywords

Decoding methodsTransmitterChannel (broadcasting)Transmission (telecommunications)EncoderComputer scienceAlgorithmSecrecyAdapter (computing)Topology (electrical circuits)MathematicsComputer networkTelecommunicationsCombinatoricsComputer hardwareComputer security

Related Publications

On the Capacity of Radio Communication Systems with Diversity in a Rayleigh Fading Environment

J.H. Winters

In this paper, we study the fundamental limits on the data rate of multiple antenna systems in a Rayleigh fading environment. With <tex xmlns:mml="http://www.w3.org/1998/Math/Ma...

1987 IEEE Journal on Selected Areas in Com... 926 citations

On two or more dimensional optimum quantizers

D. Chen

It is hard to compute the performance of an N-level K-dimensional optimum quantizer <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink...

2005 17 citations

Nonlinear refractive index and "DC" kerr constant of liquid CS&lt;inf&gt;2&lt;/inf&gt;at 10.6 µm

P. A. Thomas , A. Jares , B. P. Stoicheff

The "dc" Kerr constant of CS <inf xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">2</inf> has been measured at 10.6 μm and found to be ...

1974 IEEE Journal of Quantum Electronics 10 citations

Lower Bounds for the Partitioning of Graphs

W. E. Donath , Alan J. Hoffman

Let a k-partition of a graph be a division of the vertices into k disjoint subsets containing m <inf xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.or...

1973 IBM Journal of Research and Development 650 citations

Capacity theorems for the relay channel

Thomas M. Cover , Abbas El Gamal

A relay channel consists of an input <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">x_{l}</tex> , a relay output <tex xmlns:mml="...

1979 IEEE Transactions on Information Theory 4160 citations

Publication Info

Year: 1975
Type: article
Volume: 54
Issue: 8
Pages: 1355-1387
Citations: 6955
Access: Closed

External Links

View on DOI.org

Social Impact

Altmetric

The Wire-Tap Channel

PlumX Metrics

Social media, news, blog, policy document mentions

Citation Metrics

6955

OpenAlex

Cite This

APA Style

                            
                                    A.D. Wyner
                                
                            (1975). 
                            The Wire-Tap Channel. 
                            Bell System Technical Journal
                            , 54
                            (8)
                            , 1355-1387.
                            https://doi.org/10.1002/j.1538-7305.1975.tb02040.x

Identifiers

DOI: 10.1002/j.1538-7305.1975.tb02040.x