نتایج جستجو برای: achievable secrecy rate region
تعداد نتایج: 1470136 فیلتر نتایج به سال:
In this paper we summarize our recent work on information-theoretically secure wireless relay network communication. In such communication, the goal is to send information between two special nodes (“source” and “destination”) in a (memoryless) network with authenticated relays, where the secrecy is with respect to a class of eavesdroppers. We develop achievable secrecy rates when authenticated...
In this paper, we consider a scenario where a source node wishes to broadcast two confidential messages for two respective receivers, while a wire-tapper also receives the transmitted signal. This model is motivated by wireless communications, where individual secure messages are broadcast over open media and can be received by any illegitimate receiver. The secrecy level is measured by equivoc...
This paper considers the four-node relay-eavesdropper channel, where a relay node helps the source to send secret messages to the destination in the presence of a passive eavesdropper. For the discrete memoryless case, we propose a hybrid cooperative coding scheme, which is based on the combination of the partial decode-forward scheme, the noise-forward scheme and the random binning scheme. The...
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 ...
In this paper, we consider the design of a new secrecy transmission scheme for a four-node relay-eavesdropper channel. The key idea of the proposed scheme is to combine noisy network coding with the interference assisted strategy for wiretap channel with a helping interferer. A new achievable secrecy rate is characterized for both discrete memoryless and Gaussian channels. Such a new rate can b...
Abstract: We study the problem of two-user Gaussian multiple access channel (GMAC) in the presence of an external eavesdropper. In this problem, an eavesdropper receives a signal with a lower signal-to-noise ratio (SNR) compared to the legitimate receiver and all transmitted messages should be kept confidential against the eavesdropper. For this purpose, we propose a secure coding scheme on thi...
We study a deterministic approximation of the two-user multiple access wiretap channel. This approximation enables results beyond the recently shown 2 3 secure degrees of freedom (s.d.o.f.) for the Gaussian multiple access channel. While the 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 r...
This letter proposes a novel UAV-enabled mobile jamming scheme to improve the secrecy rate of ground wiretap channel. Specifically, a UAV is employed to transmit jamming signals to combat against eavesdropping. Such a mobile jamming scheme is particularly appealing since the UAV-enabled jammer can fly close to the eavesdropper and opportunistically jam it by leveraging the UAV’s mobility. We ai...
A discrete memoryless generalized multiple access channel (GMAC) with confidential messages is studied, where two users attempt to transmit common information to a destination and each user also has private (confidential) information intended for the destination. This channel generalizes the multiple access channel (MAC) in that the two users also receive channel outputs, and hence may obtain t...
In this paper, we consider a scenario where a source node wishes to broadcast two confidential messages to two receivers, while a wire-tapper also receives the transmitted signal. This model is motivated by wireless communications, where individual secure messages are broadcast over open media and can be received by any illegitimate receiver. The secrecy level is measured by the equivocation ra...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید