English
Related papers

Related papers: Secrecy Outage Probability of Network-Coded Cooper…

200 papers

An opportunistic relay selection based on instantaneous knowledge of channels is considered to increase security against eavesdroppers. The closed-form expressions are derived for the average secrecy rates and the outage probability when…

Information Theory · Computer Science 2010-04-09 Xiaojun Sun , Chunming Zhao , Ming Jiang

This paper proposes a new scheme to enhance the secrecy performance of a NOMA-based coordinated direct relay transmission system (NOMA-CDRT) with an untrusted relay. The physical-layer network coding and the non-orthogonal multiple access…

Information Theory · Computer Science 2022-05-26 Hongjiang Lei , Xusheng She , Ki-Hong Park , Imran Shafique Ansari , Zheng Shi , Jing Jiang , Mohamed-Slim Alouini

We study the problem of secure message multicasting over graphs in the presence of a passive (node) adversary who tries to eavesdrop in the network. We show that use of feedback, facilitated through the existence of cycles or undirected…

Information Theory · Computer Science 2013-05-29 Shaunak Mishra , Christina Fragouli , Vinod Prabhakaran , Suhas Diggavi

The broadcast nature of the wireless medium allows unintended users to eavesdrop the confidential information transmission. In this regard, we investigate the problem of secure communication between a source and a destination via a wireless…

Information Theory · Computer Science 2016-03-11 Sanket S. Kalamkar , Adrish Banerjee

This work considers the problem of mitigating information leakage between communication and sensing in systems jointly performing both operations. Specifically, a discrete memoryless state-dependent broadcast channel model is studied in…

Information Theory · Computer Science 2022-08-16 Onur Günlü , Matthieu Bloch , Rafael F. Schaefer , Aylin Yener

Regenerating codes enable trading off repair bandwidth for storage in distributed storage systems (DSS). Due to their distributed nature, these systems are intrinsically susceptible to attacks, and they may also be subject to multiple…

Information Theory · Computer Science 2014-07-10 O. Ozan Koyluoglu , Ankit Singh Rawat , Sriram Vishwanath

Cooperative jamming is an approach that has been recently proposed for improving physical layer based security for wireless networks in the presence of an eavesdropper. While the source transmits its message to its destination, a relay node…

Information Theory · Computer Science 2009-07-30 Lun Dong , Zhu Han , Athina P. Petropulu , H. Vincent Poor

Polar codes have been proven to be capacity achieving for any binary-input discrete memoryless channel, while at the same time they can reassure secure and reliable transmission over the single-input single-output wireless channel. However,…

We consider a network of two nodes separated by a noisy channel, in which the source and its reconstruction have to be strongly coordinated, while simultaneously satisfying the strong secrecy condition with respect to an outside observer of…

Information Theory · Computer Science 2020-09-04 Giulia Cervia , German Bassi , Mikael Skoglund

This paper considers secure energy-efficient routing in the presence of multiple passive eavesdroppers. Previous work in this area has considered secure routing assuming probabilistic or exact knowledge of the location and…

Networking and Internet Architecture · Computer Science 2017-03-16 Azadeh Sheikholeslami , Majid Ghaderi , Hossein Pishro-Nik , Dennis Goeckel

In this paper, we propose a cooperative approach to improve the security of both primary and secondary systems in cognitive radio multicast communications. During their access to the frequency spectrum licensed to the primary users, the…

Information Theory · Computer Science 2017-03-02 Van-Dinh Nguyen , Trung Q. Duong , Oh-Soon Shin , Arumugam Nallanathan , George K. Karagiannidis

Coding Opportunistically (COPE) is a simple but very effective data coding mechanism in the wireless network. However, COPE leaves risks for attackers easily getting the private information saved in the packets, when they move through the…

Cryptography and Security · Computer Science 2018-06-15 Ngoc Hong Tran , Cao-Vien Phung , Binh Quoc Nguyen , Leila Bahri

Cooperative multicast is an effective solution to address the bottleneck problem of single-hop broadcast in wireless networks. By incorporating with the random linear network coding technique, the existing schemes can reduce the…

Networking and Internet Architecture · Computer Science 2012-09-19 Fei Wu , Cunqing Hua , Hangguan Shan , Aiping Huang

In this work, we explore the outage probability (OP) analysis of selective decode and forward (SDF) cooperation protocol employing multiple-input multipleoutput (MIMO) orthogonal space-time block-code (OSTBC) over time varying Rayleigh…

Networking and Internet Architecture · Computer Science 2018-11-27 Ravi Shankar , Ritesh Kumar Mishra

This work mainly addresses continuous-time multiagent consensus networks where an adverse attacker affects the convergence performances of said protocol. In particular, we develop a novel secure-by-design approach in which the presence of a…

Systems and Control · Electrical Eng. & Systems 2025-01-30 Marco Fabris , Daniel Zelazo

Due to the broadcast nature of wireless medium, wireless communication is extremely vulnerable to eavesdropping attack. Physical-layer security is emerging as a new paradigm to prevent the eavesdropper from interception by exploiting the…

Information Theory · Computer Science 2016-11-17 Yulong Zou , Xianbin Wang , Weiming Shen

In this paper, we propose an opportunistic network coding (ONC) scheme in cellular relay networks, which operates depending on whether the relay decodes source messages successfully or not. A fully distributed method is presented to…

Information Theory · Computer Science 2016-11-17 Yulong Zou , Jia Zhu , Baoyu Zheng

Traditional network security protocols depend mainly on developing cryptographic schemes and on using biometric methods. These have led to several network security protocols that are unbreakable based on difficulty of solving untractable…

Networking and Internet Architecture · Computer Science 2010-12-24 Salah A. Aly , Nirwan Ansari , H. Vincent Poor

In this paper we consider the robust secure beamformer design for MISO wiretap channels. Assume that the eavesdroppers' channels are only partially available at the transmitter, we seek to maximize the secrecy rate under the transmit power…

Information Theory · Computer Science 2013-10-29 Shuai Ma , Mingyi Hong , Enbin Song , Xiangfeng Wang , Dechun Sun

Fundamental limits of secret-key agreement over reciprocal wireless channels are investigated. We consider a two-way block-fading channel where the channel gains in the forward and reverse links between the legitimate terminals are…

Information Theory · Computer Science 2012-11-08 Ashish Khisti