Results 261 to 270 of about 7,680 (294)

Secrecy transmission capacity of random networks

2013 Asilomar Conference on Signals, Systems and Computers, 2013
We investigate the secrecy transmission capacity of random networks with Nakagami-m fading. Using a model that accounts for uncertainties both in node locations (distances) and channel coefficients (fading), we derive the path-gain distribution of the collusion of nodes, as well as the corresponding secrecy outage probability and secrecy rate ...
Satyanarayana Vuppala, Giuseppe Abreu
openaire   +1 more source

On secrecy capacity per unit cost

2009 IEEE International Symposium on Information Theory, 2009
The concept of channel capacity per unit cost was introduced by Verdu in 1990 to study the limits of wideband communication. It was shown that an orthogonal coding scheme achieves the channel capacity per unit cost of memoryless stationary channels with a zero-cost input letter.
Mustafa El-Halabi, Tie Liu 0002, Costas N. Georghiades   +2 more
openaire   +1 more source

On the secrecy capacity of cooperative wiretap channel

2013 Iran Workshop on Communication and Information Theory, 2013
Secure communications using physical layer characteristics has attracted many attentions in recent years. Secrecy capacity of communication systems can be increased by using multiple-antenna nodes. In this paper, we concentrate on the cooperative wiretap channel in which confidential messages are sent from a source to a legitimate receiver with the ...
Meysam Mirzaee, Soroush Akhlaghi
openaire   +1 more source

Secrecy capacity of the Noise-Loop secure modulation

2014 4th International Conference on Wireless Communications, Vehicular Technology, Information Theory and Aerospace & Electronic Systems (VITAE), 2014
The issues of privacy and security in wireless communication networks have taken on an increasingly important role as these networks continue to be deployed worldwide. Traditionally, security is viewed as an independent feature addressed above the physical layer and all widely used cryptographic protocols are designed and implemented assuming that the ...
Lorenzo Mucchi, Luca Simone Ronga, Enrico Del Re, Luigi Chisci   +3 more
openaire   +2 more sources

Secrecy capacity of heterogeneous distributed storage systems

2014 6th International Symposium on Communications, Control and Signal Processing (ISCCSP), 2014
The capacity and secrecy capacity of heterogeneous distributed storage systems under repair dynamics are studied. Capacity bounds are given depending on the average resources per node. One implication of these results is that symmetric repair maximizes the capacity of a homogeneous system.
Toni Ernvall, Salim El Rouayheb, Camilla Hollanti, H. Vincent Poor   +3 more
openaire   +1 more source

On the Study of Secrecy Capacity with Outdated CSI

2016
In this paper, we study the secrecy capacity of the proposed transmission scheme. It is provided that the SNR at the selected best relay, destination and eavesdropper are same due to the symmetrical setup. The outage probability is considered here to evaluate the performance of such a secrecy communication system.
Tong Chen, Peng Xu 0002, Zhiguo Ding 0001, Xuchu Dai   +3 more
openaire   +1 more source

Achieving secrecy: Capacity vs. resolvability

2011 IEEE International Symposium on Information Theory Proceedings, 2011
In this paper, we investigate the nature of the coding mechanisms required to ensure strong secrecy over wiretap channels. Specifically, we analyze the limitations of capacity-based wiretap codes, i.e. wiretap codes that associate to each confidential message a subcode whose rate approaches the eavesdropper's channel capacity.
openaire   +1 more source

Capacity of Cognitive Interference Channels With and Without Secrecy

IEEE Transactions on Information Theory, 2009
Like the conventional two-user interference channel, the cognitive interference channel consists of two transmitters whose signals interfere at two receivers. It is assumed that there is a common message (message 1) known to both transmitters, and an additional independent message (message 2) known only to the cognitive transmitter (transmitter 2). The
Yingbin Liang, Anelia Somekh-Baruch, H. Vincent Poor, Shlomo Shamai, Sergio Verdú   +4 more
openaire   +1 more source

Linear Secrecy Capacity Scaling in Dense Networks

2015 IEEE Globecom Workshops (GC Wkshps), 2015
We propose a new hierarchical cooperation technique using jamming in dense networks to achieve linear secrecy capacity scaling. To show the effect of the jamming signal in the proposed scheme, we derive the tolerable intensities of eavesdroppers to achieve the linear secrecy capacity scaling for hierarchical cooperation schemes with and without jamming,
Myung Gil Kang, Young-bin Kim, Wan Choi 0001, Chaehag Yi   +3 more
openaire   +1 more source

The secrecy capacity of the semi-deterministic broadcast channel

2009 IEEE International Symposium on Information Theory, 2009
In this paper, we study secure communications over a two-user semi-deterministic broadcast channel, i.e., one of the receivers is connected to the transmitter through a deterministic channel. We consider the case where the deterministic receiver is also the eavesdropper for the other receiver's message.
Wei Kang 0002, Nan Liu 0001
openaire   +1 more source