International audienceWe study the trade-off between secret message (SM) and secret key (SK) rates, simultaneously achievable over a state-dependent (SD) wiretap channel (WTC) with non-causal channel state information (CSI) at the encoder. This model subsumes other instances of CSI availability as special cases, and calls for efficient utilization of the state sequence for both reliability and security purposes. An inner bound on the semantic-security (SS) SM-SK capacity region is derived based on a superposition coding scheme inspired by a past work of the authors. The region is shown to attain capacity for a certain class of SD-WTCs. SS is established by virtue of two versions of the strong soft-covering lemma. The derived region yields a...
Abstract—We derive single-letter characterizations of (strong) secrecy capacities for models with an...
Abstract—This paper studies the problem of secure communi-cation over a degraded wiretap channel p(y...
Abstract—We consider the fundamental limits of the secret key generation problem when the sources ar...
International audienceWe study the trade-off between secret message (SM) and secret key (SK) rates, ...
International audienceWe study the trade-off between secret message (SM) and secret key (SK) rates s...
International audienceWe study the trade-off between secret message (SM) and secret key (SK) rates, ...
International audienceThe state-dependent (SD) wiretap channel (WTC) with non-causal channel state i...
International audienceThis paper derives upper and lower bounds on the secrecy capacity-memory trade...
We study secret-key agreement protocols over a wiretap channel controlled by a state parameter. The ...
Abstract—We study the capacity of secret-key agreement over a wiretap channel with state parameters....
Abstract—We study secret-key agreement protocols over a wiretap channel controlled by a state parame...
Information embedding on actions is a new channel model in which a specific decoder is used to obser...
We investigate an approach to physical-layer security based on the premise that the coding mechanism...
International audienceThis paper investigates the secrecy capacity of the wiretap broadcast channel ...
Abstract—This paper studies the problem of secure communica-tion over a wiretap channel with...
Abstract—We derive single-letter characterizations of (strong) secrecy capacities for models with an...
Abstract—This paper studies the problem of secure communi-cation over a degraded wiretap channel p(y...
Abstract—We consider the fundamental limits of the secret key generation problem when the sources ar...
International audienceWe study the trade-off between secret message (SM) and secret key (SK) rates, ...
International audienceWe study the trade-off between secret message (SM) and secret key (SK) rates s...
International audienceWe study the trade-off between secret message (SM) and secret key (SK) rates, ...
International audienceThe state-dependent (SD) wiretap channel (WTC) with non-causal channel state i...
International audienceThis paper derives upper and lower bounds on the secrecy capacity-memory trade...
We study secret-key agreement protocols over a wiretap channel controlled by a state parameter. The ...
Abstract—We study the capacity of secret-key agreement over a wiretap channel with state parameters....
Abstract—We study secret-key agreement protocols over a wiretap channel controlled by a state parame...
Information embedding on actions is a new channel model in which a specific decoder is used to obser...
We investigate an approach to physical-layer security based on the premise that the coding mechanism...
International audienceThis paper investigates the secrecy capacity of the wiretap broadcast channel ...
Abstract—This paper studies the problem of secure communica-tion over a wiretap channel with...
Abstract—We derive single-letter characterizations of (strong) secrecy capacities for models with an...
Abstract—This paper studies the problem of secure communi-cation over a degraded wiretap channel p(y...
Abstract—We consider the fundamental limits of the secret key generation problem when the sources ar...