English
Related papers

Related papers: Wiretap Channels: Implications of the More Capable…

200 papers

We consider transmission over a wiretap channel where both the main channel and the wiretapper's channel are Binary Erasure Channels (BEC). We use convolutional LDPC ensembles based on the coset encoding scheme. More precisely, we consider…

Information Theory · Computer Science 2011-07-20 Vishwambhar Rathi , Ruediger Urbanke , Mattias Andersson , Mikael Skoglund

A simple four node network in which cooperation improves the information-theoretic secrecy is studied. The channel consists of two senders, a receiver, and an eavesdropper. One or both senders transmit confidential messages to the receiver,…

Information Theory · Computer Science 2011-02-18 Ninoslav Marina , Hideki Yagi , H. Vincent Poor

A new applicable wiretap channel with separated side information is considered here which consist of a sender, a legitimate receiver and a wiretapper. In the considered scenario, the links from the transmitter to the legitimate receiver and…

Information Theory · Computer Science 2012-04-03 Hamid G. Bafghi , Babak Seyfe , Mahtab Mirmohseni , M. Reza Aref

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

In this work the arbitrarily varying wiretap channel AVWC is studied. We derive a lower bound on the random code secrecy capacity for the average error criterion and the strong secrecy criterion in the case of a best channel to the…

Information Theory · Computer Science 2012-09-25 Igor Bjelaković , Holger Boche , Jochen Sommerfeld

The secrecy capacity problems over the general arbitrarily varying wiretap channel (AVWC), with respect to the maximal decoding error probability and strong secrecy criterion, are considered, where the channel state sequence may be known or…

Information Theory · Computer Science 2017-12-05 Dan He , Yuan Luo

The wiretap channel models secure communication between two users in the presence of an eavesdropper who must be kept ignorant of transmitted messages. The performance of such a system is usually characterized by its secrecy capacity which…

Information Theory · Computer Science 2017-09-07 Holger Boche , Rafael F. Schaefer , H. Vincent Poor

This paper addresses the degraded discrete-time Poisson wiretap channel (DT--PWC) in an optical wireless communication system based on intensity modulation and direct detection. Subject to nonnegativity, peak- and average-intensity as well…

Information Theory · Computer Science 2021-01-27 Morteza Soltani , Zouheir Rezki

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

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

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

We consider a communication system where a relay helps transmission of messages from {a} sender to {a} receiver. The relay is considered not only as a helper but as a wire-tapper who can obtain some knowledge about transmitted messages. In…

Information Theory · Computer Science 2010-10-01 Yasutada Oohama , Shun Watanabe

This paper considers the problem of secure coding design for a type II wiretap channel, where the main channel is noiseless and the eavesdropper channel is a general binary-input symmetric-output memoryless channel. The proposed secure…

Information Theory · Computer Science 2016-11-18 Ruoheng Liu , Yingbin Liang , H. Vincent Poor , Predrag Spasojevic

This paper investigates the maximal secret communication rate over a wiretap channel subject to reliability and secrecy constraints at a given blocklength. New achievability and converse bounds are derived, which are uniformly tighter than…

Information Theory · Computer Science 2017-06-14 Wei Yang , Rafael F. Schaefer , H. Vincent Poor

This work investigates the secrecy capacity of the Wiretap Broadcast Channel (WBC) with an external eavesdropper where a source wishes to communicate two private messages over a Broadcast Channel (BC) while keeping them secret from the…

Information Theory · Computer Science 2015-08-21 Meryem Benammar , Pablo Piantanida

A polar coding scheme is introduced in this paper for the wire-tap channel. It is shown that the provided scheme achieves the entire rate-equivocation region for the case of symmetric and degraded wire-tap channel, where the weak notion of…

Information Theory · Computer Science 2015-03-17 Eran Hof , Shlomo Shamai

Secure communication in a potentially malicious environment becomes more and more important. The arbitrarily varying wiretap channel (AVWC) provides information theoretical bounds on how much information can be exchanged even in the…

Information Theory · Computer Science 2022-04-15 Carsten Rudolf Janda , Moritz Wiese , Eduard A. Jorswieck , Holger Boche

Uncertain wiretap channels are introduced. Their zero-error secrecy capacity is defined. If the sensor-estimator channel is perfect, it is also calculated. Further properties are discussed. The problem of estimating a dynamical system with…

In this work, we study two models of arbitrarily varying channels, when causal side information is available at the encoder in a causal manner. First, we study the arbitrarily varying channel (AVC) with input and state constraints, when the…

Information Theory · Computer Science 2017-01-23 Uzi Pereg , Yossef Steinberg

We furnish a procedure based on universal hash families (UHFs) that can convert an error correcting coding scheme (ECC) of rate $R$ into a semantically secure wiretap coding scheme of rate $R - \xi$ where $\xi$ is a parameter derived from…

Information Theory · Computer Science 2019-03-22 Eric Kubischta , Parker Pavlicek , Sanjay Karmakar
‹ Prev 1 2 3 10 Next ›