Results 1  10
of
24
Statistical Measurement of Information Leakage
"... Abstract. Information theory provides a range of useful methods to analyse probability distributions and these techniques have been successfully applied to measure information flow and the loss of anonymity in secure systems. However, previous work has tended to assume that the exact probabilities o ..."
Abstract

Cited by 16 (4 self)
 Add to MetaCart
(Show Context)
Abstract. Information theory provides a range of useful methods to analyse probability distributions and these techniques have been successfully applied to measure information flow and the loss of anonymity in secure systems. However, previous work has tended to assume that the exact probabilities of every action are known, or that the system is nondeterministic. In this paper, we show that measures of information leakage based on mutual information and capacity can be calculated, automatically, from trial runs of a system alone. We find a confidence interval for this estimate based on the number of possible inputs, observations and samples. We have developed a tool to automatically perform this analysis and we demonstrate our method by analysing a Mixminon anonymous remailer node. 1
Information Geometric Formulation and Interpretation of Accelerated BlahutArimototype Algorithms
 IEEE International Workshop on Information Theory, 24–29 Oct
, 2004
"... Abstract — We propose two related classes of iterative algorithms for computing the capacity of discrete memoryless channels. The celebrated BlahutArimoto algorithm is a special case of our framework. The formulation of these algorithms is based on the natural gradient and proximal point methods. W ..."
Abstract

Cited by 14 (0 self)
 Add to MetaCart
(Show Context)
Abstract — We propose two related classes of iterative algorithms for computing the capacity of discrete memoryless channels. The celebrated BlahutArimoto algorithm is a special case of our framework. The formulation of these algorithms is based on the natural gradient and proximal point methods. We also provide interpretations in terms of notions from information geometry. A theoretical convergence analysis and simulation results demonstrate that our new algorithms have the potential to significantly outperform the BlahutArimoto algorithm in terms of convergence speed.
Extension of the Blahut–Arimoto Algorithm for Maximizing Directed Information
"... Abstract—In this paper, we extend the Blahut–Arimoto algorithm for maximizing Massey’s directed information. The algorithm can be used for estimating the capacity of channels with delayed feedback, where the feedback is a deterministic function of the output. In order to maximize the directed inform ..."
Abstract

Cited by 8 (5 self)
 Add to MetaCart
(Show Context)
Abstract—In this paper, we extend the Blahut–Arimoto algorithm for maximizing Massey’s directed information. The algorithm can be used for estimating the capacity of channels with delayed feedback, where the feedback is a deterministic function of the output. In order to maximize the directed information, we apply the ideas from the regular Blahut–Arimoto algorithm, i.e., the alternating maximization procedure, to our new problem. We provide both upper and lower bound sequences that converge to the optimum global value. Our main insight in this paper is that in order to find the maximum of the directed information over a causal conditioning probability mass function, one can use a backward index time maximization combined with the alternating maximization procedure. We give a detailed description of the algorithm, showing its complexity and the memory needed, and present several numerical examples. Index Terms—Alternating maximization procedure, backward index time maximization, Blahut–Arimoto algorithm, causal conditioning, channels with feedback, directed information, finitestate channels (FSCs), Ising channel, trapdoor channel. I.
On the fading paper achievable region of the fading MIMO broadcast channel
 IEEE Trans. Inform. Theory
, 2008
"... ..."
(Show Context)
On the Continuity of Achievable Rate Regions for Source Coding over Networks
"... Abstract — The continuity property of achievable rate regions for source coding over networks is considered. We show ratedistortion regions are continuous with respect to distortion vectors. Then we focus on the continuity of lossless rate regions with respect to source distribution: First, the proo ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
(Show Context)
Abstract — The continuity property of achievable rate regions for source coding over networks is considered. We show ratedistortion regions are continuous with respect to distortion vectors. Then we focus on the continuity of lossless rate regions with respect to source distribution: First, the proof of continuity for general networks with independent sources is given; then, for the case of dependent sources, continuity is proven both in examples where oneletter characterizations are known and in examples where oneletter characterizations are not known; the proofs in the latter case rely on the concavity of the rate regions for those networks. I.
Data Processing Bounds for Scalar Lossy Source Codes with Side Information at the Decoder ∗
, 2012
"... In this paper, we introduce new lower bounds on the distortion of scalar fixedrate codes for lossy compression with side information available at the receiver. These bounds are derived by presenting the relevant random variables as a Markov chain and applying generalized data processing inequalities ..."
Abstract

Cited by 3 (2 self)
 Add to MetaCart
(Show Context)
In this paper, we introduce new lower bounds on the distortion of scalar fixedrate codes for lossy compression with side information available at the receiver. These bounds are derived by presenting the relevant random variables as a Markov chain and applying generalized data processing inequalities a la Ziv and Zakai. We show that by replacing the logarithmic function with other functions, in the data processing theorem we formulate, we obtain new lower bounds on the distortion of scalar coding with side information at the decoder. These bounds are shown to be better than one can obtain from the WynerZiv ratedistortion function.
Information Embedding Codes on Graphs with Iterative Encoding and Decoding
"... Abstract — We show that linear complexity capacityapproaching information embedding codes exist for information embedding problems. Specifically, we introduce the doubleerasure information embedding channel model, and show that in at least some parameter regimes one can achieve rates arbitrarily clo ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
(Show Context)
Abstract — We show that linear complexity capacityapproaching information embedding codes exist for information embedding problems. Specifically, we introduce the doubleerasure information embedding channel model, and show that in at least some parameter regimes one can achieve rates arbitrarily close to capacity using suitably defined codes on graphs. Furthermore, we show that both encoding and decoding can be implemented with linear complexity by exploiting belief propagation techniques. I.
Calculating Probabilistic Anonymity from Sampled Data
"... This paper addresses the problem of calculating the anonymity of a system statistically from a number of trial runs. We show that measures of anonymity based on capacity can be estimated, by showing that the BlahutArimoto algorithm converges for sampled data. We obtain bounds on the error of the es ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
This paper addresses the problem of calculating the anonymity of a system statistically from a number of trial runs. We show that measures of anonymity based on capacity can be estimated, by showing that the BlahutArimoto algorithm converges for sampled data. We obtain bounds on the error of the estimated value by calculating the distribution of mutual information when one distribution is known and one unknown. This leads to finding the variance of the estimation of anonymity in terms of the numbers of samples, inputs and possible observations, which in turn tells us what kinds of systems can and cannot be accurately analysed using a statistical approach. We demonstrate our method on an implementation of the Dining Cryptographers protocol and on a Mixminion anonymous remailer node. 1.
Data Processing Lower Bounds for Scalar Lossy Source Codes with Side Information at the Decoder
"... Abstract—In this paper, we derive lower bounds on the distortion of scalar fixedrate codes for lossy compression with side information available at the receiver. These bounds are derived by presenting the relevant random variables as a Markov chain and applying generalized data processing inequalit ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
(Show Context)
Abstract—In this paper, we derive lower bounds on the distortion of scalar fixedrate codes for lossy compression with side information available at the receiver. These bounds are derived by presenting the relevant random variables as a Markov chain and applying generalized data processing inequalities a la Ziv and Zakai. I.
Channel coding and source coding with increased partial side information
 in Communication, Control, and Computing (Allerton), 2010 48th Annual Allerton Conference on
"... ar ..."
(Show Context)