Results 231 to 240 of about 133,625 (274)

Secrecy Capacities for Multiple Terminals

IEEE Transactions on Information Theory, 2004
We derive single-letter characterizations of (strong) secrecy capacities for models with an arbitrary number of terminals, each of which observes a distinct component of a discrete memoryless multiple source, with unrestricted and interactive public communication permitted between the terminals.
I. Csiszar, P. Narayan
openaire   +1 more source

Secrecy Capacity per Unit Cost

IEEE Journal on Selected Areas in Communications, 2013
The concept of channel capacity per unit cost was introduced by Verdu in 1990 to study the limits of cost-efficient wide-band communication. It was shown that orthogonal signaling can achieve the channel capacity per unit cost of memoryless stationary channels with a zero-cost input letter.
Mustafa El-Halabi, Tie Liu, Costas N. Georghiades   +2 more
openaire   +1 more source

Secrecy Capacity of Wireless LAN

2009 International Conference on Availability, Reliability and Security, 2009
We address secure secret key distribution in wireless communication systems. There is the secrecy capacity concept that it can distribute information which the third parties can not eavesdrop because of the noise over the distribution channel. Then, we address secure secret key distribution in wireless communication systems using secrecy capacity ...
Ryuzou Nishi, Yoshiaki Hori, Kouichi Sakurai   +2 more
openaire   +1 more source

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   +4 more sources

Secrecy capacity of MIMO channels

2008 International Conference on Electrical and Computer Engineering, 2008
A Gaussian multiple input multiple output (MIMO) channel is considered where a transmitter is communicating to a receiver in the presence of an eavesdropper. The transmitter is equipped with multiple antennas, while the receiver and the eavesdropper also contains multiple antennas. We present a technique for determining the secrecy capacity of the MIMO
Mohammad Rakibul Islam, Jinsang Kim, Md. Shamsul Arefin   +2 more
openaire   +1 more source

Secrecy Capacity of Wireless Channels

2006 IEEE International Symposium on Information Theory, 2006
We consider the transmission of confidential data over wireless channels with multiple communicating parties. Based on an information-theoretic problem formulation in which two legitimate partners communicate over a quasi-static fading channel and an eavesdropper observes their transmissions through another independent quasi-static fading channel, we ...
Joao Barros, Miguel R. D. Rodrigues
openaire   +1 more source

Zero-Error Secrecy Capacity

2016
This chapter introduces the zero-error secrecy capacity of quantum channels (ZESC), defined as the higher transmission rate that can be achieved by noisy quantum channels, allowing for the transmission of classical information without errors in an unconditionally secure way.
Elloá B. Guedes, Francisco Marcos de Assis, Rex A. C Medeiros   +2 more
openaire   +1 more source

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, Costas Georghiades   +2 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