中文
相关论文

相关论文: On the Secrecy Capacity of 1-2-1 Atomic Networks

200 篇论文

This paper starts by assuming a 1-2-1 network, the abstracted noiseless model of mmWave networks that was shown to closely approximate the Gaussian capacity in [1], and studies secure communication. First, the secure capacity is derived for…

信息论 · 计算机科学 2018-10-16 Gaurav Kumar Agarwal , Yahya H. Ezzeldin , Martina Cardone , Christina Fragouli

This paper proposes a new model for wireless relay networks referred to as "1-2-1 network", where two nodes can communicate only if they point "beams" at each other, while if they do not point beams at each other, no signal can be exchanged…

信息论 · 计算机科学 2018-10-16 Yahya H. Ezzeldin , Martina Cardone , Christina Fragouli , Giuseppe Caire

In this work, we study bounds on the capacity of full-duplex Gaussian 1-2-1 networks with imperfect beamforming. In particular, different from the ideal 1-2-1 network model introduced in [1], in this model beamforming patterns result in…

信息论 · 计算机科学 2020-05-15 Yahya H. Ezzeldin , Martina Cardone , Christina Fragouli , Giuseppe Caire

We investigate the problem of information theoretically secure communication in a line network with erasure channels and state feedback. We consider a spectrum of cases for the private randomness that intermediate nodes can generate,…

信息论 · 计算机科学 2014-07-09 Athanasios Papadopoulos , Laszlo Czap , Christina Fragouli

This paper studies the problem of secure communication over the broadcast channel with receiver side information under the lens of individual secrecy constraints. That is, the transmitter wants to send two independent messages to two…

信息论 · 计算机科学 2015-02-26 Yanling Chen , O. Ozan Koyluoglu , Aydin Sezgin

We consider the secure quantum communication over a network with the presence of a malicious adversary who can eavesdrop and contaminate the states. The network consists of noiseless quantum channels with the unit capacity and the nodes…

量子物理 · 物理学 2020-01-28 Seunghoan Song , Masahito Hayashi

The secrecy capacity of a network, for a given collection of permissible wiretap sets, is the maximum rate of communication such that observing links in any permissible wiretap set reveals no information about the message. This paper…

信息论 · 计算机科学 2016-11-17 Tao Cui , Tracey Ho , Joerg Kliewer

This paper studies the problem of information theoretic secure communication when a source has private messages to transmit to $m$ destinations, in the presence of a passive adversary who eavesdrops an unknown set of $k$ edges. The…

信息论 · 计算机科学 2019-04-12 Gaurav Kumar Agarwal , Martina Cardone , Christina Fragouli

This paper characterizes the secret message capacity of three networks where two unicast sessions share some of the communication resources. Each network consists of erasure channels with state feedback. A passive eavesdropper is assumed to…

信息论 · 计算机科学 2018-10-16 Gaurav Kumar Agarwal , Martina Cardone , Christina Fragouli

In physical-layer security, one of the most fundamental issues is the secrecy capacity. The objective of this paper is to determine the secrecy capacity for an indoor visible light communication system consisting of a transmitter, a…

信息论 · 计算机科学 2021-09-24 Jin-Yuan Wang , Xian-Tao Fu , Jun-Bo Wang , Min Lin , Julian Cheng , Mohamed-Slim Alouini

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…

信息论 · 计算机科学 2016-07-18 Tulika Agrawal , Samar Agnihotri

We consider the communication scenario where K transmitters are each connected to a common receiver with an orthogonal noiseless link. One of the transmitters has a message for the receiver, who is prohibited from learning anything in the…

信息论 · 计算机科学 2018-04-05 Hua Sun

This work considers the one-shot capacity of communication networks subject to adversarial noise affecting a subset of network edges. In particular, we examine previously-established upper bounds on one-shot capacity. We introduce the…

信息论 · 计算机科学 2021-07-06 Allison Beemer , Alberto Ravagnani

Shannon showed that to achieve perfect secrecy in point-to-point communication, the message rate cannot exceed the shared secret key rate giving rise to the simple one-time pad encryption scheme. In this paper, we extend this work from…

信息论 · 计算机科学 2020-05-29 Hongchao Zhou , Abbas El Gamal

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…

信息论 · 计算机科学 2013-09-09 Matthieu R. Bloch , J. Nicholas Laneman

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…

信息论 · 计算机科学 2008-12-02 Ersen Ekrem , Sennur Ulukus

We consider a 1-to-$K$ communication scenario, where a source transmits private messages to $K$ receivers through a broadcast erasure channel, and the receivers feed back strictly causally and publicly their channel states after each…

信息论 · 计算机科学 2014-08-11 László Czap , Vinod M. Prabhakaran , Christina Fragouli , Suhas Diggavi

One key metric for physical layer security is the secrecy capacity. This is the maximum rate that a system can transmit with perfect secrecy. For a Multiple Input Multiple Output (MIMO) system (a newer technology for 5G, 6G and beyond) the…

信息论 · 计算机科学 2022-10-03 Jennifer Chakravarty , Oliver Johnson , Robert Piechocki

This paper deals with the secrecy capacity of the radio channel in interference-limited regime. We assume that interferers are uniformly scattered over the network area according to a Point Poisson Process and the channel model consists of…

Secrecy capacity of a multiple-antenna wiretap channel is studied in the low signal-to-noise ratio (SNR) regime. Expressions for the first and second derivatives of the secrecy capacity with respect to SNR at SNR = 0 are derived.…

信息论 · 计算机科学 2009-01-21 Mustafa Cenk Gursoy
‹ 上一页 1 2 3 10 下一页 ›