English
Related papers

Related papers: Cyber-Physical-Systems and Secrecy Outage Probabil…

200 papers

This paper investigates the secrecy performance of a keyhole-aided multi-user communication network in the presence of multiple eavesdroppers. The communication happens through the same keyhole for legitimate users and eavesdroppers. In…

Signal Processing · Electrical Eng. & Systems 2026-01-28 Parwez Alam , Ankit Dubey , Jules M. Moualeu , Telex M. N. Ngatched , Chinmoy Kundu

An alternative or supplementary approach named as physical layer security has been proposed to afford an extra security layer on top of the conventional cryptography technique. In this paper, an overview of secrecy performance…

Information Theory · Computer Science 2020-12-15 Long Kong , Yun Ai , Lei Lei , Georges Kaddoum , Symeon Chatzinotas , Björn Ottersten

In this paper, we investigate the secrecy performance of underlay cognitive small-cell radio network with unreliable backhaul connections. The secondary cognitive small-cell transmitters are connected to macro base station by wireless…

Signal Processing · Electrical Eng. & Systems 2021-03-11 Jinghua Zhang , Chinmoy Kundu , Emi Garcia-Palacios

The amount of sensitive data, which is transmitted wirelessly will increase with future technologies. This raises many questions about secure data transmission. Besides cryptography, information-theoretic security gained increasing…

Information Theory · Computer Science 2021-01-18 Karl-Ludwig Besser , Eduard A. Jorswieck

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,…

Information Theory · Computer Science 2014-07-09 Athanasios Papadopoulos , Laszlo Czap , Christina Fragouli

The aim of this paper is to provide several novel upper bounds on the excess risk with a primal focus on classification problems. We suggest two approaches and the obtained bounds are represented via the distribution dependent local…

Statistics Theory · Mathematics 2018-03-13 Nikita Zhivotovskiy

This letter studies parallel independent Gaussian channels with uncertain eavesdropper channel state information (CSI). Firstly, we evaluate the probability of zero secrecy rate in this system for (i) given instantaneous channel conditions…

Information Theory · Computer Science 2016-02-23 Siddhartha Sarma , Kundan Kandhway , Joy Kuri

Given a sequence of observations from a discrete-time, finite-state hidden Markov model, we would like to estimate the sampling distribution of a statistic. The bootstrap method is employed to approximate the confidence regions of a…

Computation · Statistics 2009-09-29 Cheng-Der Fuh , Inchi Hu

This paper considers point to point secure communication over flat fading channels under an outage constraint. More specifically, we extend the definition of outage capacity to account for the secrecy constraint and obtain sharp…

Information Theory · Computer Science 2011-12-14 Onur Gungor , Jian Tan , C. Emre Koksal , Hesham El Gamal , Ness B. Shroff

Optimal signaling for secrecy rate maximization in Gaussian MIMO wiretap channels is considered. While this channel has attracted a significant attention recently and a number of results have been obtained, including the proof of the…

Information Theory · Computer Science 2016-11-18 Sergey Loyka , Charalambos D. Charalambous

In a recent paper, the authors proposed a general methodology for probabilistic learning on manifolds. The method was used to generate numerical samples that are statistically consistent with an existing dataset construed as a realization…

Probability · Mathematics 2018-03-30 C. Soizea , R. Ghanem , C. Safta , X. Huan , Z. P. Vane , J. Oefelein , G. Lacaz , H. N. Najm , Q. Tang , X. Chen

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

A Private Repetition algorithm takes as input a differentially private algorithm with constant success probability and boosts it to one that succeeds with high probability. These algorithms are closely related to private metaselection…

Cryptography and Security · Computer Science 2024-10-28 Kunal Talwar

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

Information Theory · Computer Science 2008-07-30 Ghadamali Bagherikaram , Abolfazl S. Motahari , Amir K. Khandani

Determining the ultimate limits of quantum communication, such as the quantum capacity of a channel and the distillable entanglement of a shared state, remains a central challenge in quantum information theory, primarily due to the…

Quantum Physics · Physics 2025-10-15 Chengkai Zhu , Hongyu Mao , Kun Fang , Xin Wang

This paper investigates an important class of information-flow security property called opacity for stochastic control systems. Opacity captures whether a system's secret behavior (a subset of the system's behavior that is considered to be…

Systems and Control · Electrical Eng. & Systems 2025-01-29 Siyuan Liu , Xiang Yin , Dimos V. Dimarogonas , Majid Zamani

The utilization of extremely high frequency (EHF) bands can achieve very high throughput in satellite networks (SatNets). Nevertheless, the severe rain attenuation at EHF bands imposes strict limitations on the system availability. Smart…

Networking and Internet Architecture · Computer Science 2021-04-30 Christos N. Efrem , Athanasios D. Panagopoulos

We consider the problem of finding secrecy rate of a multiple-input multiple-output (MIMO) wire-tap channel. A transmitter, a legitimate receiver, and an eavesdropper are all equipped with multiple antennas. The channel states from the…

Information Theory · Computer Science 2014-11-04 Arash Khabbazibasmenj , Maksym A. Girnyk , Sergiy A. Vorobyov , Mikko Vehkaperä , Lars K. Rasmussen

Given two random variables $X$ and $Y$, an operational approach is undertaken to quantify the ``leakage'' of information from $X$ to $Y$. The resulting measure $\mathcal{L}(X \!\! \to \!\! Y)$ is called \emph{maximal leakage}, and is…

Information Theory · Computer Science 2018-07-23 Ibrahim Issa , Aaron B. Wagner , Sudeep Kamath

We have formerly introduced Deep Random Secrecy, a new cryptologic technique capable to ensure secrecy as close as desired from perfection against unlimited passive eavesdropping opponents. We have also formerly introduced an extended…

Cryptography and Security · Computer Science 2019-01-09 Thibault de Valroger