11 research outputs found

    Secret Sharing over Fast-Fading MIMO Wiretap Channels

    Get PDF
    Secret sharing over the fast-fading MIMO wiretap channel is considered. A source and a destination try to share secret information over a fast-fading MIMO channel in the presence of a wiretapper who also makes channel observations that are different from but correlated to those made by the destination. An interactive authenticated unrestricted public channel is also available for use by the source and destination in the secret sharing process. This falls under the "channel-type model with wiretapper" considered by Ahlswede and Csiszar. A minor extension of their result (to continuous channel alphabets) is employed to evaluate the key capacity of the fast-fading MIMO wiretap channel. The effects of spatial dimensionality provided by the use of multiple antennas at the source, destination, and wiretapper are then investigated.Comment: Revision submitted to EURASIP Journal on Wireless Communications and Networking, Special Issue on Wireless Physical Layer Security, Sept. 2009. v.3: Fixes to proofs. Matthieu Bloch added as co-author for contributions to proof

    Impact of Realistic Propagation Conditions on Reciprocity-Based Secret-Key Capacity

    Full text link
    Secret-key generation exploiting the channel reciprocity between two legitimate parties is an interesting alternative solution to cryptographic primitives for key distribution in wireless systems as it does not rely on an access infrastructure and provides information-theoretic security. The large majority of works in the literature generally assumes that the eavesdropper gets no side information about the key from her observations provided that (i) it is spaced more than a wavelength away from a legitimate party and (ii) the channel is rich enough in scattering. In this paper, we show that this condition is not always verified in practice and we analyze the secret-key capacity under realistic propagation conditions

    On the Transmit Beamforming for MIMO Wiretap Channels: Large-System Analysis

    Full text link
    With the growth of wireless networks, security has become a fundamental issue in wireless communications due to the broadcast nature of these networks. In this work, we consider MIMO wiretap channels in a fast fading environment, for which the overall performance is characterized by the ergodic MIMO secrecy rate. Unfortunately, the direct solution to finding ergodic secrecy rates is prohibitive due to the expectations in the rates expressions in this setting. To overcome this difficulty, we invoke the large-system assumption, which allows a deterministic approximation to the ergodic mutual information. Leveraging results from random matrix theory, we are able to characterize the achievable ergodic secrecy rates. Based on this characterization, we address the problem of covariance optimization at the transmitter. Our numerical results demonstrate a good match between the large-system approximation and the actual simulated secrecy rates, as well as some interesting features of the precoder optimization.Comment: Published in Lecture Notes in Computer Science 8317, pp. 90-102, 2014. (Proceedings of International Conference on Information-Theoretic Security (ICITS), Singapore, November 2013

    An Error Probability Approach to MIMO Wiretap Channels

    Full text link
    We consider MIMO (Multiple Input Multiple Output) wiretap channels, where a legitimate transmitter Alice is communicating with a legitimate receiver Bob in the presence of an eavesdropper Eve, and communication is done via MIMO channels. We suppose that Alice's strategy is to use a codebook which has a lattice structure, which then allows her to perform coset encoding. We analyze Eve's probability of correctly decoding the message Alice meant to Bob, and from minimizing this probability, we derive a code design criterion for MIMO lattice wiretap codes. The case of block fading channels is treated similarly, and fast fading channels are derived as a particular case. The Alamouti code is carefully studied as an illustration of the analysis provided.Comment: 27 pages, 4 figure

    CSI-based versus RSS-based Secret-Key Generation under Correlated Eavesdropping

    Full text link
    Physical-layer security (PLS) has the potential to strongly enhance the overall system security as an alternative to or in combination with conventional cryptographic primitives usually implemented at higher network layers. Secret-key generation relying on wireless channel reciprocity is an interesting solution as it can be efficiently implemented at the physical layer of emerging wireless communication networks, while providing information-theoretic security guarantees. In this paper, we investigate and compare the secret-key capacity based on the sampling of the entire complex channel state information (CSI) or only its envelope, the received signal strength (RSS). Moreover, as opposed to previous works, we take into account the fact that the eavesdropper's observations might be correlated and we consider the high signal-to-noise ratio (SNR) regime where we can find simple analytical expressions for the secret-key capacity. As already found in previous works, we find that RSS-based secret-key generation is heavily penalized as compared to CSI-based systems. At high SNR, we are able to precisely and simply quantify this penalty: a halved pre-log factor and a constant penalty of about 0.69 bit, which disappears as Eve's channel gets highly correlated

    Secret Sharing over Fast-Fading MIMO Wiretap Channels

    No full text
    <p/> <p>Secret sharing over the fast-fading MIMO wiretap channel is considered. A source and a destination try to share secret information over a fast-fading MIMO channel in the presence of an eavesdropper who also makes channel observations that are different from but correlated to those made by the destination. An interactive, authenticated public channel with unlimited capacity is available to the source and destination for the secret sharing process. This situation is a special case of the "channel model with wiretapper" considered by Ahlswede and Csisz&#225;r. An extension of their result to continuous channel alphabets is employed to evaluate the key capacity of the fast-fading MIMO wiretap channel. The effects of spatial dimensionality provided by the use of multiple antennas at the source, destination, and eavesdropper are then investigated.</p
    corecore