English
Related papers

Related papers: Wiretap Channel With Causal State Information and …

200 papers

This paper considers the problem of secret communication over a multiple access channel with generalized feedback. Two trusted users send independent confidential messages to an intended receiver, in the presence of a passive eavesdropper.…

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

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…

The role of multiple antennas for secure communication is investigated within the framework of Wyner's wiretap channel. We characterize the secrecy capacity in terms of generalized eigenvalues when the sender and eavesdropper have multiple…

Information Theory · Computer Science 2007-08-31 Ashish Khisti , Gregory Wornell

The fading wire-tap channel is investigated, where the source-to-destination channel and the source-to-wire-tapper channel are corrupted by multiplicative fading gain coefficients in addition to additive Gaussian noise terms. The channel…

Information Theory · Computer Science 2007-08-22 Yingbin Liang , H. Vincent Poor

A state-dependent relay channel is studied in which strictly causal channel state information is available at the relay and no state information is available at the source and destination. Source and relay are connected via two…

Information Theory · Computer Science 2015-03-18 Min Li , Osvaldo Simeone , Aylin Yener

It is known that a message can be transmitted safely against any wiretapper via a noisy channel without a secret key if the coding rate is less than the so-called secrecy capacity $C_S$, which is usually smaller than the channel capacity…

Information Theory · Computer Science 2007-07-16 Daisuke Kobayashi , Hirosuke Yamamoto , Tomohiro Ogawa

We consider the MIMO wiretap channel, that is a MIMO broadcast channel where the transmitter sends some confidential information to one user which is a legitimate receiver, while the other user is an eavesdropper. Perfect secrecy is…

Information Theory · Computer Science 2007-10-11 Frédérique Oggier , Babak Hassibi

Wireless communication is susceptible to eavesdropping attacks because of its broadcast nature. This paper illustrates how interference can be used to counter eavesdropping and assist secrecy. In particular, a wire-tap channel with a…

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

In this paper we consider the State-Dependent Wiretap Channel (SD-WC). As the main idea, we model the SD-WC as a Cognitive Interference Channel (CIC), in which the primary receiver acts as an eavesdropper for the cognitive transmitter's…

Information Theory · Computer Science 2016-05-19 Hamid G. Bafghi , Babak Seyfe , Mahtab Mirmohseni , Mohammad Reza Aref

In coding schemes for the wire-tap channel or the broadcast channels with confidential messages, it is well known that the sender needs to use a stochastic encoding to avoid the information about the transmitted confidential message to be…

Information Theory · Computer Science 2012-06-01 Shun Watanabe , Yasutada Oohama

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

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

Due to the broadcast nature of the wireless medium, wireless communication is susceptible to adversarial eavesdropping. This paper describes how eavesdropping can potentially be defeated by exploiting the superposition nature of the…

Information Theory · Computer Science 2008-05-02 Xiaojun Tang , Ruoheng Liu , Predrag Spasojevic , H. Vincent Poor

Semantic communication is a new paradigm for information transmission that integrates the essential meaning (semantics) of the message into the communication process. However, like in classic wireless communications, the open nature of…

Information Theory · Computer Science 2024-10-22 Denis Kozlov , Mahtab Mirmohseni , Rahim Tafazolli

This paper considers an information theoretic model of secure integrated sensing and communication, represented as a wiretap channel with action dependent states. This model allows securing part of a transmitted message against a sensed…

Information Theory · Computer Science 2024-09-10 Truman Welling , Onur Günlü , Aylin Yener

We study the security of communication between a single transmitter and multiple receivers in a broadcast channel in the presence of an eavesdropper. We consider several special classes of channels. As the first model, we consider the…

Information Theory · Computer Science 2008-12-02 Ersen Ekrem , Sennur Ulukus

We consider the secure transmission of information over an ergodic fading channel in the presence of an eavesdropper. Our eavesdropper can be viewed as the wireless counterpart of Wyner's wiretapper. The secrecy capacity of such a system is…

Information Theory · Computer Science 2007-07-16 Praveen Kumar Gopala , Lifeng Lai , Hesham El Gamal

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

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

Information Theory · Computer Science 2016-01-25 Wei Yang , Rafael F. Schaefer , H. Vincent Poor

In this paper, the problem of secret key agreement in state-dependent multiple access channels with an eavesdropper is studied. For this model, the channel state information is non-causally available at the transmitters; furthermore, a…

Cryptography and Security · Computer Science 2013-01-23 Mohsen Bahrami , Ali Bereyhi , Mahtab Mirmohseni , Mohammad Reza Aref
‹ Prev 1 3 4 5 6 7 10 Next ›