English
Related papers

Related papers: Key and Message Semantic-Security over State-Depen…

200 papers

Strong secrecy communication over a discrete memoryless state-dependent multiple access channel (SD-MAC) with an external eavesdropper is investigated. The channel is governed by discrete memoryless and i.i.d. channel states and the channel…

Information Theory · Computer Science 2023-06-27 Yiqi Chen , Tobias Oechtering , Mikael Skoglund , Yuan Luo

We study the state-dependent (SD) wiretap channel (WTC) with non-causal channel state information (CSI) at the encoder. This model subsumes all other instances of CSI availability as special cases, and calls for an efficient utilization of…

Information Theory · Computer Science 2019-05-29 Ziv Goldfeld , Paul Cuff , Haim H. Permuter

Strong secrecy communication over a discrete memoryless state-dependent multiple access channel (SD-MAC) with an external eavesdropper is investigated. The channel is governed by discrete memoryless and i.i.d. channel states and the channel…

Information Theory · Computer Science 2023-05-03 Yiqi Chen , Tobias Oechtering , Mikael Skoglund , Yuan Luo

This paper investigates an information-theoretic model of secure semantic-aware communication. For this purpose, we consider the lossy joint source-channel coding (JSCC) of a memoryless semantic source transmitted over a memoryless wiretap…

Information Theory · Computer Science 2026-05-26 Denis Kozlov , Mahtab Mirmohseni , Rahim Tafazolli

The secrecy capacity of the type II wiretap channel (WTC II) with a noisy main channel is currently an open problem. Herein its secrecy-capacity is derived and shown to be equal to its semantic-security (SS) capacity. In this setting, the…

Information Theory · Computer Science 2016-08-18 Ziv Goldfeld , Paul Cuff , Haim H. Permuter

We consider the generation of a secret key (SK) by the inputs and the output of a secure multipleaccess channel (MAC) that additionally have access to a noiseless public communication channel. Under specific restrictions on the protocols,…

Information Theory · Computer Science 2019-02-26 Himanshu Tyagi , Shun Watanabe

We study the capacity of secret-key agreement over a wiretap channel with state parameters. The transmitter communicates to the legitimate receiver and the eavesdropper over a discrete memoryless wiretap channel with a memoryless state…

Information Theory · Computer Science 2016-11-18 Ashish Khisti , Suhas Diggavi , Gregory Wornell

The problem of identification over a discrete memoryless wiretap channel is examined under the criterion of semantic effective secrecy. This secrecy criterion guarantees both the requirement of semantic secrecy and of stealthy…

Information Theory · Computer Science 2025-02-27 Abdalla Ibrahim , Johannes Rosenberger , Boulat A. Bash , Christian Deppe , Roberto Ferrara , Uzi Pereg

We consider the problem of covert communication over a state-dependent channel, where the transmitter has causal or noncausal knowledge of the channel states. Here, "covert" means that a warden on the channel should observe similar…

Information Theory · Computer Science 2017-08-09 Si-Hyeon Lee , Ligong Wang , Ashish Khisti , Gregory W. Wornell

In this paper, we introduce a discrete memoryless State-Dependent Relay Channel with Private Messages (SD-RCPM) as a generalization of the state-dependent relay channel. We investigate two main cases: SD-RCPM with non-causal Channel State…

Information Theory · Computer Science 2016-11-17 Bahareh Akhbari , Mahtab Mirmohseni , Mohammad Reza Aref

A lower bound on the secrecy capacity of the wiretap channel with state information available causally at both the encoder and decoder is established. The lower bound is shown to be strictly larger than that for the noncausal case by Liu…

Information Theory · Computer Science 2010-06-03 Yeow-Khiang Chia , Abbas El Gamal

Secret-key agreement protocols over wiretap channels controlled by a state parameter are studied. The entire state sequence is known (non-causally) to the sender but not to the receiver and the eavesdropper. Upper and lower bounds on the…

Information Theory · Computer Science 2010-07-01 Ashish Khisti

We study covert communication and covert secret key generation with positive rates over quantum state-dependent channels. Specifically, we consider fully quantum state-dependent channels when the transmitter shares an entangled state with…

Information Theory · Computer Science 2025-12-01 Hassan ZivariFard , Rémi A. Chou , Xiaodong Wang

The problem of Secret Key Establishment (SKE) over a pair of independent Discrete Memoryless Broadcast Channels (DMBCs) has already been studied in \cite{Ah10}, where we provided lower and upper bounds on the secret-key capacity. In this…

Information Theory · Computer Science 2010-04-27 Hadi Ahmadi , Reihaneh Safavi-Naini

Semantic communication is a new paradigm for information transmission that integrates the essential meaning (semantics) of the message into the communication process. However, like in classic wireless communications, the open nature of…

Information Theory · Computer Science 2024-10-22 Denis Kozlov , Mahtab Mirmohseni , Rahim Tafazolli

In this paper, we study the problem of secret communication over a multiple-access channel with a common message. Here, we assume that two transmitters have confidential messages, which must be kept secret from the wiretapper (the second…

Information Theory · Computer Science 2016-07-13 Hassan Zivari-Fard , Bahareh Akhbari , Mahmoud Ahmadian-Attari , Mohammad Reza Aref

The secrecy capacity of a network, for a given collection of permissible wiretap sets, is the maximum rate of communication such that observing links in any permissible wiretap set reveals no information about the message. This paper…

Information Theory · Computer Science 2016-11-17 Tao Cui , Tracey Ho , Joerg Kliewer

The capacity of the semi-deterministic relay channel (SD-RC) with non-causal channel state information (CSI) only at the encoder and decoder is characterized. The capacity is achieved by a scheme based on cooperative-bin-forward. This…

Information Theory · Computer Science 2017-04-04 Ido B. Gattegno , Haim H. Permuter , Shlomo Shamai , Ayfer Özgür

The problem of simultaneously generating a secret key (SK) and private key (PK) pair among three terminals via public discussion is investigated, in which each terminal observes a component of correlated sources. All three terminals are…

Information Theory · Computer Science 2014-04-28 Huishuai Zhang , Lifeng Lai , Yingbin Liang , Hua Wang

In this paper, a new wiretap channel model is proposed, where the legitimate transmitter and receiver communicate over a discrete memoryless channel. The wiretapper has perfect access to a fixed-length subset of the transmitted codeword…

Information Theory · Computer Science 2017-01-25 Mohamed Nafea , Aylin Yener
‹ Prev 1 2 3 10 Next ›