English
Related papers

Related papers: Classical - Quantum Arbitrarily Varying Wiretap Ch…

200 papers

Strong secrecy capacity of compound wiretap channels is studied. The known lower bounds for the secrecy capacity of compound finite-state memoryless channels under discrete alphabets are extended to arbitrary uncertainty sets and continuous…

Information Theory · Computer Science 2015-09-09 Rafael F. Schaefer , Sergey Loyka

Incorporating the physical layer characteristics to secure communications has received considerable attention in recent years. Moreover, cooperation with some nodes of network can give benefits of multiple-antenna systems, increasing the…

Information Theory · Computer Science 2013-01-10 Meysam Mirzaee , Soroush Akhlaghi

This paper studies the secrecy results for the two-way wiretap channel (TW-WC) with an external eavesdropper under a strong secrecy metric. Employing non-adaptive coding, we analyze the information leakage and the decoding error…

Information Theory · Computer Science 2024-09-10 Masahito Hayashi , Yanling Chen

We consider the multiple-input multiple-output (MIMO) wiretap channel under a minimum receiver-side power constraint in addition to the usual maximum transmitter-side power constraint. This problem is motivated by energy harvesting…

Information Theory · Computer Science 2016-11-17 Karim Banawan , Sennur Ulukus

In this paper, we study the problem of secret communication over a multiple-access channel with a common message. Here, we assume that two transmitters have confidential messages, which must be kept secret from the wiretapper (the second…

Information Theory · Computer Science 2016-07-13 Hassan Zivari-Fard , Bahareh Akhbari , Mahmoud Ahmadian-Attari , Mohammad Reza Aref

Due to the short and bursty incoming messages, channel access activities in a wireless random access system are often fractional. The lack of frequent data support consequently makes it difficult for the receiver to estimate and track the…

Information Theory · Computer Science 2011-10-11 Zheng Wang , Jie Luo

We study the secrecy capacity of a helper-assisted Gaussian wiretap channel with a source, a legitimate receiver, an eavesdropper and an external helper, where each terminal is equipped with multiple antennas. Determining the secrecy…

Information Theory · Computer Science 2015-09-16 Lingxiang Li , Zhi Chen , Jun Fang , and Athina P. Petropulu

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

A two-transmitter Gaussian multiple access wiretap channel with multiple antennas at each of the nodes is investigated. The channel matrices at the legitimate terminals are fixed and revealed to all the terminals, whereas the channel matrix…

Information Theory · Computer Science 2012-03-08 Xiang He , Ashish Khisti , Aylin Yener

The compound broadcast channel with confidential messages (BCC) generalizes the BCC by modeling the uncertainty of the channel. For the compound BCC, it is only known that the actual channel realization belongs to a pre-specified…

Information Theory · Computer Science 2014-11-05 Andrea Grigorescu , Holger Boche , Rafael F. Schaefer , H. Vincent Poor

An arbitrarily varying wiretap channel (AVWTC) with a type constraint on the allowed state sequences is considered, and a single-letter characterization of its correlated-random (CR) assisted semantic-security (SS) capacity is derived. The…

Information Theory · Computer Science 2016-10-19 Ziv Goldfeld , Paul Cuff , Haim H. Permuter

This work is motivated by a quite general question: Under which circumstances are the capacities of information transmission systems continuous? The research is explicitly carried out on arbitrarily varying quantum channels (AVQCs). We give…

Quantum Physics · Physics 2015-06-18 H. Boche , J. Noetzel

We analyze physical-layer security based on the premise that the coding mechanism for secrecy over noisy channels is tied to the notion of channel resolvability. Instead of considering capacity-based constructions, which associate to each…

Information Theory · Computer Science 2013-09-09 Matthieu R. Bloch , J. Nicholas Laneman

The process of quantum teleportation can be considered as a quantum channel. The exact classical capacity of the continuous variable teleportation channel is given. Also, the channel fidelity is derived. Consequently, the properties of the…

Quantum Physics · Physics 2015-06-26 Tao Qin , Meisheng Zhao , Yongde Zhang

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 propose a multi-mode modulation scheme for Continuous Variable (CV) quantum communications, which we call quantum pattern encoding. In this setting, classical information can be encoded into multi-mode patterns of discretely-modulated…

Quantum Physics · Physics 2022-01-25 Cillian Harney , Stefano Pirandola

The secrecy performance of a source-channel model is studied in the context of lossy source compression over a noisy broadcast channel. The source is causally revealed to the eavesdropper during decoding. The fidelity of the transmission to…

Information Theory · Computer Science 2015-06-24 Eva C. Song , Paul Cuff , H. Vincent Poor

We introduce and analyze an information theoretical task that we call the quantum multiple-access one-time pad. Here, a number of senders initially share a correlated quantum state with a receiver and an eavesdropper. Each sender performs a…

Quantum Physics · Physics 2022-08-26 Eyuri Wakakuwa

It is a well-known fact that feedback does not increase the capacity of point-to-point memoryless channels, however, its effect in secure communications is not fully understood yet. In this work, an achievable scheme for the wiretap channel…

Information Theory · Computer Science 2019-03-26 Germán Bassi , Pablo Piantanida , Shlomo Shamai

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
‹ Prev 1 4 5 6 7 8 10 Next ›