English
Related papers

Related papers: Strong Secrecy for General Multiple-Access Wiretap…

200 papers

This paper considers the problem of secure coding design for a type II wiretap channel, where the main channel is noiseless and the eavesdropper channel is a general binary-input symmetric-output memoryless channel. The proposed secure…

Information Theory · Computer Science 2016-11-18 Ruoheng Liu , Yingbin Liang , H. Vincent Poor , Predrag Spasojevic

This paper considers the secrecy performance of several schemes for multi-antenna transmission to single-antenna users with full-duplex (FD) capability against randomly distributed single-antenna eavesdroppers (EDs). These schemes and…

Information Theory · Computer Science 2025-07-21 Ishmam Zabir , Ahmed Maksud , Gaojie Chen , Brian M. Sadler , Yingbo Hua

For discrete memoryless multiple-access channels, we propose a general definition of variable length codes with a measure of the transmission rates at the receiver side. This gives a receiver perspective on the multiple-access channel…

Information Theory · Computer Science 2011-02-28 Stephane Musy

Information-theoretic work for wiretap channels is mostly based on random coding schemes. Designing practical coding schemes to achieve information-theoretic security is an important problem. By applying the two recently developed…

Information Theory · Computer Science 2014-10-15 Yi-Peng Wei , Sennur Ulukus

This paper considers a multiple-input multiple-output (MIMO) Gaussian wiretap channel model, where there exists a transmitter, a legitimate receiver and an eavesdropper, each equipped with multiple antennas. Perfect secrecy is achieved when…

Information Theory · Computer Science 2010-06-10 S. Ali. A. Fakoorian , A. Lee Swindlehurst

This work investigates the effect of finite-alphabet source input on the secrecy rate of a multi-antenna wiretap system. Existing works have characterized maximum achievable secrecy rate or secrecy capacity for single and multiple antenna…

Information Theory · Computer Science 2016-11-15 Shafi Bashar , Zhi Ding , Chengshan Xiao

Invoking large transmit antenna arrays, massive MIMO wiretap settings are capable of suppressing passive eavesdroppers via narrow beamforming towards legitimate terminals. This implies that secrecy is obtained almost for free in these…

Information Theory · Computer Science 2019-12-06 Ali Bereyhi , Saba Asaad , Ralf R. Müller , Rafael F. Schaefer , Georg Fischer , H. Vincent Poor

Secure communications is becoming increasingly relevant in the development of space technology. Well established cryptographic technology is already in place and is expected to continue to be so. On the other hand, information theoretical…

Information Theory · Computer Science 2018-05-22 Angeles Vazquez-Castro , Masahito Hayashi

In this paper, we consider the problem of secret key agreement in state-dependent 3-receiver broadcast channels. In the proposed model, there are two legitimate receivers, an eavesdropper and a transmitter where the channel state…

Cryptography and Security · Computer Science 2013-05-17 Mohsen Bahrami , Ali Bereyhi , Sadaf Salehkalaibar , Mohammad Reza Aref

This paper presents a secrecy performance study of a wiretap communication system with finite blocklength (FBL) transmissions over Rayleigh fading channels, based on the definition of an average information leakage (AIL) metric. We evaluate…

Information Theory · Computer Science 2024-01-23 Milad Tatar Mamaghani , Xiangyun Zhou , Nan Yang , A. Lee Swindlehurst , H. Vincent Poor

We show that duals of certain low-density parity-check (LDPC) codes, when used in a standard coset coding scheme, provide strong secrecy over the binary erasure wiretap channel (BEWC). This result hinges on a stopping set analysis of…

Information Theory · Computer Science 2010-10-26 Ananda T. Suresh , Arunkumar Subramanian , Andrew Thangaraj , Matthieu Bloch , Steven McLaughlin

In this paper, we explore the connection between secret key agreement and secure omniscience within the setting of the multiterminal source model with a wiretapper who has side information. While the secret key agreement problem considers…

Information Theory · Computer Science 2023-07-28 Praneeth Kumar Vippathalla , Chung Chan , Navin Kashyap , Qiaoqiao Zhou

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

This paper uses Euclidean Information Theory (EIT) to analyze the wiretap channel. We investigate a scenario of efficiently transmitting a small amount of information subject to compression rate and secrecy constraints. We transform the…

Information Theory · Computer Science 2024-03-21 Emmanouil M. Athanasakos , Nicholas Kalouptsidis , Hariprasad Manjunath

A discrete memoryless generalized multiple access channel (GMAC) with confidential messages is studied, where two users attempt to transmit common information to a destination and each user also has private (confidential) information…

Information Theory · Computer Science 2007-07-13 Yingbin Liang , H. Vincent Poor

In this paper, we study the secure transmission in multihop wireless networks with randomize-and-forward (RaF) relaying, in the presence of randomly distributed eavesdroppers. By considering adaptive encoder with on-off transmission (OFT)…

Information Theory · Computer Science 2017-10-31 Jianping Yao , Yuan Liu

We consider a system where an agent (Alice) aims at transmitting a message to a second agent (Bob) over a set of parallel channels, while keeping it secret from a third agent (Eve) by using physical layer security techniques. We assume that…

Information Theory · Computer Science 2014-10-28 Marco Baldi , Marco Bianchi , Franco Chiaraluce , Nicola Laurenti , Stefano Tomasin , Francesco Renna

The problem of secure lossy source-channel wiretapping with arbitrarily correlated side informations at both receivers is investigated. This scenario consists of an encoder (referred to as Alice) that wishes to compress a source and send it…

Information Theory · Computer Science 2011-10-11 Joffrey Villard , Pablo Piantanida , Shlomo Shamai

The General Gaussian Multiple Access Wire-Tap Channel (GGMAC-WT) and the Gaussian Two-Way Wire-Tap Channel (GTW-WT) are considered. In the GGMAC-WT, multiple users communicate with an intended receiver in the presence of an eavesdropper who…

Information Theory · Computer Science 2008-01-28 Ender Tekin , Aylin Yener

We consider the problem of polar coding for secure communications over the two-way wiretap channel, where two legitimate users communicate with each other simultaneously while a passive eavesdropper overhears a combination of their…

Information Theory · Computer Science 2017-06-23 Mengfan Zheng , Meixia Tao , Wen Chen , Cong Ling
‹ Prev 1 8 9 10 Next ›