Compressive Privacy for a Linear Dynamical System

We consider a linear dynamical system in which the state vector consists of both public and private states. One or more sensors make measurements of the state vector and sends information to a fusion center, which performs the final state estimation. To achieve an optimal tradeoff between the utility of estimating the public states and protection of the private states, the measurements at each time step are linearly compressed into a lower dimensional space. Under the centralized setting where all measurements are collected by a single sensor, we propose an optimization problem and an algorithm to find the best compression matrix. Under the decentralized setting where measurements are made separately at multiple sensors, each sensor optimizes its own local compression matrix. We propose methods to separate the overall optimization problem into multiple sub-problems that can be solved locally at each sensor. We consider the cases where there is no message exchange between the sensors; and where each sensor takes turns to transmit messages to the other sensors. Simulations and empirical experiments demonstrate the efficiency of our proposed approach in allowing the fusion center to estimate the public states with good accuracy while preventing it from estimating the private states accurately

Privacy in Inter-Vehicular Networks: Why simple pseudonym change is not enough

Inter-vehicle communication (IVC) systems disclose rich location information about vehicles. State-of-the-art security architectures are aware of the problem and provide privacy enhancing mechanisms, notably pseudonymous authentication. However, the granularity and the amount of location information IVC protocols divulge, enable an adversary that eavesdrops all traffic throughout an area, to reconstruct long traces of the whereabouts of the majority of vehicles within the same area. Our analysis in this paper confirms the existence of this kind of threat. As a result, it is questionable if strong location privacy is achievable in IVC systems against a powerful adversary.\u

Ibeacon based proximity and indoor localization system

User location can be leveraged to provide a wide range of services in a variety of indoor locations including retails stores, hospitals, airports, museums and libraries etc. The widescale proliferation of user devices such as smart phones and the interconnectivity among different entities, powered by Internet of Things (IoT), makes user device-based localization a viable approach to provide Location Based Services (LBS). Location based services can be broadly classified into 1) Proximity based services that provides services based on a rough estimate of users distance to any entity, and 2) Indoor localization that locates a user\u27s exact location in the indoor environment rather than a rough estimate of the distance. The primary requirements of these services are higher energy efficiency, localization accuracy, wide reception range, low cost and availability. Technologies such as WiFi, Radio Frequency Identification (RFID) and Ultra Wideband (UWB) have been used to provide both indoor localization and proximity based services. Since these technologies are not primarily intended for LBS, they do not fulfill the aforementioned requirements. Bluetooth Low Energy (BLE) enabled beacons that use Apple\u27s proprietary iBeacon protocol are mainly intended to provide proximity based services. iBeacons satisfy the energy efficiency, wide reception range and availability requirements of LBS. However, iBeacons are prone to noise due to their reliance on Received Signal Strength Indicator (RSSI), which drastically fluctuates in indoor environments due to interference from different obstructions. This limits its proximity detection accuracy. In this thesis, we present an iBeacon based proximity and indoor localization system. We present our two server-based algorithms to improve the proximity detection accuracy by reducing the variation in the RSSI and using the RSSI-estimated distance, rather than the RSSI itself, for proximity classification. Our algorithms Server-side Running Average and Server-side Kalman Filter improves the proximity detection accuracy by 29% and 32% respectively in contrast to Apple\u27s current approach of using moving average of RSSI values for proximity classification. We utilize a server-based approach because of the greater computing power of servers. Furthermore, server-based approach helps reduce the energy consumption of user device. We describe our cloud based architecture for iBeacon based proximity detection. We also use iBeacons for indoor localization. iBeacons are not primarily intended for indoor localization as their reliance on RSSI makes them unsuitable for accurate indoor localization. To improve the localization accuracy, we use Bayesian filtering algorithms such as Particle Filter (PF), Kalman Filter (KF), and Extended Kalman Filter (EKF). We show that by cascading Kalman Filter and Extended Kalman Filter with Particle Filter, the indoor localization accuracy can be improved by 28% and 33.94% respectively when compared with only using PF. The PF, KFPF and PFEKF algorithm on the server side have average localization error of 1.441 meters, 1.0351 meters and 0.9519 meters respectively