By Kejia Zhang PowerSpy: Location Tracking using Mobile Device Power Analysis Yan Michalevsky, Aaron Schulman, etc. Stanford University Published in USENIX.

Slides:



Advertisements
Similar presentations
David Rosen Goals  Overview of some of the big ideas in autonomous systems  Theme: Dynamical and stochastic systems lie at the intersection of mathematics.
Advertisements

State Estimation and Kalman Filtering CS B659 Spring 2013 Kris Hauser.
Word Spotting DTW.
Hidden Markov Models (1)  Brief review of discrete time finite Markov Chain  Hidden Markov Model  Examples of HMM in Bioinformatics  Estimations Basic.
1 Video Processing Lecture on the image part (8+9) Automatic Perception Volker Krüger Aalborg Media Lab Aalborg University Copenhagen
1 The Monte Carlo method. 2 (0,0) (1,1) (-1,-1) (-1,1) (1,-1) 1 Z= 1 If  X 2 +Y 2  1 0 o/w (X,Y) is a point chosen uniformly at random in a 2  2 square.
Using Probabilistic Methods for Localization in Wireless Networks Presented by Adam Kariv May, 2005.
Traffic signal schedule information : unavailable Drivers : Accelerate, decelerate, and undergo a complete halt Causes increased fuel consumption, air.
1 Profile Hidden Markov Models For Protein Structure Prediction Colin Cherry
Hidden Markov Models: Applications in Bioinformatics Gleb Haynatzki, Ph.D. Creighton University March 31, 2003.
BAYESIAN INFERENCE Sampling techniques
Critical Analysis Presentation: T-Drive: Driving Directions based on Taxi Trajectories Authors of Paper: Jing Yuan, Yu Zheng, Chengyang Zhang, Weilei Xie,
Tracking Fine-grain Vehicular Speed Variations by Warping Mobile Phone Signal Strengths Presented by Tam Vu Gayathri Chandrasekaran*, Tam Vu*, Alexander.
T-Drive : Driving Directions Based on Taxi Trajectories Microsoft Research Asia University of North Texas Jing Yuan, Yu Zheng, Chengyang Zhang, Xing Xie,
Models and Security Requirements for IDS. Overview The system and attack model Security requirements for IDS –Sensitivity –Detection Analysis methodology.
Autonomous Robot Navigation Panos Trahanias ΗΥ475 Fall 2007.
Digital Data Transmission ECE 457 Spring Information Representation Communication systems convert information into a form suitable for transmission.
Computational statistics 2009 Random walk. Computational statistics 2009 Random walk with absorbing barrier.
Practical Techniques for Searches on Encrypted Data Author: Dawn Xiaodong Song, David Wagner, Adrian Perrig Presenter: 紀銘偉.
Distributed Cluster Repair for OceanStore Irena Nadjakova and Arindam Chakrabarti Acknowledgements: Hakim Weatherspoon John Kubiatowicz.
Hidden Markov Models K 1 … 2. Outline Hidden Markov Models – Formalism The Three Basic Problems of HMMs Solutions Applications of HMMs for Automatic Speech.
Metamorphic Malware Research
Lecture 9 Hidden Markov Models BioE 480 Sept 21, 2004.
1 Hybrid Agent-Based Modeling: Architectures,Analyses and Applications (Stage One) Li, Hailin.
Computer vision: models, learning and inference Chapter 10 Graphical Models.
Sampling Distributions
Dynamic Time Warping Applications and Derivation
Hidden Markov Model Continues …. Finite State Markov Chain A discrete time stochastic process, consisting of a domain D of m states {1,…,m} and 1.An m.
Hand Signals Recognition from Video Using 3D Motion Capture Archive Tai-Peng Tian Stan Sclaroff Computer Science Department B OSTON U NIVERSITY I. Introduction.
How confident are we that our sample means make sense? Confidence intervals.
Algorithms behind Global Positioning Murray Grace Josh Collins.
Rutgers: Gayathri Chandrasekaran, Tam Vu, Marco Gruteser, Rich Martin,
Bayesian Filtering for Robot Localization
Package Transportation Scheduling Albert Lee Robert Z. Lee.
Arvind Thiagarajan, Lenin Ravindranath, Katrina LaCurts, Sivan Toledo,Jakob Eriksson, Samuel Madden, Hari Balakrishnan. VTrack: Accurate, Energy-aware.
Sensys 2009 Speaker:Lawrence.  Introduction  Overview & Challenges  Algorithm  Travel Time Estimation  Evaluation  Conclusion.
Introduction to Automatic Speech Recognition
Towards a Scalable and Secure VoIP Infrastructure Towards a Scalable and Secure VoIP Infrastructure Lab for Advanced Networking Systems Director: David.
Particle Filtering in Network Tomography
Computer vision: models, learning and inference Chapter 19 Temporal models.
Hidden Markov Models for Sequence Analysis 4
Stochastic Algorithms Some of the fastest known algorithms for certain tasks rely on chance Stochastic/Randomized Algorithms Two common variations – Monte.
Wen He Tsinhua University, Beijing, China and Xi'an Communication Institute, Xi'an, China Deyi Li Tsinhua University, Beijing, China and Chinese.
Demo. Overview Overall the project has two main goals: 1) Develop a method to use sensor data to determine behavior probability. 2) Use the behavior probability.
SMART CAR Natural User Interface Technology CAR CUSTOMIZATION BY USER RECOGNITION.
Dynamic Programming.
Managing Handoff. For operations and management to detect and isolating Handoff being particularly challenging, therefore it is important to understand.
Particle Filters for Shape Correspondence Presenter: Jingting Zeng.
Motif finding with Gibbs sampling CS 466 Saurabh Sinha.
Who Is Peeping at Your Passwords at Starbucks? To Catch an Evil Twin Access Point DSN 2010 Yimin Song, Texas A&M University Chao Yang, Texas A&M University.
Computer Science, Software Engineering & Robotics Workshop, FGCU, April 27-28, 2012 Fault Prediction with Particle Filters by David Hatfield mentors: Dr.
Mixture Models, Monte Carlo, Bayesian Updating and Dynamic Models Mike West Computing Science and Statistics, Vol. 24, pp , 1993.
Peeping Tom in the Neighborhood Keystroke Eavesdropping on Multi-User Systems USENIX 2009 Kehuan Zhang, Indiana University, Bloomington XiaoFeng Wang,
A Mobile Terminal Based Trajectory Preserving Strategy for Continuous Querying LBS Users Yunxia Feng, Peng Liu, Jianhui Zhang May , 2012 Hangzhou,
LOCATION TRACKING USING MOBILE DEVICE POWER ANALYSIS
Optimizing Pheromone Modification for Dynamic Ant Algorithms Ryan Ward TJHSST Computer Systems Lab 2006/2007 Testing To test the relative effectiveness.
Sequential Monte-Carlo Method -Introduction, implementation and application Fan, Xin
Week Aug-24 – Aug-29 Introduction to Spatial Computing CSE 5ISC Some slides adapted from the book Computing with Spatial Trajectories, Yu Zheng and Xiaofang.
Automated Speach Recognotion Automated Speach Recognition By: Amichai Painsky.
1 Travel Times from Mobile Sensors Ram Rajagopal, Raffi Sevlian and Pravin Varaiya University of California, Berkeley Singapore Road Traffic Control TexPoint.
11 -1 Chapter 12 On-Line Algorithms On-Line Algorithms On-line algorithms are used to solve on-line problems. The disk scheduling problem The requests.
1 7-Speech Recognition Speech Recognition Concepts Speech Recognition Approaches Recognition Theories Bayse Rule Simple Language Model P(A|W) Network Types.
MONTE CARLO SIMULATION MODEL. Monte carlo simulation model Computer based technique length frequency samples are used for the model. In addition randomly.
Behavior Recognition Based on Machine Learning Algorithms for a Wireless Canine Machine Interface Students: Avichay Ben Naim Lucie Levy 14 May, 2014 Ort.
Sampling Distributions
Supervised Time Series Pattern Discovery through Local Importance
Dynamical Statistical Shape Priors for Level Set Based Tracking
Timing Analysis of Keystrokes and Timing Attacks on SSH
UAV Route Planning in Delay Tolerant Networks
Hidden Markov Models Part 2: Algorithms
Presentation transcript:

by Kejia Zhang PowerSpy: Location Tracking using Mobile Device Power Analysis Yan Michalevsky, Aaron Schulman, etc. Stanford University Published in USENIX Security '15

by Kejia Zhang Background r Tracking phones is valuable r GPS, base statuion/WiFi connectivity m Need permission to access r Power consumption m Free to access m Android: /sys/class/power_supply/battery/voltage_now /sys/class/power_supply/battery/current_now

by Kejia Zhang Background r Location ~ Signal strength m Distance to base station m Obstacles r Signal strength dominating power consumption r Location ~ Power Consumption

by Kejia Zhang

Background r Two Nexus 4 on same route

by Kejia Zhang Background r Nexus 4 and Nexus 5 on same route

by Kejia Zhang Works of this paper r Main idea m Knowing location by reading power consumption r Difficulty m Power consumption affected by Components Applications Activities m Can only read aggregate power consumption r Solution m Machine learning sees through noise

by Kejia Zhang Problem definition r Route distinguish m Known Power profiles of all possible routes m Learn Which route is taken r Real-time tracking m Known Which route is taken Route’s power profile m Learn Victim’s location

by Kejia Zhang Problem definition r New route inference m Known Power profiles of many road segments m Learn Victim’s (arbitrary) route

by Kejia Zhang Settings r Attacker m Only access to aggregate power consumption m Communicate with remote server m Prior knowledge of area power profiles r Victim m Moving by a car m Generate low traffic to keep connected

by Kejia Zhang Settings r Hysteresis m Different direction to a location may cause different signal strength m Hysteresis algorithm decides when to hand off to a new base station r Attacker can only use the same travel direction as a power reference

by Kejia Zhang Route distinguish r Known m Power profiles of all possible routes m Each power profile is a time series r Learn m Which route is taken r Difficulty m Different rides on same route vary in speed m Applications and activities add noise

by Kejia Zhang Route distinguish r Dynamic Time Warping m Measure similarity of two time series that are misaligned in time m Time Warping

by Kejia Zhang Route distinguish r DTW m Best alignment

by Kejia Zhang Route distinguish r DTW m Dynamic Programming cell(i,j) = local_distance(i,j) + MIN(cell(i-1,j), cell(i-1,j-1), cell(i, j-1))

by Kejia Zhang Route distinguish r Choose the route with shortest DTW distance

by Kejia Zhang Route distinguish r Normalizing power profile (see through noise)

by Kejia Zhang Real-time tracking r Known m Which route is taken m Route’s power profile r Learn m Victim’s location r Use Subsequence DTW algorithm m Search a sub-sequence in a larger sequence

by Kejia Zhang New route inference r Known m Power profiles of many road segments m Maybe crowd sourcing r Learn m Victim’s (arbitrary) route

by Kejia Zhang New route inference r Road segment m Denote by intersections (x, y) m A device must Complete a segment once it starts Can’t change direction meanwhile m (x, y) is not (y, x)

by Kejia Zhang

New route inference r Model the problem as Hidden Markov Model m State set Q m Transition probability matrix A m Output distribution B={B o,xy } B o,xy : probability of yielding a power profile o while traversing segment (x, y) m Initial state distribution Π={π xy } π xy : probability to start with segment (x, y)

by Kejia Zhang New route inference r Model the problem as Hidden Markov Model m Given Power profile O A, B and Π m Find Route T={s ab, s bc, …} such that p{T | O} is maximized

by Kejia Zhang New route inference r Matching route with particle filter (Monte Carlo approximation) m Pi: Sample set of N routes

by Kejia Zhang New route inference r Matching route with particle filter m Output the route occurs most in P final

by Kejia Zhang Experiments r PowerSpy android application m Run on Nexus 4, Nexus 5, HTC r Diminishing effects of certain activities

by Kejia Zhang Experiments r Route distinguish

by Kejia Zhang Experiments r Real-time tracking

by Kejia Zhang Experiments r New route inference m Training set: 13 intersections and 35 road segments m Pre-recording seesions were done by Nexus 4

by Kejia Zhang Experiments r New route inference m Transition probability marix A Uniformly distributed m Output distribution B Depend on distance between test and record profiles m Initial state distribution Π Starting location is known

by Kejia Zhang Experiments r New route inference m Nexus 4 #1, Nexus 5, HTC desire Normal number of applications m Nexus 4 #2 Large number of applications

by Kejia Zhang Experiments r New route inference

by Kejia Zhang Experiments r New route inference

by Kejia Zhang Experiments r New route inference