The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
In this paper, we consider the identity testing problems in the distributed setting, in which each terminal has data only relates to one random variable. Each terminal sends zero-rate message to the decision maker, and the decision maker decides the distribution of (Xn, Yn), which is indirectly revealed from the encoded messages, is the same as or λ-far from a given distribution. Interpreting this...
In this paper, the problem of identifying correlated components in a high-dimensional Gaussian vector is considered. In the setup considered, instead of having to take a full-vector observation at each time index, the observer is allowed to observe any subset or full set of components in the vector, and he has the freedom to design his sampling strategies over time. The observer aims to find an optimal...
We consider problems where one wishes to represent a parameter associated with a signal source - subject to a certain rate and distortion - based on the observation of a number of realizations of the source signal. By reducing these indirect vector quantization problems to a standard vector quantization one, we provide a bound to the fundamental interplay between the rate and distortion in the large-rate...
In this paper, we study the randomized distributed coordinate descent algorithm with quantized updates. In the literature, the iteration complexity of the randomized distributed coordinate descent algorithm has been characterized under the assumption that machines can exchange updates with an infinite precision. We consider a practical scenario in which the messages exchange occurs over channels with...
In this paper, we analyze the sum-rate capacity of Poisson multiple access channels (MAC) when each transmitter has multiple antennas. By converting a non-convex optimization problem with a large number of variables into a non-convex optimization problem with 2 variables, we show that the sum-rate capacity of the Poisson MAC with multiple transmit antennas is equivalent to a properly constructed Poisson...
The discrete memoryless Z-Channel with a confidential message and a cooperative receiver (DM-ZC-CMCR) is considered. A noiseless one-sided rate-limited cooperation link exists between the two receivers. The secrecy level is measured by the equivocation rate. An outer bound on the secrecy-capacity-region DM-ZC-CMCR is derived. An achievable secrecy-rate region is proposed. The secrecy-sum capacity...
In this paper, decentralized change point detection problem with optional observations at the fusion center is considered. In the model considered, there are two sensors: a peripheral sensor and a coordinating sensor. At each time, the peripheral sensor decides whether to stop and send an alarm to the coordinating sensor or to continue making observations. Once the coordinating sensor receives an...
We consider the problem of keyless message authentication over noisy channels in the presence of an active adversary. Different from the existing models, in our model, the legitimate users do not have any pre-shared key for authentication. Instead, we use the noisy channel connecting the legitimate users for authentication. The main idea is to utilize the noisy channel connecting the legitimate users...
In this paper, the problem of simultaneously generating multiple keys in a model where the key generating parties have restricted access to public discussions is considered. The model consists of four terminals, i.e., Alice, Bob, Carol and Eve. Alice and Bob are connected via a noiseless channel while Bob connects with Carol and Eve via a wiretap channel. There is no direct link connecting Alice with...
The discrete memoryless Z-Channel (DM-ZC) with a confidential cross-message is considered. Three messages are transmitted; encoder 1 transmits one message to be decoded by decoder 1. Encoder 2 transmits two messages, the first of them is to be decoded by decoder 2; the second message is to be decoded by decoder 1 and is required to be kept secret from decoder 2. The secrecy level is measured by the...
In this paper, the problem of simultaneously generating multiple keys over a cascade of a noiseless channel and a wiretap channel is considered. The problem consists of three legitimate parties, i.e., Alice, Bob and Carol, where Alice and Bob wish to agree with Carol on independent secret keys. Alice and Bob are connected via a noiseless channel, and Bob is connected with Carol via a wiretap channel,...
A K-receiver degraded broadcast channel with secrecy outside a bounded range is studied, in which a transmitter sends K messages respectively to K receivers, and the channel quality gradually degrades from receiver K to receiver 1. Each receiver k is required to decode messages W1, …, Wk, for 1 ≤ k ≤ K. Furthermore, each message Wk should be kept secure from receivers with two-level worse channel...
In this paper, we characterize the sum-rate capacity of the non-symmetric Poisson multiple access channel (MAC). While the sum-rate capacity of the symmetric Poisson MAC has been characterized in the literature, the special property exploited in the existing method for the symmetric case does not hold for the non-symmetric channel anymore. We obtain the optimal input that achieves the sum-rate capacity...
An information theoretic framework is established to analyze the performance of biometric security systems. Two performance metrics, namely privacy, measured by the normalized equivocation rate of the biometric measurements, and security, measured by the rate of the key generated from the biometric measurements, are first defined. A fundamental tradeoff between these two metrics is then identified...
In this paper, we consider the problem of quickly detecting an abrupt change of linear coefficients in linear regression models. In particular, the observer sequentially observes a sequence of observations {(xn, yn)}∞n=1, which is assumed to obey a linear regression model at each time slot n. Some of the coefficients in the linear model change at a fixed but unknown time t. The post-change linear...
In this paper, Bayesian quickest change-point detection problem with incomplete post-change information is considered. In particular, the observer knows that the post-change distribution belongs to a parametric distribution family, but he does not know the true value of the post-change parameter. Two problem formulations are considered in this paper. In the first formulation, we assume no additional...
Characterizing the phase transitions of convex optimizations in recovering structured signals or data is of central importance in compressed sensing, machine learning and statistics. The phase transitions of many convex optimization signal recovery methods such as ℓ1 minimization and nuclear norm minimization are well understood through recent years' research. However, rigorously characterizing the...
The goal of message authentication is to ensure that an accepted message truly comes from its acclaimed transmitter. It has wide applications in ecommerce and other areas. For example, when a stock broker receives a trading instruction for an account, he or she needs to verify that it is the owner of the account, and not someone else, who sends the instruction.
Motivated by distributed inference over big datasets problems, we study multi-terminal distributed hypothesis testing problems in which each terminal has data related to only one random variable. Due to the restriction of one-shot communication, we consider the distributed testing against independence problem when interaction among the encoders are allowed. Subject to type 1 error probability and...
In this paper, the problem of detecting correlated components in a p-dimensional Gaussian vector is considered. In the setup considered, s unknown components are correlated with a known covariance structure. Hence, there are equation possible hypotheses for the unknown set of correlated components. Instead of taking a full-vector observation at each time index, in this paper we assume that the observer...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.