Preserving Location Privacy in Wireless LANs Jiang, Wang and Hu MobiSys 2007 Presenter: Bibudh Lahiri.

Slides:



Advertisements
Similar presentations
Problems in Ad Hoc Channel Access
Advertisements

On the Optimal Placement of Mix Zones Julien Freudiger, Reza Shokri and Jean-Pierre Hubaux PETS, 2009.
Capacity of wireless ad-hoc networks By Kumar Manvendra October 31,2002.
1 ECE 776 Project Information-theoretic Approaches for Sensor Selection and Placement in Sensor Networks for Target Localization and Tracking Renita Machado.
Self-Organized Anonymous Authentication in Mobile Ad Hoc Networks Julien Freudiger, Maxim Raya and Jean-Pierre Hubaux SECURECOMM, 2009.
Queuing Network Models for Delay Analysis of Multihop Wireless Ad Hoc Networks Nabhendra Bisnik and Alhussein Abouzeid Rensselaer Polytechnic Institute.
Optimal Jamming Attacks and Network Defense Policies in Wireless Sensor Networks Mingyan Li, Iordanis Koutsopoulos, Radha Poovendran (InfoComm ’07) Presented.
SELECT: Self-Learning Collision Avoidance for Wireless Networks Chun-Cheng Chen, Eunsoo, Seo, Hwangnam Kim, and Haiyun Luo Department of Computer Science,
Delay and Throughput in Random Access Wireless Mesh Networks Nabhendra Bisnik, Alhussein Abouzeid ECSE Department Rensselaer Polytechnic Institute (RPI)
1 Distributed Control Algorithms for Service Differentiation in Wireless Packet Networks INFOCOM 2001 Michael Barry, Andrew T. Campbell Andras Veres.
“Location-Aided Routing (LAR) in Mobile Ad Hoc Network” by Young-bae ko Nitin H. Validya presented by Mark Miyashita.
Packet Leashes: Defense Against Wormhole Attacks Authors: Yih-Chun Hu (CMU), Adrian Perrig (CMU), David Johnson (Rice)
Quantifying Location Privacy: The Case of Sporadic Location Exposure Reza Shokri George Theodorakopoulos George Danezis Jean-Pierre Hubaux Jean-Yves Le.
1 Stochastic Event Capture Using Mobile Sensors Subject to a Quality Metric Nabhendra Bisnik, Alhussein A. Abouzeid, and Volkan Isler Rensselaer Polytechnic.
1 William Lee Duke University Department of Electrical and Computer Engineering Durham, NC Analysis of a Campus-wide Wireless Network February 13,
1 A Distortion-based Metric for Location Privacy Workshop on Privacy in the Electronic Society (WPES), Chicago, IL, USA - November 9, 2009 Reza Shokri.
By Libo Song and David F. Kotz Computer Science,Dartmouth College.
Muhammad Mahmudul Islam Ronald Pose Carlo Kopp School of Computer Science & Software Engineering Monash University, Australia.
COST March 2004, Zurich Traffic Hotspots in UMTS Networks : influence on RRM strategies Ferran Adelantado i Freixer
1 OUTLINE Motivation Distributed Measurements Importance Sampling Results Conclusions.
Experimental study of the effects of Transmission Power Control and Blacklisting in Wireless Sensor Networks Dongjin Son, Bhaskar Krishnamachari and John.
Mobile IP: Introduction Reference: “Mobile networking through Mobile IP”; Perkins, C.E.; IEEE Internet Computing, Volume: 2 Issue: 1, Jan.- Feb. 1998;
Optimizing Mixing in Pervasive Networks: A Graph-Theoretic Perspective
MobiQuitous 2004Kimaya Sanzgiri Leveraging Mobility to Improve Quality of Service in Mobile Networks Kimaya Sanzgiri and Elizabeth Belding-Royer Department.
Preserving Location Privacy in Wireless LANs Presented by Alvin Yonggang Yun April 9, 2008 CSCI Wireless and Mobile Security.
Deployment Guidelines for Highly Congested IEEE b/g Networks Andrea G. Forte and Henning Schulzrinne Columbia University.
Distributed Call Admission Control for VoIP over WLANs based on Channel Load Estimation Paolo Dini, Nicola Baldo, Jaume Nin-Guerrero, Josep Mangues-Bafalluy,
Using Pattern of Social Dynamics in the Design of Social Networks of Sensors - Marello Tomasini, Franco Zambonelli, Ronaldo Menezes 한국기술교육대학교 전기전자통신 공학부.
Geo597 Geostatistics Ch9 Random Function Models.
Maximum Network Lifetime in Wireless Sensor Networks with Adjustable Sensing Ranges Cardei, M.; Jie Wu; Mingming Lu; Pervaiz, M.O.; Wireless And Mobile.
DISCERN: Cooperative Whitespace Scanning in Practical Environments Tarun Bansal, Bo Chen and Prasun Sinha Ohio State Univeristy.
On the Age of Pseudonyms in Mobile Ad Hoc Networks Julien Freudiger, Mohammad Hossein Manshaei, Jean-Yves Le Boudec and Jean-Pierre Hubaux Infocom 2010.
WINLAB Improving RF-Based Device-Free Passive Localization In Cluttered Indoor Environments Through Probabilistic Classification Methods Rutgers University.
An Energy Efficient Hierarchical Clustering Algorithm for Wireless Sensor Networks Seema Bandyopadhyay and Edward J. Coyle Presented by Yu Wang.
A new Ad Hoc Positioning System 컴퓨터 공학과 오영준.
Secure and Energy-Efficient Disjoint Multi-Path Routing for WSNs Presented by Zhongming Zheng.
Probabilistic Coverage in Wireless Sensor Networks Authors : Nadeem Ahmed, Salil S. Kanhere, Sanjay Jha Presenter : Hyeon, Seung-Il.
Alastair R. Beresford Frank Stajano University of Cambridge Presented by Arcadiy Kantor — CS4440 September 13, 2007.
A Passive Approach to Sensor Network Localization Rahul Biswas and Sebastian Thrun International Conference on Intelligent Robots and Systems 2004 Presented.
ECE 256: Wireless Networking and Mobile Computing
Preserving Privacy in GPS Traces via Uncertainty- Aware Path Cloaking Baik Hoh, Marco Gruteser, Hui Xiong, Ansaf Alrabady Presented by Joseph T. Meyerowitz.
GameSec 2010 November 22, Berlin Mathias Humbert, Mohammad Hossein Manshaei, Julien Freudiger and Jean-Pierre Hubaux EPFL - Laboratory for Computer communications.
A High-Throughput MAC Protocol for Wireless Ad Hoc Networks Wanrong Yu, Jiannong Cao, Xingming Zhou, Xiaodong Wang, Keith C. C. Chan, Alvin T. S. Chan,
On Non-Cooperative Location Privacy: A Game-theoreticAnalysis
Virtual Trip Lines for Distributed Privacy- Preserving Traffic Monitoring Baik Hoh et al. MobiSys08 Slides based on Dr. Hoh’s MobiSys presentation.
MMAC: A Mobility- Adaptive, Collision-Free MAC Protocol for Wireless Sensor Networks Muneeb Ali, Tashfeen Suleman, and Zartash Afzal Uzmi IEEE Performance,
TCP-Cognizant Adaptive Forward Error Correction in Wireless Networks
S& EDG: Scalable and Efficient Data Gathering Routing Protocol for Underwater Wireless Sensor Networks 1 Prepared by: Naveed Ilyas MS(EE), CIIT, Islamabad,
Access Delay Distribution Estimation in Networks Avideh Zakhor Joint work with: E. Haghani and M. Krishnan.
Cooperative Layered Wireless Video Multicast Ozgu Alay, Thanasis Korakis, Yao Wang, Elza Erkip, Shivendra Panwar.
Wireless Communication Technologies Group 3/20/02CISS 2002, Princeton 1 Distributional Properties of Inhibited Random Positions of Mobile Radio Terminals.
Adversary models in wireless security Suman Banerjee Department of Computer Sciences Wisconsin Wireless and NetworkinG Systems (WiNGS)
1 Privacy Aware Incentive Mechanism to Collect Mobile Data While Preventing Duplication Junggab Son*, Donghyun Kim*, Rasheed Hussain**, Sung-Sik Kwon*,
1 An Arc-Path Model for OSPF Weight Setting Problem Dr.Jeffery Kennington Anusha Madhavan.
Efficient Resource Allocation for Wireless Multicast De-Nian Yang, Member, IEEE Ming-Syan Chen, Fellow, IEEE IEEE Transactions on Mobile Computing, April.
Paging Area Optimization Based on Interval Estimation in Wireless Personal Communication Networks By Z. Lei, C. U. Saraydar and N. B. Mandayam.
On Mitigating the Broadcast Storm Problem with Directional Antennas Sheng-Shih Wang July 14, 2003 Chunyu Hu, Yifei Hong, and Jennifer Hou Dept. of Electrical.
TreeCast: A Stateless Addressing and Routing Architecture for Sensor Networks Santashil PalChaudhuri, Shu Du, Ami K. Saha, and David B. Johnson Department.
Optimizing the Location Obfuscation in Location-Based Mobile Systems Iris Safaka Professor: Jean-Pierre Hubaux Tutor: Berker Agir Semester Project Security.
Protocol Security for Wireless Networks Yih-Chun Hu Illinois Center for Wireless Systems.
Privacy Vulnerability of Published Anonymous Mobility Traces Chris Y. T. Ma, David K. Y. Yau, Nung Kwan Yip (Purdue University) Nageswara S. V. Rao (Oak.
RF-based positioning.
(Spot localization using PHY Layer information
Presented By Siddartha Ailuri Graduate Student, EECS 04/07/17
Wireless Security Ian Bodley.
The Impact of Multihop Wireless Channel on TCP Performance
ADVISOR : Professor Yeong-Sung Lin STUDENT : Hung-Shi Wang
Modeling Entropy in Onion Routing Networks
A Privacy – Preserving Index
Anonymity – Generalizing Mixes
Presentation transcript:

Preserving Location Privacy in Wireless LANs Jiang, Wang and Hu MobiSys 2007 Presenter: Bibudh Lahiri

Organization Problem Definition Problem Definition Existing Solutions and Their Shortcomings Existing Solutions and Their Shortcomings Preliminaries Preliminaries Proposed Solutions Proposed Solutions Results Results Limitations of the Proposed Solutions Limitations of the Proposed Solutions

Problem Definition To preserve the location information of a mobile wireless station To preserve the location information of a mobile wireless station Location data in wrong hands can be seriously abused Location data in wrong hands can be seriously abused RF-based localization systems RF-based localization systems

Existing Solutions and Their Shortcomings Privacy of location data is at risk when transmitted for location-based services Privacy of location data is at risk when transmitted for location-based services Gruteser, Grunwald (Mobisys ‘03) Gruteser, Grunwald (Mobisys ‘03) Reduce spatial and temporal precision of location data Reduce spatial and temporal precision of location data Works for application-provided location data Works for application-provided location data This paper addresses location tracked from any wireless transmission This paper addresses location tracked from any wireless transmission

Existing Solutions… Gruteser, Grunwald (WMASH ‘03) Gruteser, Grunwald (WMASH ‘03)  Adversary can be outsmarted with frequently-changing pseudonyms  Does not work if adversary has enough knowledge of user’s mobility pattern  Can correlate the packets coming from the same mobile user

Existing Solutions… Silent Periods Silent Periods  User stops transmission for some time  Outwits an adversary that can correlate different pseudonyms  Optimal length of the silent period was not known

Existing Solutions… Mix Zones Mix Zones  Spatial version of silent period  Nodes should know their own locations precisely

Preliminaries Attacker model Attacker model  Silent: Does not emit any signals  Exposed: Provides wireless services Active: Adjusts base station’s transmission power Active: Adjusts base station’s transmission power Passive: No change in base station’s behavior Passive: No change in base station’s behavior Privacy Entropy Privacy Entropy  Uncertainty or randomness in the location inference drawn by attacker  Goal is to increase privacy entropy

Proposed Solutions: Use of Pseudonyms MAC and IP addresses must be protected with pseudonyms MAC and IP addresses must be protected with pseudonyms Association with AP Association with AP  Unique MAC address reveals identity  Random MAC may collide  Solution: Use join address  AP distinguishes requests by an 128- bit nonce

Proposed Solutions: Use of Pseudonyms Attacker cannot trivially identify a user at a particular location Attacker cannot trivially identify a user at a particular location Different pseudonyms of same user can be correlated Different pseudonyms of same user can be correlated  With knowledge of mobility pattern  If location data for all packets in network is gathered  Correletion can be reduced with silent periods

Proposed Solutions: Opportunistic Silent Period Goal: To find the optimal duration of the silent period Goal: To find the optimal duration of the silent period  Maximizes privacy entropy for a given mobility pattern Length of silent periods must be randomized Length of silent periods must be randomized  Pseudonyms used after same duration can belong to the same user w.h.p.  Make length = T d + T r  T d is deterministic  T r is chosen from uniformly at random

Proposed Solutions: Opportunistic Silent Period When T d is small, increasing T d increases the entropy When T d is small, increasing T d increases the entropy Entropy is periodic Entropy is periodic  Increasing silent period increases fraction of mobile users in silent period  Fewer mobile users transit from communicating to silence Privacy entropy monotonically increases with increasing T r Privacy entropy monotonically increases with increasing T r  Increasing T r increases total length of silent period  Includes more candidate users

Proposed Solutions: Opportunistic Silent Period For T r = 4 mins, entropy maximizes for T d = 19 mins 20 secs For T r = 4 mins, entropy maximizes for T d = 19 mins 20 secs For T d = 19 mins 20 secs, entropy maximizes for T r max = 12 mins For T d = 19 mins 20 secs, entropy maximizes for T r max = 12 mins

Proposed Solutions: Reducing Location Precision by TPC Precision of localization depends on number of APs within range of mobile user Precision of localization depends on number of APs within range of mobile user Transmission Power Control Transmission Power Control  Reduce transmission power of a user of a user  Decrease the number of APs within its reach

Proposed Solutions: Reducing Location Precision by TPC User concerned with location privacy should do TPC silently User concerned with location privacy should do TPC silently  Signal emitted from a mobile station exposes its location Silent TPC is difficult Silent TPC is difficult  Unpredictability in temporal variation of RSS  Asymmetry

Proposed Solutions: Reducing Location Precision by TPC Goal Goal  To determine relationship between two directions of a channel  Use the path loss in one direction (AP-station) to estimate the loss in the other direction (station-AP) (AP-station) to estimate the loss in the other direction (station-AP)  Use the relationship to do TPC to reduce number of APs in range

Proposed Solutions: Reducing Location Precision by TPC Observations Observations  RSSI readings for both directions are strongly correlated despite path asymmetry path asymmetry Results Results  AP 1, AP 2, …, AP i-1 can be kept within reach  AP i+1,…, AP n can be kept out of reach

Results Transmission radius r is about 10 m at the minimum transmit power Transmission radius r is about 10 m at the minimum transmit power A silent attacker needs attacker density of 1 sniffer/100 m 2 A silent attacker needs attacker density of 1 sniffer/100 m 2 Five times as high as a regular AP deployment Five times as high as a regular AP deployment

Results Mix Area: Maximum area covered by an AP Mix Area: Maximum area covered by an AP Larger mix area makes attacks more difficult Larger mix area makes attacks more difficult Silent TPC enlarges the mix area 12 times compared to the typical Silent TPC enlarges the mix area 12 times compared to the typical Number of candidates for a new pseudonym is 12 times greater when using TPC Number of candidates for a new pseudonym is 12 times greater when using TPC

Limitations of the Proposed Solutions Use of pseudonyms: Man-in-the- middle attack Use of pseudonyms: Man-in-the- middle attack  Attacker positioned between mobile user and AP  Captures request from user for new MAC address  Assigns a MAC address from its own pool  Mobile user starts operating with a MAC address known to the attacker

Limitations… Opportunistic Silent Period: Lack of Generality Opportunistic Silent Period: Lack of Generality  No rigorous mathematical formulation of the problem  Values of T d and T r max that maximize entropy are results of particular experimental set-up  Optimal length of silent period should be a function of some relevant parameters  Results are not useful under different scenarios

Limitations… TPC - Inadequate Probabilistic Analysis TPC - Inadequate Probabilistic Analysis  Probability distributions of channel asymmetry and RSS are based on experimental findings  No discussion of how experimental parameters influence the pdf  Does not explain how the probabilities are calculated What is the estimator used What is the estimator used Whether estimator is unbiased and low- variance Whether estimator is unbiased and low- variance

Thank You