Farhad Farokhi

Privacy-preserving state estimation for linear time-invariant dynamical systems with crowd sensors is considered. At any time step, the estimator has access to measurements from a randomly selected sensor from a pool of sensors with pre-specified models and noise profiles. A Luenberger-like observer is used to fuse the measurements with the underlying model of the system to recursively generate the state estimates. An additive privacy-preserving noise is used to constrain information leakage. Information leakage is measured via mutual information between the identity of the sensors and the state estimate conditioned on the actual state of the system. This captures an omnipotent adversary that not only can access state estimates but can also gather direct high-quality state measurements. Any prescribed level of information leakage is shown to be achievable by appropriately selecting the variance of the privacy-preserving noise. Therefore, privacy-utility trade-off can be fine-tuned.

We use Gaussian mixtures to model formation and evolution of multi-modal beliefs and opinion uncertainty across social networks. In this model, opinions evolve by Bayesian belief update when incorporating exogenous factors (signals from outside sources, e.g., news articles) and by non-Bayesian mixing dynamics when incorporating endogenous factors (interactions across social media). The modeling enables capturing the richness of behavior observed in multi-modal opinion dynamics while maintaining interpretability and simplicity of scalar models. We present preliminary results on opinion formation and uncertainty to investigate the effect of stubborn individuals (as social influencers). This leads to a notion of centrality based on the ease with which an individual can disrupt the flow of information across the social network.

This paper addresses the problem of distributed consensus filtering in a sensor network. An efficient distributed sensor fusion algorithm is crucial for large-scale sensor networks as it minimizes communication resource usage while delivering accurate estimates. To tackle the problem of limited node-to-node connections in a network, we propose a hierarchical and distributed filtering structure comprising two layers. In this regard, all sensing nodes are organized into separate clusters to facilitate the efficient implementation of distributed consensus filtering in bottom layer. Each cluster contains a node that serves as a representative for its cluster. This node transmits the filtered results of its cluster to the top layer, enabling an additional layer of distributed filtering to compute the final filtered value. This study reveals a trade-off between the number of communication links and tracking error, governed by the number of clusters and the underlying graph structures. To achieve the desired balance, we propose an optimization framework to optimally select the number of clusters. The applicability of the present idea is demonstrated by simulation of a sensor network.

This paper presents tight upper and lower bounds for minimum number of samples (copies of a quantum state) required to attain a prescribed accuracy (measured by error variance) for scalar parameters estimation using unbiased estimators under quantum local differential privacy for qubits. Particularly, the best-case (optimal) scenario is considered by minimizing the sample complexity over all differentially-private channels; the worst-case channels can be arbitrarily uninformative and render the problem ill-defined. In the small privacy budget regime, i.e., 1, the sample complexity scales as (-2). This bound matches that of classical parameter estimation under local differential privacy. The lower bound however loosens in the large privacy budget regime, i.e., 1. The upper bound for the minimum number of samples is generalized to qudits (with dimension d) resulting in sample complexity of O(d-2).

An individual's opinion concerning political bias in the media is shaped by exogenous factors (independent analysis of media outputs) and endogenous factors (social activity, e.g. peer pressure by political allies and opponents in a network). Previous numerical studies show, that persuadable agents in allies-only networks are disrupted from asymptotically learning the intrinsic bias of a media organization, when the network is populated by one or more obdurate agents (partisans), who are not persuadable themselves but exert peer pressure on other agents. Some persuadable agents asymptotically learn a false bias, while others vacillate indefinitely between a false bias and the true bias, a phenomenon called turbulent nonconvergence which also emerges in opponents-only and mixed networks without partisans. Here we derive an analytic instability condition, which demarcates turbulent nonconvergence from asymptotic learning as a function of key network properties, for an idealized model of media bias featuring a biased coin. The condition is verified with Monte Carlo simulations as a function of network size, sparsity, and partisan fraction. It is derived in a probabilistic framework, where an agent's opinion is uncertain and is described by a probability density function, which is multimodal in general, generalizing previous studies which assume that an agent's opinion is certain (i.e. described by one number). The results and their social implications are interpreted briefly in terms of the social science theory of structural balance.

Barycentric and pairwise quantum Rényi leakages are proposed as two measures of information leakage for privacy and security analysis in quantum computing and communication systems. These quantities both require minimal assumptions on the eavesdropper, i.e. they do not make any assumptions on the eavesdropper’s attack strategy or the statistical prior on the secret or private classical data encoded in the quantum system. They also satisfy important properties of positivity, independence, post-processing inequality and unitary invariance. The barycentric quantum Rényi leakage can be computed by solving a semi-definite program; the pairwise quantum Rényi leakage possesses an explicit formula. The barycentric and pairwise quantum Rényi leakages form upper bounds on the maximal quantum leakage, the sandwiched quantum α -mutual information, the accessible information and the Holevo’s information. Furthermore, differentially private quantum channels are shown to bound these measures of information leakage. Global and local depolarizing channels, that are common models of noise in quantum computing and communication, restrict private or secure information leakage. Finally, a privacy-utility trade-off formula in quantum machine learning using variational circuits is developed. The privacy guarantees can only be strengthened, i.e. information leakage can only be reduced, if the performance degradation grows larger and vice versa .

Optimal encoding of classical data for statistical inference using quantum computing is investigated. A universal encoder is sought that is optimal for a wide array of statistical inference tasks. Accuracy of any statistical inference is shown to be upper bounded by a term that is proportional to maximal quantum leakage from the classical data, i.e., the input to the inference model, through its quantum encoding. This demonstrates that the maximal quantum leakage is a universal measure of the quality of the encoding strategy for statistical inference as it only depends on the quantum encoding of the data and not the inference task itself. The optimal universal encoding strategy, i.e., the encoding strategy that maximizes the maximal quantum leakage, is proved to be attained by pure states. When there are enough qubits, basis encoding is proved to be universally optimal. An iterative method for numerically computing the optimal universal encoding strategy is presented.

An alternative measure of information leakage for quantum encoding of classical data is defined. An adversary can access a single copy of the state of a quantum system that encodes some classical data and is interested in correctly guessing a general randomized or deterministic function of the data (e.g., a specific feature or attribute of the data in quantum machine learning) that is unknown to the security analyst. The resulting measure of information leakage, referred to as maximal quantum leakage, is the multiplicative increase of the probability of correctly guessing any function of the classical data upon observing measurements of the quantum state. Maximal quantum leakage is shown to satisfy the postprocessing inequality (i.e., applying a quantum channel reduces information leakage) and independence property (i.e., leakage is zero if the quantum state is independent of the classical data), which are fundamental properties required for privacy and security analysis. It also bounds accessible information. Effects of global and local depolarizing noise models on the maximal quantum leakage are established.