اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدA Note on the Secrecy Capacity of the Multi-antenna Wiretap Channel
89
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
Recently, the secrecy capacity of the multi-antenna wiretap channel was characterized by Khisti and Wornell [1] using a Sato-like argument. This note presents an alternative characterization using a channel enhancement argument. This characterization relies on an extremal entropy inequality recently proved in the context of multi-antenna broadcast channels, and is directly built on the physical intuition regarding to the optimal transmission strategy in this communication scenario.
قيم البحث
اقرأ أيضاً
We study the secrecy capacity of a helper-assisted Gaussian wiretap channel with a source, a legitimate receiver, an eavesdropper and an external helper, where each terminal is equipped with multiple antennas. Determining the secrecy capacity in this
scenario generally requires solving a nonconvex secrecy rate maximization (SRM) problem. To deal with this issue, we first reformulate the original SRM problem into a sequence of convex subproblems. For the special case of single-antenna legitimate receiver, we obtain the secrecy capacity via a combination of convex optimization and one-dimensional search, while for the general case of multi-antenna legitimate receiver, we propose an iterative solution. To gain more insight into how the secrecy capacity of a helper-assisted Gaussian wiretap channel behaves, we examine the achievable secure degrees of freedom (s.d.o.f.) and obtain the maximal achievable s.d.o.f. in closed-form. We also derive a closed-form solution to the original SRM problem which achieves the maximal s.d.o.f.. Numerical results are presented to illustrate the efficacy of the proposed schemes.
In wireless data networks, communication is particularly susceptible to eavesdropping due to its broadcast nature. Security and privacy systems have become critical for wireless providers and enterprise networks. This paper considers the problem of s
ecret communication over the Gaussian broadcast channel, where a multi-antenna transmitter sends independent confidential messages to two users with information-theoretic secrecy. That is, each user would like to obtain its own confidential message in a reliable and safe manner. This communication model is referred to as the multi-antenna Gaussian broadcast channel with confidential messages (MGBC-CM). Under this communication scenario, a secret dirty-paper coding scheme and the corresponding achievable secrecy rate region are first developed based on Gaussian codebooks. Next, a computable Sato-type outer bound on the secrecy capacity region is provided for the MGBC-CM. Furthermore, the Sato-type outer bound prove to be consistent with the boundary of the secret dirty-paper coding achievable rate region, and hence, the secrecy capacity region of the MGBC-CM is established. Finally, two numerical examples demonstrate that both users can achieve positive rates simultaneously under the information-theoretic secrecy requirement.
This paper employs equal-image-size source partitioning techniques to derive the capacities of the general discrete memoryless wiretap channel (DM-WTC) under four different secrecy criteria. These criteria respectively specify requirements on the exp
ected values and tail probabilities of the differences, in absolute value and in exponent, between the joint probability of the secret message and the eavesdroppers observation and the corresponding probability if they were independent. Some of these criteria reduce back to the standard leakage and variation distance constraints that have been previously considered in the literature. The capacities under these secrecy criteria are found to be different when non-vanishing error and secrecy tolerances are allowed. Based on these new results, we are able to conclude that the strong converse property generally holds for the DM-WTC only under the two secrecy criteria based on constraining the tail probabilities. Under the secrecy criteria based on the expected values, an interesting phase change phenomenon is observed as the tolerance values vary.
We study a deterministic approximation of the two-user multiple access wiretap channel. This approximation enables results beyond the recently shown $tfrac{2}{3}$ secure degrees of freedom (s.d.o.f.) for the Gaussian multiple access channel. While th
e s.d.o.f. were obtained by real interference alignment, our approach uses signal-scale alignment. We show an achievable scheme which is independent of the rationality of the channel gains. Moreover, our result can differentiate between channel strengths, in particular between both users, and establishes a secrecy rate dependent on this difference. We can show that the resulting achievable secrecy rate tends to the s.d.o.f. for vanishing channel gain differences. Moreover, we extend the s.d.o.f. bound towards a general bound for varying channel strengths and show that our achievable scheme reaches the bound for certain channel gain parameters. We believe that our analysis is the first step towards a constant-gap analysis of the Gaussian multiple access wiretap channel.
Secrecy issues of free-space optical links realizing information theoretically secure communications as well as high transmission rates are discussed. We numerically study secrecy communication rates of optical wiretap channel based on on-off keying
modulation under typical conditions met in satellite-ground links. It is shown that under reasonable degraded conditions on a wiretapper, information theoretically secure communications should be possible in a much wider distance range than a range limit of quantum key distribution, enabling secure optical links between geostationary earth orbit satellites and ground stations with currently available technologies. We also provide the upper bounds on the decoding error probability and the leaked information to estimate a necessary code length for given required levels of performances. This result ensures that a reasonable length wiretap channel code for our proposed scheme must exist.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
