English
Related papers

Related papers: A Classification of Unimodular Lattice Wiretap Cod…

200 papers

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

We consider a class of Gaussian layered networks where a source communicates with a destination through $L$ intermediate relay layers with $N$ nodes in each layer in the presence of a single eavesdropper which can overhear the transmissions…

Information Theory · Computer Science 2016-07-18 Tulika Agrawal , Samar Agnihotri

Secure codes are widely-studied combinatorial structures which were introduced for traitor tracing in broadcast encryption. To determine the maximum size of such structures is the main research objective. In this paper, we investigate the…

Information Theory · Computer Science 2021-08-24 Bingchen Qian , Xin Wang , Gennian Ge

It has been found that the signal can be encoded in the choice of the measurement basis of one of the communicating parties, while the outcomes of the measurement are irrelevant for the communication and therefore may be discarded. The…

Quantum Physics · Physics 2015-06-17 Dong Xie , An Min Wang

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

Wireless communication is susceptible to adversarial eavesdropping due to the broadcast nature of the wireless medium. In this paper it is shown how eavesdropping can be alleviated by exploiting the superposition property of the wireless…

Information Theory · Computer Science 2016-11-17 Xiaojun Tang , Ruoheng Liu , Predrag Spasojevic , H. Vincent Poor

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

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

Secure data compression in the presence of side information at both a legitimate receiver and an eavesdropper is explored. A noise-free, limited rate link between the source and the receiver, whose output can be perfectly observed by the…

Information Theory · Computer Science 2016-11-17 Deniz Gunduz , Elza Erkip , H. Vincent Poor

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

In this work, a class of information theoretic secrecy problems is addressed where the eavesdropper channel states are completely unknown to the legitimate parties. In particular, MIMO wiretap channel models are considered where the channel…

Information Theory · Computer Science 2010-07-28 Xiang He , Aylin Yener

A new class of folded subspace codes for noncoherent network coding is presented. The codes can correct insertions and deletions beyond the unique decoding radius for any code rate $R\in[0,1]$. An efficient interpolation-based decoding…

Information Theory · Computer Science 2015-04-22 Hannes Bartz , Vladimir Sidorenko

We study information-theoretic security for discrete memoryless interference and broadcast channels with independent confidential messages sent to two receivers. Confidential messages are transmitted to their respective receivers with…

Information Theory · Computer Science 2016-11-15 Ruoheng Liu , Ivana Maric , Predrag Spasojevic , Roy D. Yates

The secrecy of a communication system in which both the legitimate receiver and an eavesdropper are allowed some distortion is investigated. The secrecy metric considered is the exponent of the probability that the eavesdropper estimates…

Information Theory · Computer Science 2017-04-04 Ibrahim Issa , Aaron B. Wagner

In a classical wiretap channel setting, Alice communicates with Bob through a main communication channel, while her transmission also reaches an eavesdropper Eve through a wiretap channel. In this paper, we consider a general class of polar…

Information Theory · Computer Science 2024-07-02 Hessam Mahdavifar , Fariba Abbasi

Integer data is typically made differentially private by adding noise from a Discrete Laplace (or Discrete Gaussian) distribution. We study the setting where differential privacy of a counting query is achieved using bit-wise randomized…

Information Theory · Computer Science 2023-11-17 David Rasmussen Lolck , Rasmus Pagh

The problem of secure broadcasting with independent secret keys is studied. The particular scenario is analyzed in which a common message has to be broadcast to two legitimate receivers, while keeping an external eavesdropper ignorant of…

Information Theory · Computer Science 2018-02-20 Rafael F. Schaefer , Ashish Khisti , H. Vincent Poor

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 consider the problem of secure communications over the two-way wiretap channel under a strong secrecy criterion. We improve existing results by developing an achievable region based on strategies that exploit both the interference at the…

Information Theory · Computer Science 2015-03-17 Alexandre J. Pierrot , Matthieu R. Bloch

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