English
Related papers

Related papers: Security for adversarial wiretap channels

200 papers

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

We show that polar codes asymptotically achieve the whole capacity-equivocation region for the wiretap channel when the wiretapper's channel is degraded with respect to the main channel, and the weak secrecy notion is used. Our coding…

Information Theory · Computer Science 2010-09-27 Mattias Andersson , Vishwambhar Rathi , Ragnar Thobaben , Joerg Kliewer , Mikael Skoglund

This paper employs equal-image-size source partitioning techniques to derive the capacities of the general discrete memoryless wiretap channel (DM-WTC) under four different secrecy criteria. These criteria respectively specify requirements…

Information Theory · Computer Science 2018-02-16 Eric Graves , Tan F. Wong

We derive a lower bound on the secrecy capacity of the compound wiretap channel with channel state information at the transmitter which matches the general upper bound on the secrecy capacity of general compound wiretap channels given by…

Information Theory · Computer Science 2011-08-10 Igor Bjelaković , Holger Boche , Jochen Sommerfeld

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

We improve the secrecy guarantees for transmission over general binary memoryless symmetric wiretap channels that relies on regular LDPC codes. Previous works showed that LDPC codes achieve secrecy capacity of some classes of wiretap…

Information Theory · Computer Science 2025-02-11 Madhura Pathegama , Alexander Barg

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

This paper studies the problem of secure communcation over the two-receiver discrete memoryless broadcast channel with one-sided receiver side information and with a passive eavesdropper. We proposed a coding scheme which is based upon the…

Information Theory · Computer Science 2018-10-29 Jin Yeong Tan , Lawrence Ong , Behzad Asadi

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

We determine the secrecy capacities under common randomness assisted coding of arbitrarily varying classical-quantum wiretap channels.Furthermore, we determine the secrecy capacity of a mixed channel model which is compound from the sender…

Information Theory · Computer Science 2016-12-30 Holger Boche , Minglai Cai , Christian Deppe , Janis Nötzel

In this paper we consider a wiretap channel with a secret key buffer. We use the coding scheme of [1] to enhance the secrecy rate to the capacity of the main channel, while storing each securely transmitted message in the secret key buffer.…

Information Theory · Computer Science 2016-07-06 Shahid Mehraj Shah , Vinod Sharma

In this paper, new two-user multiple access wiretap channel models are studied. First, the multiple access wiretap channel II with a discrete memoryless main channel, under three different wiretapping scenarios, is introduced. The…

Information Theory · Computer Science 2018-02-07 Mohamed Nafea , Aylin Yener

We show strongly secret achievable rate regions for two different wiretap multiple-access channel coding problems. In the first problem, each encoder has a private message and both together have a common message to transmit. The encoders…

Information Theory · Computer Science 2014-06-05 Moritz Wiese , Holger Boche

Wyner's work on wiretap channels and the recent works on information theoretic security are based on random codes. Achieving information theoretical security with practical coding schemes is of definite interest. In this note, the attempt…

Information Theory · Computer Science 2010-03-09 O. Ozan Koyluoglu , Hesham El Gamal

New bounds on the semantic secrecy capacity of the binary adversarial wiretap channel are established . Against an adversary which reads a $\rho_r$ fraction of the transmitted codeword and modifies a $\rho_w$ fraction of the codeword, we…

Information Theory · Computer Science 2016-06-14 Carol Wang

A single-letter characterization is provided for the capacity region of finite-state multiple-access channels, when the channel state process is an independent and identically distributed sequence, the transmitters have access to partial…

Information Theory · Computer Science 2010-12-10 Giacomo Como , Serdar Yüksel

We study the problem of securely estimating the states of an unstable dynamical system subject to nonstochastic disturbances. The estimator obtains all its information through an uncertain channel which is subject to nonstochastic…

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…

This paper studies adaptive coding for the two-way wiretap channel. Especially, the strong secrecy metric is of our interest that is defined by the information leakage of transmitted messages to the eavesdropper. First, we consider an…

Information Theory · Computer Science 2024-06-25 Yanling Chen , Masahito Hayashi

The coding problem for wiretap channels with causal channel state information (CSI) available at the encoder (Alice) and/or the decoder (Bob) is studied. We are concerned here particularily with the problem of achievable secret-message…

Information Theory · Computer Science 2021-08-10 Te Sun Han , Masahide Sasaki