Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Allerton Conference on Communication, Control, and Computing

Information leakage for correlated sources with compromised source symbols over wiretap channel II

Reevana Balmahoon, A. J. Han Vinck, Ling Cheng

Published Sep 1, 2014• 3 citations
Publisher

Abstract

Correlated sources are present in communication systems where protocols ensure that there is some predetermined information for sources. Here, we investigate two correlated sources across the wiretap channel II and their effect on the information leakage when some channel information and some source data symbols (the predetermined information) have been wiretapped. The adversary in this situation has access to more information than if a link is wiretapped only and can thus determine more about a particular source. We show that since the sources are correlated, if the information on one link and a portion of its data symbols are compromised then there is also information leakage for the other source. Further, we describe a method to reduce the information leakage for the scenario where the information from the source data symbols overlaps with the channel information.

DOI
10.1109/allerton.2014.7028606

Related papers

Correlated Source Coded Sequences with Compromised Channel and Source Symbols using Shannon's Cipher System

Reevana Balmahoon, A. J. Han Vinck, Ling Cheng

Correlated sources are present in communication systems where protocols ensure that there is some predetermined information for sources to transmit. Here, two correlated sources across a channel with eavesdroppers are investigated, and conditions for perfect secrecy when some channel information and some source data symbols (the predetermined information) have been wiretapped are determined. The adversary in this situation has access to more information than if a link is wiretapped only and can thus determine more about a particular source. This scenario caters for an application where the eavesdropper has access to some preexisting information. We provide bounds for the channel and key rates for this scenario. Further, we provide a method to reduce the key lengths required for perfect secrecy.

arXiv:1410.8805•Oct 31, 2014•0 citations

Information leakage of heterogeneous encoded correlated sequences over an eavesdropped channel

Reevana Balmahoon, Ling Cheng

Correlated sources are present in communication systems where protocols ensure that there is some predetermined information for sources. Here correlated sources across an eavesdropped channel that incorporate a heterogeneous encoding scheme and their effect on the information leakage when some channel information and a source have been wiretapped is investigated. The information leakage bounds for this scenario are provided. Further, an implementation method using a matrix partition approach is described.

IEEE International Symposium on Information Theory (ISIT)•Jun 1, 2015•4 citations

Information Leakage of Heterogeneous Encoded Correlated Sequences over Eavesdropped Channel

Reevana Balmahoon, Ling Cheng

Correlated sources are present in communication systems where protocols ensure that there is some predetermined information for sources. Here correlated sources across an eavesdropped channel that incorporate a heterogeneous encoding scheme and their effect on the information leakage when some channel information and a source have been wiretapped is investigated. The information leakage bounds for the Slepian-Wolf scenario are provided. Thereafter, the Shannon cipher system approach is presented. Further, an implementation method using a matrix partition approach is described.

arXiv:1501.04478•Jan 19, 2015•0 citations

Strong secrecy capacity of arbitrarily varying wiretap channels with finite coordination resources

Ahmed S. Mansour, Holger Boche

We study a secure communication scenario in which the channel is under two classes of attacks at the same time: a passive eavesdropper and an active jammer. This scenario is modelled using the arbitrarily varying wiretap channel (AVWC), in which the channel varies from one channel use to the other. It has been shown that in general reliable communication over AVWCs requires some sort of coordination between the transmitter and the legitimate receiver. However, most of the established coding techniques use an amount of coordination resources that grows with the code block length. Recently, it was shown that if we allow for a small but non vanishing average error probability and weak secrecy information leakage, we can construct a correlated random code that only requires finite coordination resources. In this paper, we extend this result to the strong secrecy criterion. In particular, we show that we can construct a correlated random code with finite correlated randomness, such that the information leakage in terms of the strong secrecy criterion decays exponentially fast.

IEEE Global Conference on Signal and Information Processing•Dec 1, 2016•0 citations

Physical Layer Secrecy in Multi-Eavesdropper Wiretap Channels With Transmitter-Side Information Over Correlated Log-Normal Shadowing

Ali Mohammad Khodadoust, Mario E. Rivero-Ángeles, Victor Barrera-Figueroa +1 more

In this paper, under correlated shadowing channels-a propagation model that accurately reflects real-world wireless environment-we consider a multi-eavesdropper wiretap channel, in which several passive eavesdroppers independently try to intercept the legitimate transmission over the primary communication path from the transmitter (Tx) to the authorized receiver (Rx), constituting a realistic threat model, and analyze the achievable physical layer security (PLS) of wireless system, where, motivated by the proven positive impact of side information (SI) at the Tx on PLS performance, SI is assumed to be available at the Tx. Unlike previous studies that either considered (i) a single eavesdropper under correlated fading channels, with SI present or absent, or (ii) multiple eavesdroppers under independent fading channels, in the absence of SI, this work jointly incorporates SI at the Tx and multiple eavesdroppers under correlated shadowing conditions, yielding a more realistic and effective system model for secure wireless communication. There is no intercorrelation among the eavesdroppers, and the probability of information leakage is zero if none of them can successfully eavesdrop on the transmission. The shadowing experienced over the Tx–authorized Rx channel and the eavesdropper channels (the link between the Tx and each eavesdropper) is modeled using a Log-normal (LN) probability model, which is widely used in communication platforms that rely on wireless transmission to characterize shadowing caused by obstacles and environmental inhomogeneities, based on which we derive fast and accurate approximate closed-form expressions using the Holtzman method (HM) for the average secrecy capacity (ASC), secrecy outage probability (SOP), and the probability of non-zero secrecy capacity (PNSC).The resulting analytical expressions are mathematically tractable, and their validity is confirmed by benchmarking them against Monte Carlo (MC) simulations, and they offer reduced computational complexity and faster execution compared to simulation-based outcomes.

IEEE Open Journal of the Communications Society•Jan 1, 2025•3 citations

On Secure Communications Over a Wiretap Channel With Fixed-Rate Transmission: Protocol Design and Queueing Analysis

Ahmed El Shafie, Naofal Al‐Dhahir

In this letter, we consider a wiretap channel when a source node maintains two buffers (queues) to store its data and secret key packets. We propose two medium-access protocols. In the first proposed protocol, we assume that the legitimate source and its destination share random secret key packets when the main channel is better than either the channel between the eavesdropper and the source or the channel between the eavesdropper and the destination. These key packets are stored in a separate key queue at the source and its destination, and they are utilized to secure data packets whenever channel conditions favor eavesdropper channels over the main communication channel. In the second proposed protocol, the source employs a random-access scheme based on the link and queue states. Our numerical results demonstrate the gains of our proposed protocols in terms of the mean service rate of the data queue and the average queueing delay of the data packets.

IEEE Wireless Communications Letters•May 19, 2015•8 citations
Correlated sources are present in communication systems where protocols ensure that there is some predetermined information for sources. Here, we investigate two correlated sources across the wiretap channel II and their effect on the information leakage when some channel information and some source data symbols (the predetermined information) have been wiretapped. The adversary in this situation has access to more information than if a link is wiretapped only and can thus determine more about a particular source. We show that since the sources are correlated, if the information on one link and a portion of its data symbols are compromised then there is also information leakage for the other source. Further, we describe a method to reduce the information leakage for the scenario where the information from the source data symbols overlaps with the channel information.
Correlated sources are present in communication systems where protocols ensure that there is some predetermined information for sources to transmit. Here, two correlated sources across a channel with eavesdroppers are investigated, and conditions for perfect secrecy when some channel information and some source data symbols (the predetermined information) have been wiretapped are determined. The adversary in this situation has access to more information than if a link is wiretapped only and can thus determine more about a particular source. This scenario caters for an application where the eavesdropper has access to some preexisting information. We provide bounds for the channel and key rates for this scenario. Further, we provide a method to reduce the key lengths required for perfect secrecy.
Correlated sources are present in communication systems where protocols ensure that there is some predetermined information for sources. Here correlated sources across an eavesdropped channel that incorporate a heterogeneous encoding scheme and their effect on the information leakage when some channel information and a source have been wiretapped is investigated. The information leakage bounds for this scenario are provided. Further, an implementation method using a matrix partition approach is described.
Correlated sources are present in communication systems where protocols ensure that there is some predetermined information for sources. Here correlated sources across an eavesdropped channel that incorporate a heterogeneous encoding scheme and their effect on the information leakage when some channel information and a source have been wiretapped is investigated. The information leakage bounds for the Slepian-Wolf scenario are provided. Thereafter, the Shannon cipher system approach is presented. Further, an implementation method using a matrix partition approach is described.
We study a secure communication scenario in which the channel is under two classes of attacks at the same time: a passive eavesdropper and an active jammer. This scenario is modelled using the arbitrarily varying wiretap channel (AVWC), in which the channel varies from one channel use to the other. It has been shown that in general reliable communication over AVWCs requires some sort of coordination between the transmitter and the legitimate receiver. However, most of the established coding techniques use an amount of coordination resources that grows with the code block length. Recently, it was shown that if we allow for a small but non vanishing average error probability and weak secrecy information leakage, we can construct a correlated random code that only requires finite coordination resources. In this paper, we extend this result to the strong secrecy criterion. In particular, we show that we can construct a correlated random code with finite correlated randomness, such that the information leakage in terms of the strong secrecy criterion decays exponentially fast.
In this paper, under correlated shadowing channels-a propagation model that accurately reflects real-world wireless environment-we consider a multi-eavesdropper wiretap channel, in which several passive eavesdroppers independently try to intercept the legitimate transmission over the primary communication path from the transmitter (Tx) to the authorized receiver (Rx), constituting a realistic threat model, and analyze the achievable physical layer security (PLS) of wireless system, where, motivated by the proven positive impact of side information (SI) at the Tx on PLS performance, SI is assumed to be available at the Tx. Unlike previous studies that either considered (i) a single eavesdropper under correlated fading channels, with SI present or absent, or (ii) multiple eavesdroppers under independent fading channels, in the absence of SI, this work jointly incorporates SI at the Tx and multiple eavesdroppers under correlated shadowing conditions, yielding a more realistic and effective system model for secure wireless communication. There is no intercorrelation among the eavesdroppers, and the probability of information leakage is zero if none of them can successfully eavesdrop on the transmission. The shadowing experienced over the Tx–authorized Rx channel and the eavesdropper channels (the link between the Tx and each eavesdropper) is modeled using a Log-normal (LN) probability model, which is widely used in communication platforms that rely on wireless transmission to characterize shadowing caused by obstacles and environmental inhomogeneities, based on which we derive fast and accurate approximate closed-form expressions using the Holtzman method (HM) for the average secrecy capacity (ASC), secrecy outage probability (SOP), and the probability of non-zero secrecy capacity (PNSC).The resulting analytical expressions are mathematically tractable, and their validity is confirmed by benchmarking them against Monte Carlo (MC) simulations, and they offer reduced computational complexity and faster execution compared to simulation-based outcomes.
In this letter, we consider a wiretap channel when a source node maintains two buffers (queues) to store its data and secret key packets. We propose two medium-access protocols. In the first proposed protocol, we assume that the legitimate source and its destination share random secret key packets when the main channel is better than either the channel between the eavesdropper and the source or the channel between the eavesdropper and the destination. These key packets are stored in a separate key queue at the source and its destination, and they are utilized to secure data packets whenever channel conditions favor eavesdropper channels over the main communication channel. In the second proposed protocol, the source employs a random-access scheme based on the link and queue states. Our numerical results demonstrate the gains of our proposed protocols in terms of the mean service rate of the data queue and the average queueing delay of the data packets.