Abstract (WSN) using encrypted non-binary quantized data is studied. In a WSN, sensors transmit their observations to a fusion center through a wireless medium where the observations are susceptible to unauthorized eavesdropping. Encryption approaches for WSNs with fixed threshold binary quantization were previously explored. However, fixed threshold binary quantization limits parameter estimation to scalar parameters. In this paper, we propose a stochastic encryption approach for WSNs that can operate on non-binary quantized observations and has the capability for vector parameter estimation. We extend a binary stochastic encryption approach proposed previously, to a nonbinary generalized case. Sensor outputs are quantized using a quantizer with R + 1 levels, where R in {1.2. 3 ...}, encrypted by flipping them with certain flipping probabilities, and then transmitted. Optimal estimators using maximum-likelihood estimation are derived for both a legitimate fusion center (LFC) and a third party fusion center (TPFC) perspectives. We assume the TPFC is unaware of the encryption. Asymptotic analysis of the estimators is performed by deriving the Cramer-Rao lower bound for LFC estimation, and the asymptotic bias and variance for TPFC estimation. Numerical results validating the asymptotic analysis are presented.
more »
« less
On the estimation and secrecy capabilities of stochastic encryption for parameter estimation in IoT
In Internet of Things (IoT) applications requiring parameter estimation, sensors often transmit quantized observations to a fusion center through a wireless medium where the observations are susceptible to unauthorized eavesdropping. The fusion center uses the received data to estimate desired parameters. To provide security to such networks, some low complexity encryption approaches have been proposed. In this paper, we generalize those approaches and present an analysis of their estimation and secrecy capabilities. We show that the dimension of the unknown parameter that can be efficiently estimated using an unbiased estimator when using these approaches, is upper bounded. Assuming that an unauthorized eavesdropper is aware of the low complexity encryption process but is unaware of the encryption key, we show successful eavesdropping, even with a large number of observations, is impossible with unbiased estimators and independent observations for these approaches. Numerical results validating our analysis are presented.
more »
« less
- Award ID(s):
- 1702555
- NSF-PAR ID:
- 10084718
- Date Published:
- Journal Name:
- Conference on Information Sciences and Systems
- Page Range / eLocation ID:
- 1 to 6
- Format(s):
- Medium: X
- Sponsoring Org:
- National Science Foundation
More Like this
-
-
Logic encryption, a method to lock a circuit from unauthorized use unless the correct key is provided, is the most important technique in hardware IP protection. However, with the discovery of the SAT attack, all traditional logic encryption algorithms are broken. New algorithms after the SAT attack are all vulnerable to structural analysis unless a provable obfuscation is applied to the locked circuit. But there is no provable logic obfuscation available, in spite of some vague resorting to logic resynthesis. In this paper, we formulate and discuss a trilemma in logic encryption among locking robustness, structural security, and encryption efficiency, showing that pre-SAT approaches achieve only structural security and encryption efficiency, and post-SAT approaches achieve only locking robustness and encryption efficiency. There is also a dilemma between query complexity and error number in locking. We first develop a theory and solution to the dilemma in locking between query complexity and error number. Then, we provide a provable obfuscation solution to the dilemma between structural security and locking robustness. We finally present and discuss some results towards the resolution of the trilemma in logic encryption.more » « less
-
null (Ed.)Abstract One of the classical approaches for estimating the frequencies and damping factors in a spectrally sparse signal is the MUltiple SIgnal Classification (MUSIC) algorithm, which exploits the low-rank structure of an autocorrelation matrix. Low-rank matrices have also received considerable attention recently in the context of optimization algorithms with partial observations, and nuclear norm minimization (NNM) has been widely used as a popular heuristic of rank minimization for low-rank matrix recovery problems. On the other hand, it has been shown that NNM can be viewed as a special case of atomic norm minimization (ANM), which has achieved great success in solving line spectrum estimation problems. However, as far as we know, the general ANM (not NNM) considered in many existing works can only handle frequency estimation in undamped sinusoids. In this work, we aim to fill this gap and deal with damped spectrally sparse signal recovery problems. In particular, inspired by the dual analysis used in ANM, we offer a novel optimization-based perspective on the classical MUSIC algorithm and propose an algorithm for spectral estimation that involves searching for the peaks of the dual polynomial corresponding to a certain NNM problem, and we show that this algorithm is in fact equivalent to MUSIC itself. Building on this connection, we also extend the classical MUSIC algorithm to the missing data case. We provide exact recovery guarantees for our proposed algorithms and quantify how the sample complexity depends on the true spectral parameters. In particular, we provide a parameter-specific recovery bound for low-rank matrix recovery of jointly sparse signals rather than use certain incoherence properties as in existing literature. Simulation results also indicate that the proposed algorithms significantly outperform some relevant existing methods (e.g., ANM) in frequency estimation of damped exponentials.more » « less
-
In large-scale wireless sensor networks, sensor-processor elements (nodes) are densely deployed to monitor the environment; consequently, their observations form a random field that is highly correlated in space.We consider a fusion sensor-network architecture where, due to the bandwidth and energy constraints, the nodes transmit quantized data to a fusion center. The fusion center provides feedback by broadcasting summary information to the nodes. In addition to saving energy, this feedback ensures reliability and robustness to node and fusion-center failures. We assume that the sensor observations follow a linear-regression model with known spatial covariances between any two locations within a region of interest. We propose a Bayesian framework for adaptive quantization, fusion-center feedback, and estimation of the random field and its parameters. We also derive a simple suboptimal scheme for estimating the unknown parameters, apply our estimation approach to the no-feedback scenario, discuss field prediction at arbitrary locations within the region of interest, and present numerical examples demonstrating the performance of the proposed methods.more » « less
-
more » « less
Abstract Novel observation techniques (e.g., smart tracers) for characterizing coupled hydrological and biogeochemical processes are improving understanding of stream network transport and transformation dynamics. In turn, these observations are thought to enable increasingly sophisticated representations within transient storage models (TSMs). However, TSM parameter estimation is prone to issues with insensitivity and equifinality, which grow as parameters are added to model formulations. Currently, it is unclear whether (or not) observations from different tracers may lead to greater process inference and reduced parameter uncertainty in the context of TSM. Herein, we aim to unravel the role of in‐stream processes alongside metabolically active (MATS) and inactive storage zones (MITS) using variable TSM formulations. Models with one (1SZ) and two storage zones (2SZ) and with and without reactivity were applied to simulate conservative and smart tracer observations obtained experimentally for two reaches with differing morphologies. As we show, smart tracers are unsurprisingly superior to conservative tracers when it comes to partitioning MITS and MATS. However, when transient storage is lumped within a 1SZ formulation, little improvement in parameter uncertainty is gained by using a smart tracer, suggesting the addition of observations should scale with model complexity. Importantly, our work identifies several inconsistencies and open questions related to reconciling time scales of tracer observation with conceptual processes (parameters) estimated within TSM. Approaching TSM with multiple models and tracer observations may be key to gaining improved insight into transient storage simulation as well as advancing feedback loops between models and observations within hydrologic science.
- Free Publicly Accessible Full Text
-
Accepted Manuscript1.0
- Conference Paper:
- https://doi.org/10.1109/CISS.2018.8362293
