English
Related papers

Related papers: On Secrecy Capacity Scaling in Wireless Networks

200 papers

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

We investigate large wireless networks subject to security constraints. In contrast to point-to-point, interference-limited communications considered in prior works, we propose active cooperative relaying based schemes. We consider a…

Information Theory · Computer Science 2015-03-03 Mahtab Mirmohseni , Panagiotis Papadimitratos

The use of multiple source nodes with wireless backhaul is considered for secrecy enhancement through source node selection in future wireless networks. The ergodic secrecy rate (ESR) of {optimal source node selection in the presence of…

Signal Processing · Electrical Eng. & Systems 2021-03-09 Chinmoy Kundu , Mark F. Flanagan

This work considers the problem of secure and reliable information transmission via relay cooperation in two-hop relay wireless networks without the information of both eavesdropper channels and locations. While previous work on this…

Cryptography and Security · Computer Science 2012-12-04 Yulong Shen , Xiaohong Jiang , Jianfeng Ma , Weisong Shi

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

We study the secrecy of wireless channels in the presence of an eavesdropper, where the channels are random and the transmitter only has knowledge of the channel statistics. We investigate the optimal input distribution with respect to…

Information Theory · Computer Science 2026-04-27 Clement Leroy , Tarak Arbi , Benoit Geller , Olivier Rioul

Information-theoretic security -- widely accepted as the strictest notion of security -- relies on channel coding techniques that exploit the inherent randomness of the propagation channels to significantly strengthen the security of…

Information Theory · Computer Science 2010-01-22 Pedro C. Pinto , Joao Barros , Moe Z. Win

Node selection is a simple technique to achieve diversity and thereby enhance the physical layer security in future wireless communication systems which require low complexity. High-speed data transmission often encounters frequency…

Information Theory · Computer Science 2022-11-22 Shashi Bhushan Kotwal , Chinmoy Kundu , Sudhakar Modem , Ankit Dubey , Mark F. Flanagan

Information theoretic secrecy is combined with cryptographic secrecy to create a secret-key exchange protocol for wireless networks. A network of transmitters, which already have cryptographically secured channels between them, cooperate to…

Cryptography and Security · Computer Science 2016-11-15 Toni Draganov Stojanovski , Ninoslav Marina

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…

Information Theory · Computer Science 2020-05-29 Hongchao Zhou , Abbas El Gamal

In this paper, we consider a scenario where a source node wishes to broadcast two confidential messages to two receivers, while a wire-tapper also receives the transmitted signal. This model is motivated by wireless communications, where…

Information Theory · Computer Science 2009-10-20 Ghadamali Bagherikaram , Abolfazl S. Motahari , Amir K. Khandani

This work studies the throughput scaling laws of ad hoc wireless networks in the limit of a large number of nodes. A random connections model is assumed in which the channel connections between the nodes are drawn independently from a…

Information Theory · Computer Science 2016-11-18 Shengshan Cui , Alexander M. Haimovich , Oren Somekh , H. Vincent Poor , Shlomo Shamai

In this paper, we investigate the secrecy performance of stochastic MIMO wireless networks over small-scale $\alpha$-$\mu$ fading channels, where both the legitimate receivers and eavesdroppers are distributed with two independent…

Information Theory · Computer Science 2018-10-03 Long Kong , Satyanarayana Vuppala , Georges Kaddoum

Considering a multi-user interference network with an eavesdropper, this paper aims at the power allocation to optimize the worst secrecy throughput among the network links or the secure energy efficiency in terms of achieved secrecy…

Information Theory · Computer Science 2017-08-25 Zhichao Sheng , Hoang Duong Tuan , Ali Arshad Nasir , Trung Q. Duong , H. Vincent Poor

This work considers the secure and reliable information transmission in two-hop relay wireless networks without the information of both eavesdropper channels and locations. While the previous work on this problem mainly studied infinite…

Networking and Internet Architecture · Computer Science 2012-12-03 Yulong Shen , Xiaohong Jiang , Jianfeng Ma , Weisong Shi

In this paper, we introduce two new achievable schemes for the fading multiple access wiretap channel (MAC-WT). In the model that we consider, we assume that perfect knowledge of the state of all channels is available at all the nodes in a…

Information Theory · Computer Science 2010-10-29 Raef Bassily , Sennur Ulukus

We show that for a legitimate communication under multipath quasi-static fading with a reduced number of scatterers, it is possible to achieve perfect secrecy even in the presence of a passive eavesdropper for which no channel state…

Information Theory · Computer Science 2019-10-23 Pablo Ramírez-Espinosa , R. José Sánchez-Alarcón , F. Javier López-Martínez

Two-hop security communication with an eavesdropper in wireless environment is a hot research direction. The basic idea is that the destination, simultaneously with the source, sends a jamming signal to interfere the eavesdropper near to or…

Information Theory · Computer Science 2013-10-03 Zhen Qu , Shengli Zhang , Mingjun Dai , Hui Wang

Reliable communication imposes an upper limit on the achievable rate, namely the Shannon capacity. Wyner's wiretap coding, which ensures a security constraint also, in addition to reliability, results in decrease of the achievable rate. To…

Information Theory · Computer Science 2017-02-14 Shahid M. Shah , Vinod Sharma

This paper studies the throughput of large-scale decentralized wireless networks with physical layer security constraints. In particular, we are interested in the question of how much throughput needs to be sacrificed for achieving a…

Information Theory · Computer Science 2016-11-17 Xiangyun Zhou , Radha Krishna Ganti , Jeffrey G. Andrews , Are Hjørungnes
‹ Prev 1 2 3 10 Next ›