Results 31 to 40 of about 133,625 (274)
On Secrecy Rate Analysis of MIMO Wiretap Channels Driven by Finite-Alphabet Input [PDF]
This work investigates the effect of finite-alphabet source input on the secrecy rate of a multi-antenna wiretap system. Existing works have characterized maximum achievable secrecy rate or secrecy capacity for single and multiple antenna systems based ...
Bashar, Shafi +2 more
core +3 more sources
Robust Biometric Authentication from an Information Theoretic Perspective
Robust biometric authentication is studied from an information theoretic perspective. Compound sources are used to account for uncertainty in the knowledge of the source statistics and are further used to model certain attack classes.
Andrea Grigorescu +2 more
doaj +1 more source
In this paper, we consider the physical layer security problem of the wireless communication system. For the multiple-input, multiple-output (MIMO) wireless communication system, secrecy capacity optimization artificial noise (SCO−AN) is introduced and ...
Yebo Gu, Bowen Huang, Zhilu Wu
doaj +1 more source
The Secrecy Capacity of the MIMO Wiretap Channel [PDF]
We consider the MIMO wiretap channel, that is a MIMO broadcast channel where the transmitter sends some confidential information to one user which is a legitimate receiver, while the other user is an eavesdropper. Perfect secrecy is achieved when the the transmitter and the legitimate receiver can communicate at some positive rate, while insuring that ...
Oggier, Frédérique, Hassibi, Babak
openaire +5 more sources
Some New Results on the Multiple-AccessWiretap Channel
In this paper, some new results on the multiple-access wiretap channel (MAC-WT) are provided. Specifically, first, we investigate the degraded MAC-WT, where two users transmit their corresponding confidential messages (no common message) to a legitimate ...
Bin Dai, Zheng Ma
doaj +1 more source
The Secrecy Capacity of Compound Gaussian MIMO Wiretap Channels
Strong secrecy capacity of compound wiretap channels is studied. The known lower bounds for the secrecy capacity of compound finite-state memoryless channels under discrete alphabets are extended to arbitrary uncertainty sets and continuous alphabets ...
Loyka, Sergey, Schaefer, Rafael F.
core +1 more source
Secrecy Capacity of Space Keying with Two Antennas [PDF]
Spatial modulation (SM) and space shift keying (SSK) use only one out of several transmit antennas at a time to transmit data via an antenna index. In such a system, the information is encoded by exploiting channel randomness i.e. the fact that channels between different transmit and receive antennas are random.
Sinanovic, S. +3 more
openaire +2 more sources
Chaotic sequence based polar code encrypted scheme in negative secrecy capacity case
A chaos based encrypted polar coding scheme,which could be applied to the negative secrecy capacity case,was proposed.Chaotic sequences were employed to encrypt the information bits and fill the frozen bits.And multi-block polar coding structure was also
Xiaohui ZHANG, Shunliang ZHANG, Bowen LI
doaj +2 more sources
Secrecy Capacity-Memory Tradeoff of Erasure Broadcast Channels [PDF]
This paper derives upper and lower bounds on the secrecy capacity-memory tradeoff of a wiretap erasure broadcast channel (BC) with Kw weak receivers and Ks strong receivers, where weak receivers, respectively strong receivers, have same erasure probabilities and cache sizes. The lower bounds are achieved by schemes that meticulously combine joint cache-
Sarah Kamel +3 more
openaire +2 more sources
Secrecy Results for Compound Wiretap Channels
We derive a lower bound on the secrecy capacity of the compound wiretap channel with channel state information at the transmitter which matches the general upper bound on the secrecy capacity of general compound wiretap channels given by Liang et al. and
AD Wyner +18 more
core +1 more source

