Results 231 to 240 of about 6,771 (265)

Ergodic secrecy rate and outage probability in NOMA IRS massive MIMO networks with jamming. [PDF]

open access: yesSci Rep
Zhu M   +6 more
europepmc   +1 more source

The Wiretap Channel with a Cache

2018 IEEE International Symposium on Information Theory (ISIT), 2018
We consider the wiretap channel when a (secure) cache memory is added to the legitimate receiver. With the goal of utilizing coded caching for improving secrecy, during the cache placement phase, the receiver caches a function of the files, and the secret key shared with the transmitter subject to the memory constraint. The signals transmitted to serve
Ahmed A. Zewail, Aylin Yener
openaire   +1 more source

Erasure adversarial wiretap channels

2015 53rd Annual Allerton Conference on Communication, Control, and Computing (Allerton), 2015
In an erasure adversarial wiretap channel (eAWTP-channel), the adversary can select a fraction ρr of the codeword to read, and a fraction ρe of the codeword to erase. The model can be seen as an extension of the wiretap II model where the adversary not only selects its view of the transmitted word, but also can erase a fraction of the codeword.
Pengwei Wang 0006   +2 more
openaire   +1 more source

On the Gaussian MIMO Wiretap Channel

2007 IEEE International Symposium on Information Theory, 2007
Wyner's wiretap channel is generalized to the case when the sender, the receiver and the eavesdropper have multiple antennas. We consider two cases: the deterministic case and the fading case. In the deterministic case, the channel matrices of the intended receiver and the eavesdropper are fixed and known to all the nodes.
Ashish Khisti   +3 more
openaire   +1 more source

Wiretap Channel with Correlated Sources

2014 IEEE International Conference on Cloud Engineering, 2014
This paper studies the problem of secret-message transmission over a wiretap channel with correlated sources in the presence of an eavesdropper who has no source observation. A coding scheme is proposed based on a careful combination of 1) Wyner-Ziv's source coding to generate secret key from correlated sources based on a certain cost on the channel, 2)
Yanling Chen 0001   +2 more
openaire   +1 more source

Wiretap channel with shared key

2010 IEEE Information Theory Workshop, 2010
This paper studies the problem of secure communication over a wiretap channel where the transmitter and the legitimate receiver share a secret key, which is concealed from the eavesdropper. We find the secrecy capacity under this scenario. This result generalizes that of Yamamoto, which is applicable only to less noisy wiretap channels, to the general ...
Wei Kang 0002, Nan Liu 0001
openaire   +1 more source

Wiretap channels with random states

2017 51st Annual Conference on Information Sciences and Systems (CISS), 2017
We propose a new encoding scheme for the wiretap channels with a random state known non-causally to the encoder but not necessarily to the decoder (the Gelfand-Pinsker setting). This setting combines two scenarios with celebrated results in information theory-the wiretap channel and the Gelfand-Pinsker channel-and it so happens that essentially the ...
openaire   +1 more source

On the MISO compound wiretap channel

2010 Information Theory and Applications Workshop (ITA), 2010
We study the secure degrees of freedom (d.o.f.) of the MISO compound wiretap channel. The transmitter has M antennas, whereas the legitimate receiver and the eavesdropper each have one antenna and the channel vectors take one of finitely many values. If the number of states of either the legitimate receiver or the eavesdropper channel is less than M ...
openaire   +1 more source

Home - About - Disclaimer - Privacy