C LOAKING AND M ODELING T ECHNIQUES FOR LOCATION P RIVACY PROTECTION Ying Cai Department of Computer Science Iowa State University Ames, IA 50011.

Slides:



Advertisements
Similar presentations
Cipher Techniques to Protect Anonymized Mobility Traces from Privacy Attacks Chris Y. T. Ma, David K. Y. Yau, Nung Kwan Yip and Nageswara S. V. Rao.
Advertisements

Location Based Services and Privacy Issues
Efficient Evaluation of k-Range Nearest Neighbor Queries in Road Networks Jie BaoChi-Yin ChowMohamed F. Mokbel Department of Computer Science and Engineering.
Quality Aware Privacy Protection for Location-based Services Zhen Xiao, Xiaofeng Meng Renmin University of China Jianliang Xu Hong Kong Baptist University.
Scalable Content-Addressable Network Lintao Liu
Ranveer Chandra , Kenneth P. Birman Department of Computer Science
PRIVACY AND SECURITY ISSUES IN DATA MINING P.h.D. Candidate: Anna Monreale Supervisors Prof. Dino Pedreschi Dott.ssa Fosca Giannotti University of Pisa.
Mohamed F. Mokbel University of Minnesota
What’s the Problem Web Server 1 Web Server N Web system played an essential role in Proving and Retrieve information. Cause Overloaded Status and Longer.
Content Based Image Clustering and Image Retrieval Using Multiple Instance Learning Using Multiple Instance Learning Xin Chen Advisor: Chengcui Zhang Department.
1 A Distortion-based Metric for Location Privacy Workshop on Privacy in the Electronic Society (WPES), Chicago, IL, USA - November 9, 2009 Reza Shokri.
Location Privacy in Casper: A Tale of two Systems
On Reducing Communication Cost for Distributed Query Monitoring Systems. Fuyu Liu, Kien A. Hua, Fei Xie MDM 2008 Alex Papadimitriou.
Dept. of Computer Science & Engineering, CUHK1 Trust- and Clustering-Based Authentication Services in Mobile Ad Hoc Networks Edith Ngai and Michael R.
CSE 830: Design and Theory of Algorithms
A Scalable Content-Addressable Network Authors: S. Ratnasamy, P. Francis, M. Handley, R. Karp, S. Shenker University of California, Berkeley Presenter:
Malicious parties may employ (a) structure-based or (b) label-based attacks to re-identify users and thus learn sensitive information about their rating.
CS 672 Paper Presentation Presented By Saif Iqbal “CarNet: A Scalable Ad Hoc Wireless Network System” Robert Morris, John Jannotti, Frans Kaashoek, Jinyang.
1 Efficient Placement and Dispatch of Sensors in a Wireless Sensor Network Prof. Yu-Chee Tseng Department of Computer Science National Chiao-Tung University.
MobiHide: A Mobile Peer-to-Peer System for Anonymous Location-Based Queries Gabriel Ghinita, Panos Kalnis, Spiros Skiadopoulos National University of Singapore.
The Union-Split Algorithm and Cluster-Based Anonymization of Social Networks Brian Thompson Danfeng Yao Rutgers University Dept. of Computer Science Piscataway,
Naming Names in computer systems are used to share resources, to uniquely identify entities, to refer to locations and so on. An important issue with naming.
A Customizable k-Anonymity Model for Protecting Location Privacy Written by: B. Gedik, L.Liu Presented by: Tal Shoseyov.
PRIVACY CRITERIA. Roadmap Privacy in Data mining Mobile privacy (k-e) – anonymity (c-k) – safety Privacy skyline.
Peer-to-peer file-sharing over mobile ad hoc networks Gang Ding and Bharat Bhargava Department of Computer Sciences Purdue University Pervasive Computing.
Access Tutorial 3 Maintaining and Querying a Database
THE SECOND LIFE OF A SENSOR: INTEGRATING REAL-WORLD EXPERIENCE IN VIRTUAL WORLDS USING MOBILE PHONES Sherrin George & Reena Rajan.
DATABASE MANAGEMENT SYSTEM ARCHITECTURE
Location Privacy Location privacy in mobile systems: A personalized Anonymization Model Burga Gedik, Ling Liu.
F EELING - BASED L OCATION P RIVACY P ROTECTION FOR L OCATION - BASED S ERVICES CS587x Lecture Department of Computer Science Iowa State University Ames,
Processing Monitoring Queries on Mobile Objects Lecture for COMS 587 Department of Computer Science Iowa State University.
Privacy Preserving Data Mining on Moving Object Trajectories Győző Gidófalvi Geomatic ApS Center for Geoinformatik Xuegang Harry Huang Torben Bach Pedersen.
Network Aware Resource Allocation in Distributed Clouds.
Demonstration of the Software Prototypes PRIME PROJECT 17 December 2004.
Secure Incremental Maintenance of Distributed Association Rules.
A Distributed Clustering Framework for MANETS Mohit Garg, IIT Bombay RK Shyamasundar School of Tech. & Computer Science Tata Institute of Fundamental Research.
Systems and Internet Infrastructure Security (SIIS) LaboratoryPage Systems and Internet Infrastructure Security Network and Security Research Center Department.
February 3, Location Based M-Services The numbers of on-line mobile personal devices increase. New types of context-aware e-services become possible.
ACOMP 2011 A Novel Framework for LBS Privacy Preservation in Dynamic Context Environment.
Doc.: IEEE /495r1 Submission July 2001 Jon Edney, NokiaSlide 1 Ad-Hoc Group Requirements Report Group met twice - total 5 hours Group size ranged.
1 SpaceTwist: A Flexible Approach for Hiding Query User Location Speaker: Man Lung Yiu Aalborg University Joint work with Christian S. Jensen, Xuegang.
Alastair R. Beresford Frank Stajano University of Cambridge Presented by Arcadiy Kantor — CS4440 September 13, 2007.
Scalable Content- Addressable Networks Prepared by Kuhan Paramsothy March 5, 2007.
Anonymity on Web Transaction Department of Computer Science Ball State University Research Methods - CS 689 Uday Adhikari 7 th Dec
DATABASE MANAGEMENT SYSTEM ARCHITECTURE
Preserving Privacy in GPS Traces via Uncertainty- Aware Path Cloaking Baik Hoh, Marco Gruteser, Hui Xiong, Ansaf Alrabady Presented by Joseph T. Meyerowitz.
Dr. Sudharman K. Jayaweera and Amila Kariyapperuma ECE Department University of New Mexico Ankur Sharma Department of ECE Indian Institute of Technology,
Freenet “…an adaptive peer-to-peer network application that permits the publication, replication, and retrieval of data while protecting the anonymity.
1. Outline  Introduction  Different Mechanisms Broadcasting Multicasting Forward Pointers Home-based approach Distributed Hash Tables Hierarchical approaches.
Trajectory Data Mining Dr. Yu Zheng Lead Researcher, Microsoft Research Chair Professor at Shanghai Jiao Tong University Editor-in-Chief of ACM Trans.
m-Privacy for Collaborative Data Publishing
Privacy Protection in Social Networks Instructor: Assoc. Prof. Dr. DANG Tran Khanh Present : Bui Tien Duc Lam Van Dai Nguyen Viet Dang.
Integrating Access Control with Intentional Naming Sanjay Raman MIT Laboratory for Computer Science January 8, 2002 With help from: Dwaine.
Minkyoon Kim, Sangjin Han1 Querying in Highly Mobile Distributed Environments T.Imielinski and B. R. Badrinath Minkyoon Kim Sangjin Han.
Location Privacy Protection for Location-based Services CS587x Lecture Department of Computer Science Iowa State University.
Probabilistic km-anonymity (Efficient Anonymization of Large Set-valued Datasets) Gergely Acs (INRIA) Jagdish Achara (INRIA)
4x4 Optimization Alkesh Patel & Hemant Patel. Background IP address – identify computer on the network Mobile domain - mobile host IP address is not restricted.
H IDING S TARS WITH F IREWORKS : L OCATION P RIVACY THROUGH C AMOUFLAGE H IDING S TARS WITH F IREWORKS : L OCATION P RIVACY THROUGH C AMOUFLAGE J OSEPH.
Unraveling an old cloak: k-anonymity for location privacy
An overlay for latency gradated multicasting Anwitaman Datta SCE, NTU Singapore Ion Stoica, Mike Franklin EECS, UC Berkeley
Similarity Measurement and Detection of Video Sequences Chu-Hong HOI Supervisor: Prof. Michael R. LYU Marker: Prof. Yiu Sang MOON 25 April, 2003 Dept.
Efficient Placement and Dispatch of Sensors in a Wireless Sensor Network You-Chiun Wang, Chun-Chi Hu, and Yu-Chee Tseng IEEE Transactions on Mobile Computing.
Integrating Access Control with Intentional Naming Sanjay Raman MIT Laboratory for Computer Science January 8, 2002 With help from: Dwaine.
Department of Computer Science, Johns Hopkins University Lecture 7 Finding Concurrency EN /420 Instructor: Randal Burns 26 February 2014.
SIMILARITY SEARCH The Metric Space Approach
Feeling-based location privacy protection for LBS
Using Partitions and Fragments
Location Cloaking for Location Safety Protection of Ad Hoc Networks
Location Privacy.
Presentation transcript:

C LOAKING AND M ODELING T ECHNIQUES FOR LOCATION P RIVACY PROTECTION Ying Cai Department of Computer Science Iowa State University Ames, IA 50011

L OCATION - BASED S ERVICES

R ISKS A SSOCIATED WITH LBS Exposure of service uses Location privacy HospitalPolitical Party Nightclub Stalking….

C HALLENGE Restricted space identification Simply using a pseudonym is not sufficient because anonymous location data may be correlated with restricted spaces such as home and office for subject re-identification …… … identified

L OCATION D EPERSONALIZATION Basic idea: reducing location resolution Report a cloaking region, instead of actual location

L OCATION D EPERSONALIZATION Basic idea: reducing location resolution Report a cloaking region, instead of actual location Key Issue Each cloaking area must provide a desired level of depersonalization, and be as small as possible

E XISTING S OLUTION Ensuring each cloaking area contains a certain number of users [MobiSys’03, ICDCS’05, VLDB’07]

P ROBLEMS (1) The anonymity server needs frequent location update from all users Practicality Scalability Difficult to support continuous LBS Simply ensuring each cloaking region contains K users does not support K-anonymity protection

P ROBLEMS (2) Guarantee only anonymous uses of services, but not location privacy An adversary may not know who requests the service, but knows that the K users are all there at the time when the service is requested Where you are and whom you are with are closely related with what you are doing …

T HE ROOT OF THE PROBLEMS These techniques cloak a user’s position based on his current neighbors

O BSERVATION Public areas are naturally depersonalized A large number of visits by different people More footprints, more popular Park Highway

P ROPOSED SOLUTION [I NFOCOM ’08] Using footprints for location cloaking A footprint is a historical location sample Each cloaking region contains at least K different footprints Location privacy protection An adversary may be able to identify all these users, but will not know who was there at what time

F OOTPRINT DATABASE Source of footprints From wireless service carriers, which provide the communication infrastructure From the users of LBSs, who need to report location for cloaking

F OOTPRINT DATABASE Source of footprints From wireless service carriers, which provide the communication infrastructure From the users of LBSs, who need to report location for cloaking Trajectory indexing for efficient retrieval Partition network domain into cells Maintain a cell table for each cell

C LOAKING T ECHNIQUES Sporadic LBS Each a cloaking region needs to 1) be as small as possible, 2) contain footprints from at least K different users Continuous LBS Each trajectory disclosed must be a K- anonymity trajectory (KAT)

P RIVACY R EQUIREMENT M ODELING K -anonymity model To request a desired level of protection, a user needs to specify a value of K Problem: choosing an appropriate K is difficult Privacy is about feeling, and it is difficult to scale one’s feeling using a number A user can always choose a large K, but this will reduce location resolution unnecessarily

A feeling -based approach A user specifies a public region A spatial region which she feels comfortable that it is reported as her location should she request a service inside it The public region becomes her privacy requirement All location reported on her behalf will be at least as popular as the public region she identifies P ROPOSED S OLUTION [CCS09]

C HALLENGE How to measure the popularity of a spatial region? More visitors  higher popularity More even distribution  higher popularity Given a spatial region R, we define Entropy E(R) = Popularity P(R) = 2 E(R)

C LOAKING T ECHNIQUES Sporadic LBS Each cloaking region needs to 1) be as small as possible, 2) have a popularity no less than P(R) Continuous LBS A sequence of location updates which form a trajectory The strategy for sporadic LBSs may not work Adversary may identify the common set of visitors

C LOAKING T ECHNIQUES Sporadic LBS Each disclosed cloaking region must be as small as possible and have a popularity no less than P(R) Continuous LBS The time-series sequence of location samples must form a P-Populous Trajectory (PPT) A trajectory is a PPT if its popularity is no less than P The popularity of each cloaking region in the trajectory must be computed w.r.t. a common set of users

F INDING A CLOAKING SET A simple solution is to find the set of users who have footprints closest to the service-user Resolution becomes worse There may exist another cloaking set which leads to a finer average resolution

P ROPOSED SOLUTION Using populous users for cloaking Popular users have more footprints spanning in a larger regions Pyramid footprint indexing A user is l -popular if she has footprints in all cells at level l Sort users by the level l, and choose the most popular ones as the cloaking set

S IMULATION We implement two other strategies for comparison Naive cloaks each location independently Plain selects cloaking set by finding footprints closest to service user’s start position Performance metrics Cloaking area Protection level

E XPERIMENT A Location Privacy Aware Gateway (LPAG) ePost-It: a spatial messaging system [MobiSys’08]

C ONCLUDING R EMARKS Exploring historical location samples for location cloaking Up to date, this is the only solution that can prevent anonymous location data from being correlated with restricted spaces to derive who’s where at what time A feeling-based approach for users to express their location privacy requirement K-anonymity model was the only choice A suite of location cloaking algorithms Satisfy a required level of protection while resulting in good location resolution A location privacy-aware gateway prototype has been implemented