English
Related papers

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

200 papers

Data publishing under privacy constraints can be achieved with mechanisms that add randomness to data points when released to an untrusted party, thereby decreasing the data's utility. In this paper, we analyze this privacy-utility tradeoff…

Information Theory · Computer Science 2024-08-28 Leonhard Grosse , Sara Saeidian , Tobias Oechtering

We study approximation algorithms for Maximum Constraint Satisfaction Problems (Max-CSPs) under differential privacy (DP) where the constraints are considered sensitive data. Information-theoretically, we aim to classify the best…

Data Structures and Algorithms · Computer Science 2026-02-11 Prathamesh Dharangutte , Jingcheng Liu , Pasin Manurangsi , Akbar Rafiey , Phanu Vajanopath , Zongrui Zou

A multiple-input single-output (MISO) wiretap channel model is considered, that includes a multi-antenna transmitter, a single-antenna legitimate receiver and a single-antenna eavesdropper. For the scenario in which spherical uncertainty…

Information Theory · Computer Science 2015-05-30 Jiangyuan Li , Athina P. Petropulu

Equivocation rate has been widely used as an information-theoretic measure of security after Shannon[10]. It simplifies problems by removing the effect of atypical behavior from the system. In [9], however, Merhav and Arikan considered the…

Information Theory · Computer Science 2008-06-01 Chung Chan

Theoretical studies on physical layer security often adopt the secrecy outage probability as the performance metric for wireless communications over quasi-static fading channels. The secrecy outage probability has two limitations from a…

Information Theory · Computer Science 2016-11-15 Biao He , Xiangyun Zhou , A. Lee Swindlehurst

We consider the problem of revealing/sharing data in an efficient and secure way via a compact representation. The representation should ensure reliable reconstruction of the desired features/attributes while still preserve privacy of the…

Information Theory · Computer Science 2016-05-09 Kittipong Kittichokechai , Giuseppe Caire

A common countermeasure against side-channel attacks on secret key cryptographic implementations is $d$th-order masking, which splits each sensitive variable into $d+1$ random shares. In this paper, maximal leakage bounds on the probability…

Information Theory · Computer Science 2023-05-11 Julien Béguinot , Yi Liu , Olivier Rioul , Wei Cheng , Sylvain Guilley

In this paper exact closed-form expressions are derived for the outage probability (OP) in scenarios where both the signal of interest (SOI) and the interfering signals experience {\eta}-{\mu} fading and the background noise can be…

Information Theory · Computer Science 2024-10-30 Jose F. Paris

We show that the problem of analyzing the outage probability in cellular systems affected by co-channel interference and background noise is mathematically equivalent to the problem of analyzing the wireless information-theoretic security…

Information Theory · Computer Science 2016-11-17 Gerardo Gomez , F. Javier Lopez-Martinez , David Morales-Jimenez , Matthew R. McKay

Secrecy issues of free-space optical links realizing information theoretically secure communications as well as high transmission rates are discussed. We numerically study secrecy communication rates of optical wiretap channel based on…

Information Theory · Computer Science 2015-09-15 Hiroyuki Endo , Te Sun Han , Takao Aoki , Masahide Sasaki

This paper is concerned with the general multiple access wiretap channel and the existence of codes that accomplish reliability and strong secrecy. Information leakage to the eavesdropper is assessed by the variational distance metric,…

Information Theory · Computer Science 2020-03-10 Manos Athanasakos , Nicholas Kalouptsidis

An information-theoretic confidential communication is achievable if the eavesdropper has a degraded channel compared to the legitimate receiver. In wireless channels, beamforming and artificial noise can enable such confidentiality.…

Information Theory · Computer Science 2023-12-25 Stefan Roth , Aydin Sezgin

We study the problem of zero-delay coding for the transmission of a Markov source over a noisy channel with feedback and present a reinforcement learning solution which is guaranteed to achieve near-optimality. To this end, we formulate the…

Optimization and Control · Mathematics 2025-10-07 Liam Cregg , Fady Alajaji , Serdar Yuksel

In this paper, we consider the broadcast channel with confidential messages and external eavesdroppers (BCCE), where a multi-antenna base station simultaneously communicates to multiple potentially malicious users, in the presence of…

Information Theory · Computer Science 2013-06-11 Giovanni Geraci , Sarabjot Singh , Jeffrey G. Andrews , Jinhong Yuan , Iain B. Collings

This correspondence studies the secrecy communication of the single-input single-output multi-eavesdropper (SISOME) channel with multiple single-antenna jammers, where the jammers and eavesdroppers are distributed according to the…

Information Theory · Computer Science 2016-11-17 Chao Wang , Hui-Ming Wang

We provide a detailed study of the estimation of probability distributions---discrete and continuous---in a stringent setting in which data is kept private even from the statistician. We give sharp minimax rates of convergence for…

Statistics Theory · Mathematics 2013-05-28 John C. Duchi , Michael I. Jordan , Martin J. Wainwright

In physical-layer security, one of the most fundamental issues is the secrecy capacity. The objective of this paper is to determine the secrecy capacity for an indoor visible light communication system consisting of a transmitter, a…

Information Theory · Computer Science 2021-09-24 Jin-Yuan Wang , Xian-Tao Fu , Jun-Bo Wang , Min Lin , Julian Cheng , Mohamed-Slim Alouini

In this work we consider the problem of releasing a differentially private statistical summary that resides on a Riemannian manifold. We present an extension of the Laplace or K-norm mechanism that utilizes intrinsic distances and volumes…

Statistics Theory · Mathematics 2021-11-09 Matthew Reimherr , Karthik Bharath , Carlos Soto

In this paper, we consider the problem of power allocation in MIMO wiretap channel for secrecy in the presence of multiple eavesdroppers. Perfect knowledge of the destination channel state information (CSI) and only the statistical…

Information Theory · Computer Science 2014-01-16 Sanjay Vishwakarma , A. Chockalingam

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