English
Related papers

Related papers: Two-hop Secure Communication Using an Untrusted Re…

200 papers

The communication scenario under consideration in this paper corresponds to a multiuser channel with side information and consists of a broadcast channel with two legitimate receivers and an eavesdropper. Mainly, the results obtained are as…

Information Theory · Computer Science 2012-10-24 Maël Le Treust , Abdellatif Zaidi , Samson Lasaulce

In a multi-user wireless network equipped with multiple relay nodes, some relays are more intelligent than other relay nodes. The intelligent relays are able to gather channel state information, perform linear processing and forward signals…

Information Theory · Computer Science 2015-06-04 Zuleita Ho , Eduard Jorswieck

In physical layer security (PHY-security), the frequently observed high correlation between the main and wiretap channels can cause a significant loss of secrecy. This paper investigates a slow fading scenario, where a transmitter (Alice)…

Information Theory · Computer Science 2017-08-16 Shuai Han , Sai Xu , Weixiao Meng , Cheng Li

Reconfigurable intelligent surfaces (RISs) are recognized with great potential to strengthen wireless security, yet the performance gain largely depends on the deployment location of RISs in the network topology. In this paper, we consider…

Signal Processing · Electrical Eng. & Systems 2023-03-01 Xiao Tang , Hongliang He , Limeng Dong , Lixin Li , Qinghe Du , Zhu Han

We evaluate the secrecy performance of a multiple access cooperative network where the destination node is wiretapped by a malicious and passive eavesdropper. We propose the application of the network coding technique as an alternative to…

We investigate a relay network where a multiantenna source can potentially utilize an unauthenticated (untrusted) relay to augment its direct transmission of a confidential message to the destination. Since the relay is untrusted, it is…

Information Theory · Computer Science 2016-11-17 Amitav Mukherjee

In this paper, we investigate opportunistic relaying and jamming techniques and develop relay selection algorithms that maximize the secrecy rate for multiuser buffer-aided relay networks. We develop an approach to maximize the secrecy rate…

Information Theory · Computer Science 2020-11-19 X. Lu , R. C. de Lamare

A novel private communication framework is proposed where privacy is induced by transmitting over a channel instances of linear inverse problems that are identifiable to the legitimate receiver but unidentifiable to an eavesdropper. The gap…

Information Theory · Computer Science 2024-07-24 Maxime Ferreira Da Costa , Jianxiu Li , Urbashi Mitra

The two user Gaussian interference channel with a full-duplex relay is studied. By using genie aided approaches, two new upper bounds on the achievable sum-rate in this setup are derived. These upper bounds are shown to be tighter than…

Information Theory · Computer Science 2010-08-16 Anas Chaaban , Aydin Sezgin

The secrecy capacity of relay channels with orthogonal components is studied in the presence of an additional passive eavesdropper node. The relay and destination receive signals from the source on two orthogonal channels such that the…

Information Theory · Computer Science 2009-06-09 Vaneet Aggarwal , Lalitha Sankar , A. Robert Calderbank , H. Vincent Poor

This paper studies secrecy transmission with the aid of a group of wireless energy harvesting (WEH)-enabled amplify-and-forward (AF) relays performing cooperative jamming (CJ) and relaying. The source node in the network does simultaneous…

Information Theory · Computer Science 2015-11-13 Hong Xing , Kai-Kit Wong , Arumugam Nallanathan , Rui Zhang

This paper studies an untrusted relay channel, in which the destination sends artificial noise simultaneously with the source sending a message to the relay, in order to protect the source's confidential message. The traditional…

Information Theory · Computer Science 2015-04-01 Shengli Zhang , Lisheng Fan , Mugen Peng , H. Vincent Poor

In this paper, we derive information-theoretic performance limits for secure and reliable communications over the general two-user discrete memoryless broadcast channel with side-information at the transmitter. The sender wishes to…

Information Theory · Computer Science 2011-09-27 K. G. Nagananda , Chandra R Murthy , Shalinee Kishore

This letter proposes a novel UAV-enabled mobile jamming scheme to improve the secrecy rate of ground wiretap channel. Specifically, a UAV is employed to transmit jamming signals to combat against eavesdropping. Such a mobile jamming scheme…

Information Theory · Computer Science 2018-10-16 An Li , Qingqing Wu , Rui Zhang

In this paper, the role of secret key with finite rate is studied to enhance the secrecy performance of the system when users are operating in interference limited scenarios. To address this problem, a 2-user Gaussian Z-IC with secrecy…

Information Theory · Computer Science 2021-05-20 Somalatha U , Parthajit Mohapatra

This paper studies the design and secrecy performance of linear multihop networks, in the presence of randomly distributed eavesdroppers in a large-scale two-dimensional space. Depending on whether there is feedback from the receiver to the…

Information Theory · Computer Science 2017-11-07 Jianping Yao , Xiangyun Zhou , Yuan Liu , Suili Feng

We investigate the effects of an additional relay node on the secrecy of broadcast channels by considering the model of relay broadcast channels with confidential messages. We show that this additional relay node can increase the achievable…

Information Theory · Computer Science 2015-12-09 Bin Dai , Linman Yu , Zheng Ma

This article examines the secrecy coding aided wireless communications from a source to a destination in the presence of an eavesdropper from a security-reliability tradeoff (SRT) perspective. Explicitly, the security is quantified in terms…

Information Theory · Computer Science 2016-11-17 Yulong Zou , Jia Zhu , Xuelong Li , Lajos Hanzo

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…

Information Theory · Computer Science 2014-08-11 László Czap , Vinod M. Prabhakaran , Christina Fragouli , Suhas Diggavi

This paper analyzes the throughput of industrial communication networks under a secrecy constraint. The proposed scenario is composed by sensors that measure some relevant information of the plant that is first processed by aggregator node…

Information Theory · Computer Science 2015-12-18 Pedro H. J. Nardelli , Hirley Alves , Carlos H. M. de Lima , Matti Latva-aho