On a special class of wiretap channels (Corresp.)

Leung-Yan-Cheong, S.

doi:10.1109/tit.1977.1055763

Cited by 57 publications

(32 citation statements)

References 1 publication

Supporting

Mentioning

Contrasting

Order By: Relevance

“…By applying the bounds (20) and (21) to the bound on R 1 given in (7), we obtain the bound on R 1 given in (18). This concludes the proof of the converse.…”

Section: Corollary 3 the Secrecy Capacity Region Of The Parallel Bccsupporting

confidence: 67%

“…We apply the bounds in (19) to the bound on R 0 given in (7) and obtain the bound on R 0 given in (18).…”

Section: Corollary 3 the Secrecy Capacity Region Of The Parallel Bccmentioning

confidence: 99%

“…We note that the wire-tap channel has also been studied in the work [17][18][19][20][21][22][23][24][25][26][27] and references therein. The topic of common randomness and secret key capacity in communication systems has been studied in [28][29][30].…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Secure Communication Over Fading Channels

Liang

Poor

Shamai

2008

IEEE Trans. Inform. Theory

797

View full text Add to dashboard Cite

The fading broadcast channel with confidential messages (BCC) is investigated, where a source node has common information for two receivers (receivers 1 and 2), and has confidential information intended only for receiver 1. The confidential information needs to be kept as secret as possible from receiver 2. The broadcast channel from the source node to receivers 1 and 2 is corrupted by multiplicative fading gain coefficients in addition to additive Gaussian noise terms. The channel state information (CSI) is assumed to be known at both the transmitter and the receivers. The parallel BCC with independent subchannels is first studied, which serves as an information-theoretic model for the fading BCC. The secrecy capacity region of the parallel BCC is established. This result is then specialized to give the secrecy capacity region of the parallel BCC with degraded subchannels. The secrecy capacity region is then established for the parallel Gaussian BCC, and the optimal source power allocations that achieve the boundary of the secrecy capacity region are derived. In particular, the secrecy capacity region is established for the basic Gaussian BCC. The secrecy capacity results are then applied to study the fading BCC. The ergodic performance is first studied. The ergodic secrecy capacity region and the optimal power allocations that achieve the boundary of this region are derived. The outage performance is then studied, where a long term power constraint is assumed. The power allocation is derived that minimizes the outage probability where either the target rate of the common message or the target rate of the confidential message is not achieved. The power allocation is also derive that minimizes the outage probability where the target rate of the confidential message is not achieved subject to the constraint that the target rate of the common message must be achieved for all channel states.

show abstract

“…By applying the bounds (20) and (21) to the bound on R 1 given in (7), we obtain the bound on R 1 given in (18). This concludes the proof of the converse.…”

Section: Corollary 3 the Secrecy Capacity Region Of The Parallel Bccsupporting

confidence: 67%

“…We apply the bounds in (19) to the bound on R 0 given in (7) and obtain the bound on R 0 given in (18).…”

Section: Corollary 3 the Secrecy Capacity Region Of The Parallel Bccmentioning

confidence: 99%

See 1 more Smart Citation

Secure Communication Over Fading Channels

Liang

Poor

Shamai

2008

IEEE Trans. Inform. Theory

797

View full text Add to dashboard Cite

show abstract

“…Hence, if the inner code achieves the Shannon capacity of the direct channel (in the absence of the wiretapper), the composed code will have a rate that is smaller than the direct channel capacity by the resilience parameter δ. This is known to be the best possible rate when the channels are discrete, memoryless, and symmetric and the wiretap channel is a degraded version of the symmetric channel [48], [49].…”

Section: A Noisy Channels and Active Intrudersmentioning

confidence: 99%

Invertible Extractors and Wiretap Protocols

Cheraghchi

Didier

Shokrollahi

2012

IEEE Trans. Inform. Theory

View full text Add to dashboard Cite

Abstract-A wiretap protocol is a pair of randomized encoding and decoding functions such that knowledge of a bounded fraction of the encoding of a message reveals essentially no information about the message, while knowledge of the entire encoding reveals the message using the decoder. In this paper we study the notion of efficiently invertible extractors and show that a wiretap protocol can be constructed from such an extractor. We will then construct invertible extractors for symbol-fixing, affine, and general sources and apply them to create wiretap protocols with asymptotically optimal trade-offs between their rate (ratio of the length of the message versus its encoding) and resilience (ratio of the observed positions of the encoding and the length of the encoding). We will then apply our results to create wiretap protocols for challenging communication problems, such as active intruders who change portions of the encoding, network coding, and intruders observing arbitrary boolean functions of the encoding. As a by-product of our constructions we obtain new explicit extractors for a restricted family of affine sources over large fields (that in particular generalizes the notion of symbol-fixing sources) which is of independent interest. These extractors are able to extract the entire source entropy with zero error.

show abstract

“…Note that from [11,Theorem 3] and the fact that the uniform distribution is capacity achieving for cyclic shift symmetric channels, a less noisy cyclic shift symmetric wiretap channel is also dominantly cyclic shift symmetric (see also [12]). Based on the analysis in [4], we observe that the solution of (17) satisfies the property in (22) if the wiretap channel is dominantly cyclic shift symmetric.…”

Section: Definition 1 a Cyclic Shift Symmetric Wiretap Channel Is Dommentioning

confidence: 99%

Rate-equivocation region of cyclic shift symmetric wiretap channels

Özel

Ulukuş

2011

2011 49th Annual Allerton Conference on Communication, Control, and Computing (Allerton)

View full text Add to dashboard Cite

Abstract-In this paper, we study cyclic shift symmetric wiretap channels in which the channels between Alice and Bob and Alice and Eve are both cyclic shift symmetric. We characterize the rate-equivocation region by determining the optimal selection of rate splitting U and channel prefixing V for these channels. We show that optimal U and V are determined via cyclic shifts of the solution of an auxiliary optimization problem that involves only one auxiliary random variable. We find the cardinality bound on the necessary auxiliary variable and formulate the problem as a constrained optimization problem. We determine the optimality conditions for the binary-input cyclic shift symmetric wiretap channels. We find the optimum by inspecting each point of the I(X; Y ) − I(X; Z) function and ruling out the sub-optimal candidates that satisfy the optimality conditions. In particular, we address BSC-BEC and BEC-BSC wiretap channels. By using the optimality conditions, we determine the optimal selections of U and V for the rate-equivocation regions of these channels.

show abstract

On a special class of wiretap channels (Corresp.)

Cited by 57 publications

References 1 publication

Secure Communication Over Fading Channels

Secure Communication Over Fading Channels

Invertible Extractors and Wiretap Protocols

Rate-equivocation region of cyclic shift symmetric wiretap channels

Contact Info

Product

Resources

About