116 research outputs found
Studying Maximum Information Leakage Using Karush-Kuhn-Tucker Conditions
When studying the information leakage in programs or protocols, a natural
question arises: "what is the worst case scenario?". This problem of
identifying the maximal leakage can be seen as a channel capacity problem in
the information theoretical sense. In this paper, by combining two powerful
theories: Information Theory and Karush-Kuhn-Tucker conditions, we demonstrate
a very general solution to the channel capacity problem. Examples are given to
show how our solution can be applied to practical contexts of programs and
anonymity protocols, and how this solution generalizes previous approaches to
this problem
Spatially Selective Artificial-Noise Aided Transmit Optimization for MISO Multi-Eves Secrecy Rate Maximization
Consider an MISO channel overheard by multiple eavesdroppers. Our goal is to
design an artificial noise (AN)-aided transmit strategy, such that the
achievable secrecy rate is maximized subject to the sum power constraint.
AN-aided secure transmission has recently been found to be a promising approach
for blocking eavesdropping attempts. In many existing studies, the confidential
information transmit covariance and the AN covariance are not simultaneously
optimized. In particular, for design convenience, it is common to prefix the AN
covariance as a specific kind of spatially isotropic covariance. This paper
considers joint optimization of the transmit and AN covariances for secrecy
rate maximization (SRM), with a design flexibility that the AN can take any
spatial pattern. Hence, the proposed design has potential in jamming the
eavesdroppers more effectively, based upon the channel state information (CSI).
We derive an optimization approach to the SRM problem through both analysis and
convex conic optimization machinery. We show that the SRM problem can be recast
as a single-variable optimization problem, and that resultant problem can be
efficiently handled by solving a sequence of semidefinite programs. Our
framework deals with a general setup of multiple multi-antenna eavesdroppers,
and can cater for additional constraints arising from specific application
scenarios, such as interference temperature constraints in interference
networks. We also generalize the framework to an imperfect CSI case where a
worst-case robust SRM formulation is considered. A suboptimal but safe solution
to the outage-constrained robust SRM design is also investigated. Simulation
results show that the proposed AN-aided SRM design yields significant secrecy
rate gains over an optimal no-AN design and the isotropic AN design, especially
when there are more eavesdroppers.Comment: To appear in IEEE Trans. Signal Process., 201
Improving Frequency Estimation under Local Differential Privacy
Local Differential Privacy protocols are stochastic protocols used in data
aggregation when individual users do not trust the data aggregator with their
private data. In such protocols there is a fundamental tradeoff between user
privacy and aggregator utility. In the setting of frequency estimation,
established bounds on this tradeoff are either nonquantitative, or far from
what is known to be attainable. In this paper, we use information-theoretical
methods to significantly improve established bounds. We also show that the new
bounds are attainable for binary inputs. Furthermore, our methods lead to
improved frequency estimators, which we experimentally show to outperform
state-of-the-art methods
- …