English
Related papers

Related papers: Imperfect Secrecy in Wiretap Channel II

200 papers

Equivocation rate has been widely used as an information-theoretic measure of security after Shannon[10]. It simplifies problems by removing the effect of atypical behavior from the system. In [9], however, Merhav and Arikan considered the…

Information Theory · Computer Science 2008-06-01 Chung Chan

Interference in wireless networks degrades the signal quality at the terminals. However, it can potentially enhance the secrecy rate. This paper investigates the secrecy rate in a two-user interference network where one of the users, namely…

Information Theory · Computer Science 2016-11-17 Ashkan Kalantari , Sina Maleki , Gan Zheng , Symeon Chatzinotas , Björn Ottersten

We study the multi-receiver wiretap channel with public and confidential messages. In this channel, there is a transmitter that wishes to communicate with two legitimate users in the presence of an external eavesdropper. The transmitter…

Information Theory · Computer Science 2011-06-22 Ersen Ekrem , Sennur Ulukus

We consider a two user multiple-access channel with an eavesdropper at the receiving end. We use previously transmitted messages as a key in the next slot till we achieve the capacity region of the usual Multiple Access Channel (MAC).

Information Theory · Computer Science 2014-11-03 Shahid Mehraj Shah , Vinod Sharma

We consider wiretap channels with uncertainty on the eavesdropper channel under (i) noisy blockwise type II, (ii) compound, or (iii) arbitrarily varying models. We present explicit wiretap codes that can handle these models in a unified…

Information Theory · Computer Science 2022-11-03 Remi A. Chou

We consider the problem of securing a multicast network against a wiretapper that can intercept the packets on a limited number of arbitrary network links of his choice. We assume that the network implements network coding techniques to…

Information Theory · Computer Science 2008-07-08 Salim El Rouayheb , Emina Soljanin

In this work, the role of noisy feedback in enhancing the secrecy capacity of the wiretap channel is investigated. A model is considered in which the feed-forward and feedback signals share the same noisy channel. More specifically, a…

Information Theory · Computer Science 2007-10-04 Lifeng Lai , Hesham El Gamal , H. Vincent Poor

An upper bound to the identification capacity of discrete memoryless wiretap channels is derived under the requirement of semantic effective secrecy, combining semantic secrecy and stealth constraints. A previously established lower bound…

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

In Part I of this two-part paper on confidential communication over wireless channels, we studied the fundamental security limits of quasi-static fading channels from the point of view of outage secrecy capacity with perfect and imperfect…

Information Theory · Computer Science 2007-07-13 Matthieu Bloch , Joao Barros , Miguel R. D. Rodrigues , Steven W. McLaughlin

We consider the problem of securing a multicast network against a wiretapper that can intercept the packets on a limited number of arbitrary network edges of its choice. We assume that the network employs the network coding technique to…

Information Theory · Computer Science 2009-07-22 Salim El Rouayheb , Emina Soljanin , Alex Sprintson

The communication scenario under consideration in this paper corresponds to a multiuser channel with side information and consists of a broadcast channel with two legitimate receivers and an eavesdropper. Mainly, the results obtained are as…

Information Theory · Computer Science 2012-10-24 Maël Le Treust , Abdellatif Zaidi , Samson Lasaulce

We consider the multiple-input multiple-output (MIMO) wiretap channel under a minimum receiver-side power constraint in addition to the usual maximum transmitter-side power constraint. This problem is motivated by energy harvesting…

Information Theory · Computer Science 2016-11-17 Karim Banawan , Sennur Ulukus

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

A novel private communication framework is proposed where privacy is induced by transmitting over a channel instances of linear inverse problems that are identifiable to the legitimate receiver but unidentifiable to an eavesdropper. The gap…

Information Theory · Computer Science 2024-07-24 Maxime Ferreira Da Costa , Jianxiu Li , Urbashi Mitra

We consider secrecy obtained when one transmits on a Gaussian Wiretap channel above the secrecy capacity. Instead of equivocation, we consider probability of error as the criterion of secrecy. The usual channel codes are considered for…

Information Theory · Computer Science 2014-01-07 R. Rajesh , Shahid M. Shah , Vinod Sharma

We consider the problem of encoding a deterministic source sequence (a.k.a.\ individual sequence) for the degraded wiretap channel by means of an encoder and decoder that can both be implemented as finite--state machines. Our first main…

Information Theory · Computer Science 2022-01-05 Neri Merhav

In this paper, we consider the achievable sum secrecy rate in full-duplex wiretap channel in the presence of an eavesdropper and imperfect channel state information (CSI). We assume that the users participating in full-duplex communication…

Information Theory · Computer Science 2014-01-17 Sanjay Vishwakarma , A. Chockalingam

Traditional cryptography assumes an eavesdropper receives an error-free copy of the transmitted ciphertext. Wyner's wiretap channel model recognizes that at the physical layer both the intended receiver and the passive eavesdropper…

Information Theory · Computer Science 2015-09-24 Willie K Harrison , Steven W. McLaughlin

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

In wiretap model of secure communication the goal is to provide (asymptotic) perfect secrecy and reliable communication over a noisy channel that is eavesdropped by an adversary with unlimited computational power. This goal is achieved by…

Cryptography and Security · Computer Science 2014-09-05 Pengwei Wang , Reihaneh Safavi-Naini