English
Related papers

Related papers: Local Approximation of Secrecy Capacity

200 papers

This paper introduces a methodology based on Euclidean information theory to investigate local properties of secure communication over discrete memoryless wiretap channels. We formulate a constrained optimization problem that maximizes a…

Information Theory · Computer Science 2026-05-14 Emmanouil M. Athanasakos , Nicholas Kalouptsidis , Hariprasad Manjunath

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

Information-theoretic secrecy, in particular the wiretap channel formulation, provides protection against interception of a message by adversary Eve and has been widely studied in the last two decades. In contrast, covert communications…

Cryptography and Security · Computer Science 2019-07-17 Moslem Forouzesh , Paeiz Azmi , Nader Mokari , Kai Kit Wong , Dennis Goeckel

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

In this paper, we investigate how constraints on the randomization in the encoding process affect the secrecy rates achievable over wiretap channels. In particular, we characterize the secrecy capacity with a rate-limited local source of…

Information Theory · Computer Science 2012-02-27 Matthieu R. Bloch , Joerg Kliewer

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 this two-part paper, we consider the transmission of confidential data over wireless wiretap channels. The first part presents an information-theoretic problem formulation in which two legitimate partners communicate over a quasi-static…

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

We study the secrecy capacity in the vicinity of colluding eavesdroppers. Contrary to the perfect collusion assumption in previous works, our new information-theoretic model considers constraints in collusion. We derive the achievable…

Information Theory · Computer Science 2013-12-12 Mahtab Mirmohseni , Panagiotis Papadimitratos

We investigate the problem of information theoretically secure communication in a line network with erasure channels and state feedback. We consider a spectrum of cases for the private randomness that intermediate nodes can generate,…

Information Theory · Computer Science 2014-07-09 Athanasios Papadopoulos , Laszlo Czap , Christina Fragouli

The secrecy rate region of wiretap interference channels with a multi-antenna passive eavesdropper is studied under receiver energy harvesting constraints. To stay operational in the network, the legitimate receivers demand energy alongside…

Information Theory · Computer Science 2019-03-01 Ali Kariminezhad , Zohaib Hassan Awan , Hendrik Vogt , Aydin Sezgin

This paper studies a scalar Gaussian wiretap channel where instead of an average input power constraint, we consider a peak amplitude constraint on the input. The goal is to obtain insights into the secrecy-capacity and the structure of the…

Information Theory · Computer Science 2021-11-24 Luca Barletta , Alex Dytso

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…

Information Theory · Computer Science 2014-11-04 Maksym A. Girnyk , Frédéric Gabry , Mikko Vehkaperä , Lars K. Rasmussen , Mikael Skoglund

This paper studies secrecy-capacity of an $n$-dimensional Gaussian wiretap channel under the peak-power constraint. This work determines the largest peak-power constraint $\bar{\mathsf{R}}_n$ such that an input distribution uniformly…

Information Theory · Computer Science 2022-02-02 Antonino Favano , Luca Barletta , Alex Dytso

In this paper we consider the problem of secure network coding where an adversary has access to an unknown subset of links chosen from a known collection of links subsets. We study the capacity region of such networks, commonly called…

Information Theory · Computer Science 2013-11-26 Shirin Jalali , Tracey Ho

The paper concerns the isotropic interior transmission eigenvalue (ITE) problem. This problem is not elliptic, but we show that, using the Dirichlet-to-Neumann map, it can be reduced to an elliptic one. This leads to the discreteness of the…

Mathematical Physics · Physics 2015-06-12 Evgeny Lakshtanov , Boris Vainberg

In this paper, we propose a transmission scheme that achieves information theoretic security, without making assumptions on the eavesdropper's channel. This is achieved by a transmitter that deliberately introduces synchronization errors…

Information Theory · Computer Science 2015-01-27 Jason Castiglione , Aleksandar Kavcic

This paper studies the problem of secure communication over the broadcast channel with receiver side information under the lens of individual secrecy constraints. That is, the transmitter wants to send two independent messages to two…

Information Theory · Computer Science 2015-02-26 Yanling Chen , O. Ozan Koyluoglu , Aydin Sezgin

Secrecy issues of free-space optical links realizing information theoretically secure communications as well as high transmission rates are discussed. We numerically study secrecy communication rates of optical wiretap channel based on…

Information Theory · Computer Science 2015-09-15 Hiroyuki Endo , Te Sun Han , Takao Aoki , Masahide Sasaki

Imperfect secrecy in communication systems is investigated. Instead of using equivocation as a measure of secrecy, the distortion that an eavesdropper incurs in producing an estimate of the source sequence is examined. The communication…

Information Theory · Computer Science 2012-10-09 Curt Schieler , Eva C. Song , Paul Cuff , H. Vincent Poor

This paper is concerned with the general multiple access wiretap channel and the existence of codes that accomplish reliability and strong secrecy. Information leakage to the eavesdropper is assessed by the variational distance metric,…

Information Theory · Computer Science 2020-03-10 Manos Athanasakos , Nicholas Kalouptsidis
‹ Prev 1 2 3 10 Next ›