English
Related papers

Related papers: Studying Maximum Information Leakage Using Karush-…

200 papers

We present an algorithm for learning parametric constraints from locally-optimal demonstrations, where the cost function being optimized is uncertain to the learner. Our method uses the Karush-Kuhn-Tucker (KKT) optimality conditions of the…

Robotics · Computer Science 2020-01-28 Glen Chou , Necmiye Ozay , Dmitry Berenson

We consider a worst-case asymmetric distributed source coding problem where an information sink communicates with $N$ correlated information sources to gather their data. A data-vector $\bar{x} = (x_1, ..., x_N) \sim {\mathcal P}$ is…

Information Theory · Computer Science 2013-01-03 Samar Agnihotri , Rajesh Venkatachalapathy

In this work we derive a number of chain rules for mutual information quantities, suitable for analyzing quantum cryptography with imperfect devices that leak additional information to an adversary. First, we derive a chain rule between…

Quantum Physics · Physics 2024-12-10 Amir Arqand , Tony Metger , Ernest Y. -Z. Tan

The amount of information transmissible through a communications channel is determined by the noise characteristics of the channel and by the quantities of available transmission resources. In classical information theory, the amount of…

Quantum Physics · Physics 2009-11-10 Mikio Fujiwara , Masahiro Takeoka , Jun Mizuno , Masahide Sasaki

It has been shown recently that the use of two pairs of resistors with enhanced Johnson-noise and a Kirchhoff-loop-i.e., a Kirchhoff-Law-Johnson-Noise (KLJN) protocol-for secure key distribution leads to information theoretic security…

Emerging Technologies · Computer Science 2016-11-17 R. Mingesz , L. B. Kish , Z. Gingl , C. G. Granqvist , H. Wen , F. Peper , T. Eubank , G. Schmera

The security of the Kirchhoff-law-Johnson-(like)-noise (KLJN) key exchange system is based on the Fluctuation-Dissipation-Theorem of classical statistical physics. Similarly to quantum key distribution, in practical situations, due to the…

Emerging Technologies · Computer Science 2015-11-23 Hsien-Pu Chen , Elias Gonzalez , Yessica Saez , Laszlo B. Kish

In communications, unknown variables are usually modelled as random variables, and concepts such as independence, entropy and information are defined in terms of the underlying probability distributions. In contrast, control theory often…

Systems and Control · Computer Science 2014-01-14 Girish N. Nair

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

We introduce the study of information leakage through \emph{guesswork}, the minimum expected number of guesses required to guess a random variable. In particular, we define \emph{maximal guesswork leakage} as the multiplicative decrease,…

Information Theory · Computer Science 2024-05-07 Gowtham R. Kurri , Malhar Managoli , Vinod M. Prabhakaran

The main theme of this thesis is the development of computational methods for classes of infinite-dimensional optimization problems arising in optimal control and information theory. The first part of the thesis is concerned with the…

Optimization and Control · Mathematics 2017-12-14 Tobias Sutter

In Ref. [1], we proved a duality between two optimizations problems. The primary one is, given two quantum channels M and N, to find a quantum channel R such that RN is optimally close to M as measured by the worst-case entanglement…

Quantum Physics · Physics 2011-08-26 Cédric Bény , Ognyan Oreshkov

Matrix completion is a fundamental problem that comes up in a variety of applications like the Netflix problem, collaborative filtering, computer vision, and crowdsourcing. The goal of the problem is to recover a k-by-n unknown matrix from…

Information Theory · Computer Science 2014-02-19 Changho Suh

Characterizing the capacity region of multi-source wireless relay networks is one of the fundamental issues in network information theory. The problem is, however, quite challenging due to inter-user interference when there exist multiple…

Information Theory · Computer Science 2013-10-29 Sang-Woon Jeon , Sae-Young Chung

This article argues that the Situation theory and the Channel theory can be used as a general framework for Imperfect Information Management. Different kinds of imperfections are uncertainty, imprecision, vagueness, incompleteness,…

Logic in Computer Science · Computer Science 2022-06-07 Farhad Naderian

This paper presents an information theory based detection framework for covert channels. We first show that the usual notion of interference does not characterize the notion of deliberate information flow of covert channels. We then show…

Cryptography and Security · Computer Science 2011-03-01 Loïc Hélouët , Aline Roumy

An attacker can gain information of a user by analyzing its network traffic. The size of transferred data leaks information about the file being transferred or the service being used, and this is particularly revealing when the attacker has…

Cryptography and Security · Computer Science 2022-09-12 Sebastian Simon , Cezara Petrui , Carlos Pinzón , Catuscia Palamidessi

We study the information-theoretic limit of reliable information processing by a server with queue-length dependent quality of service. We define the capacity for such a system as the number of bits reliably processed per unit time, and…

Information Theory · Computer Science 2016-03-08 Avhishek Chatterjee , Daewon Seo , Lav R. Varshney

Information transfer through electromagnetic waves is an important problem that touches a variety of technologically relevant applications, including computing and telecommunications. Prior attempts to establish limits on optical…

While information theory has been introduced to characterize the fundamental limitations of control and filtering for a few decades, the existing information-theoretic methods are indirect and cumbersome for analyzing the limitations of…

Information Theory · Computer Science 2026-02-03 Neng Wan , Dapeng Li , Naira Hovakimyan

Partial calmness is a celebrated but restrictive property of bilevel optimization problems whose presence opens a way to the derivation of Karush--Kuhn--Tucker-type necessary optimality conditions in order to characterize local minimizers.…

Optimization and Control · Mathematics 2020-06-30 Patrick Mehlitz , Leonid I. Minchenko , Alain B. Zemkoho