Privately Querying Location-based Services with SybilQuery Pravin Shankar, Vinod Ganapathy, and Liviu Iftode Department of Computer Science Rutgers University.

Slides:



Advertisements
Similar presentations
COMP 110: Introduction to Programming Tyler Johnson Feb 11, 2009 MWF 11:00AM-12:15PM Sitterson 014.
Advertisements

COMP 110: Introduction to Programming Tyler Johnson Feb 18, 2009 MWF 11:00AM-12:15PM Sitterson 014.
COMP 110: Introduction to Programming Tyler Johnson Feb 25, 2009 MWF 11:00AM-12:15PM Sitterson 014.
COMP 110: Introduction to Programming Tyler Johnson Mar 16, 2009 MWF 11:00AM-12:15PM Sitterson 014.
COMP 110: Introduction to Programming Tyler Johnson Apr 20, 2009 MWF 11:00AM-12:15PM Sitterson 014.
COMP 110: Introduction to Programming Tyler Johnson Apr 13, 2009 MWF 11:00AM-12:15PM Sitterson 014.
COMP 110: Introduction to Programming Tyler Johnson January 12, 2009 MWF 11:00AM-12:15PM Sitterson 014.
COMP 110: Introduction to Programming Tyler Johnson Mar 25, 2009 MWF 11:00AM-12:15PM Sitterson 014.
COMP 110: Introduction to Programming Tyler Johnson Apr 8, 2009 MWF 11:00AM-12:15PM Sitterson 014.
COMP 110: Introduction to Programming Tyler Johnson Apr 1, 2009 MWF 11:00AM-12:15PM Sitterson 014.
COMP 110: Introduction to Programming Tyler Johnson Apr 27, 2009 MWF 11:00AM-12:15PM Sitterson 014.
Covert Barcodes handle on-the-spot Brand and Document Authentication Information Management Institute Conference on Security Printing 11/18/2009 Read what.
Large Scale Integration of Senses for the Semantic Web Jorge Gracia, Mathieu dAquin, Eduardo Mena Computer Science and Systems Engineering Department (DIIS)
Defending against large-scale crawls in online social networks Mainack Mondal Bimal Viswanath Allen Clement Peter Druschel Krishna Gummadi Alan Mislove.
Producing monthly estimates of labour market indicators exploiting the longitudinal dimension of the LFS microdata R. Gatto, S. Loriga, A. Spizzichino.
9/09/20091 Risk Analysis Bob Sklar Engineering Fellow & Chief Engineer (Retired) Raytheon Company University of Arizona SIE-554 Fall 2009.
Wouter Noordkamp The assessment of new platforms on operational performance and manning concepts.
Student Learning Center Time Management Welcome to the Time Management workshop. While we are waiting to begin, please fill out the blank weekly.
Ziehm Academy - User Guide for online registration portal Nuremberg, February 2009.
October FUEL PRICE EVALUATION Comparing different fuel costs is a complex issue requiring an in-depth knowledge of fuel properties and characteristics,
Automation Solutions for Ladle Gate Applications
Working Set-Based Access Control for Network File Systems Stephen Smaldone, Vinod Ganapathy, and Liviu Iftode DiscoLab - Department of Computer Science.
AŽD Praha s.r.o. CRV&AVV ATO system used on vehicles of Czech Railways Dr.Ing. Ivo Myslivec AŽD Praha, Plant Technics, R&D WG1.
Efficient Solutions For Water Supply Helix High-Pressure Vertical Multistage Pump.
1 Cathay Life Insurance Ltd. (Vietnam) 27/11/20091.
I have a DREAM! (DiffeRentially privatE smArt Metering) Gergely Acs and Claude Castelluccia {gergely.acs, INRIA 2011.
Combining Thread Level Speculation, Helper Threads, and Runahead Execution Polychronis Xekalakis, Nikolas Ioannou and Marcelo Cintra University of Edinburgh.
Presented by: Yaseen Ali, Suraj Bhardwaj, Rohan Shah Yaseen Ali, Suraj Bhardwaj, Rohan Shah Mechatronics Engineering Group 302 Instructor: Dr. K. Sartipi.
ATUG Roundtable – November 2009 NBN Architecture Reference Model.
1. (c) Alan Rowley Associates Laboratory Accreditation Dr Alan G Rowley Quality Policy based on Quality Objectives Quality Management System Communicate.
Vault 9 Project Update 9 th September 2009 Paul Pointon – Site Project Delivery Manager LLW Repository Ltd.
30 min Scratch July min intro to Scratch A Quick-and-Dirty approach Leaving lots of exploration for the future. (5 hour lesson plan available)
Mini_UPA, 2009 Rating Scales: What the Research Says Joe DumasTom Tullis UX ConsultantFidelity Investments
Flexible Scheduling of Software with Logical Execution Time Constraints* Stefan Resmerita and Patricia Derler University of Salzburg, Austria *UC Berkeley,
MINJAE HWANG THAWAN KOOBURAT CS758 CLASS PROJECT FALL 2009 Extending Task-based Programming Model beyond Shared-memory Systems.
PIR-Tor: Scalable Anonymous Communication Using Private Information Retrieval Prateek Mittal University of Illinois Urbana-Champaign Joint work with: Femi.
Efficient Information Retrieval for Ranked Queries in Cost-Effective Cloud Environments Presenter: Qin Liu a,b Joint work with Chiu C. Tan b, Jie Wu b,
Automatically Annotating and Integrating Spatial Datasets Chieng-Chien Chen, Snehal Thakkar, Crail Knoblock, Cyrus Shahabi Department of Computer Science.
Mohamed F. Mokbel University of Minnesota
Yoshiharu Ishikawa (Nagoya University) Yoji Machida (University of Tsukuba) Hiroyuki Kitagawa (University of Tsukuba) A Dynamic Mobility Histogram Construction.
SLAW: A Mobility Model for Human Walks Lee et al..
A Mobile Infrastructure Based VANET Routing Protocol in the Urban Environment School of Electronics Engineering and Computer Science, PKU, Beijing, China.
CSCE 715 Ankur Jain 11/16/2010. Introduction Design Goals Framework SDT Protocol Achievements of Goals Overhead of SDT Conclusion.
Differentially Private Aggregation of Distributed Time-Series Vibhor Rastogi (University of Washington) Suman Nath (Microsoft Research)
Tracking Moving Objects in Anonymized Trajectories Nikolay Vyahhi 1, Spiridon Bakiras 2, Panos Kalnis 3, and Gabriel Ghinita 3 1 St. Petersburg State University.
APPLAUS: A Privacy-Preserving Location Proof Updating System for Location-based Services Zhichao Zhu and Guohong Cao Department of Computer Science and.
Scalable Network Distance Browsing in Spatial Database Samet, H., Sankaranarayanan, J., and Alborzi H. Proceedings of the 2008 ACM SIGMOD international.
Abstract Shortest distance query is a fundamental operation in large-scale networks. Many existing methods in the literature take a landmark embedding.
TrafficView: A Driver Assistant Device for Traffic Monitoring based on Car-to-Car Communication Sasan Dashtinezhad, Tamer Nadeem Department of CS, University.
FLANN Fast Library for Approximate Nearest Neighbors
Click to edit Present’s Name Trends in Location-based Services Muhammad Aamir Cheema.
Information Technology Trends in Location Based Services Muhammad Aamir Cheema Monash University, Australia Contact:
R 18 G 65 B 145 R 0 G 201 B 255 R 104 G 113 B 122 R 216 G 217 B 218 R 168 G 187 B 192 Core and background colors: 1© Nokia Solutions and Networks 2014.
HERO: Online Real-time Vehicle Tracking in Shanghai Xuejia Lu 11/17/2008.
A Metadata Based Approach For Supporting Subsetting Queries Over Parallel HDF5 Datasets Vignesh Santhanagopalan Graduate Student Department Of CSE.
Hiding in the Mobile Crowd: Location Privacy through Collaboration.
Clustering Moving Objects in Spatial Networks Jidong Chen, Caifeng Lai, Xiaofeng Meng, Renmin University of China Jianliang Xu, and Haibo Hu Hong Kong.
Preserving Privacy in GPS Traces via Uncertainty- Aware Path Cloaking Baik Hoh, Marco Gruteser, Hui Xiong, Ansaf Alrabady Presented by Joseph T. Meyerowitz.
A Hybrid Technique for Private Location-Based Queries with Database Protection Gabriel Ghinita 1 Panos Kalnis 2 Murat Kantarcioglu 3 Elisa Bertino 1 1.
Privately Querying Location-based Services with SybilQuery Pravin Shankar, Vinod Ganapathy, and Liviu Iftode Department of Computer Science Rutgers University.
Big traffic data processing framework for intelligent monitoring and recording systems 學生 : 賴弘偉 教授 : 許毅然 作者 : Yingjie Xia a, JinlongChen a,b,n, XindaiLu.
Location Privacy Protection for Location-based Services CS587x Lecture Department of Computer Science Iowa State University.
Privacy-Preserving and Content-Protecting Location Based Queries.
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.
Data Driven Resource Allocation for Distributed Learning
SLAW: A Mobility Model for Human Walks
Hybrid Cloud Architecture for Software-as-a-Service Provider to Achieve Higher Privacy and Decrease Securiity Concerns about Cloud Computing P. Reinhold.
Efficient Evaluation of k-NN Queries Using Spatial Mashups
Timing Analysis of Keystrokes And Timing Attacks on SSH
Presentation transcript:

Privately Querying Location-based Services with SybilQuery Pravin Shankar, Vinod Ganapathy, and Liviu Iftode Department of Computer Science Rutgers University { spravin, vinodg, iftode cs.rutgers.edu

October 1, 2009Ubicomp Location-based Services (LBSes) Implicit assumption: Users agree to reveal their locations for access to services How is the traffic in the road ahead? Where is my nearest restaurant?

October 1, 2009Ubicomp Privacy concerns while querying an LBS With two weeks of GPS data from a users car, we can infer home address (median error < 60 m) [Krumm 07] 5% of people are uniquely identified by their home and work locations even if it is known only at the census tract level [Golle and Partridge 09]

October 1, 2009Ubicomp Querying an LBS LBS... Work loc 1 loc n Home loc 2 Client

October 1, 2009Ubicomp Work'' Work' Work Basic Idea LBS... Home Client Home'' Home' loc 1, loc 1 ', loc 1 '' loc 2, loc 2 ', loc 2 '' loc n, loc n ', loc n ''

October 1, 2009Ubicomp What the LBS sees Which of these is the real user?

October 1, 2009Ubicomp 20097Outline Introduction SybilQuery Overview Design Challenges Implementation Evaluation and Results Conclusions and Future Work

October 1, 2009Ubicomp SybilQuery Overview Basic Idea: Achieves privacy using synthetic (Sybil) queries For each real user trip, the system generates –k-1 Sybil start and end points (termed endpoints) –k-1 Sybil paths For each real query made, the system generates –k-1 Sybil Queries

October 1, 2009Ubicomp 20099Outline Introduction SybilQuery Overview Design Challenges Implementation Evaluation and Results Conclusions and Future Work

October 1, 2009Ubicomp SybilQuery Challenges Endpoint generation: –How to automatically generate synthetic endpoints similar to a pair of real endpoints? Path generation: –How to choose the waypoints of the Sybil path? Query generation: –How to simulate motion along the Sybil path?

October 1, 2009Ubicomp Basic design of SybilQuery

October 1, 2009Ubicomp Endpoint Generator Produces synthetic endpoints that resemble the real source and destination High-level idea: –Tag locations with features –Identify clusters of locations that share similar features Feature used in SybilQuery: traffic statistics

October 1, 2009Ubicomp Tagging locations with traffic statistics (1/2) Naïve approach: Annotate locations with descriptive tags –Eg. parking lot, downtown office building, freeway –Laborious manual task Our approach: Automatically compute features using a database of regional traffic statistics –Dataset: Month-long GPS traces from the San Francisco Cabspotter project unique cabs; 529,533 trips –Compute traffic density τ l for each location from dataset

October 1, 2009Ubicomp Tagging locations with traffic statistics (2/2) Locations represented as QuadTree –Balances precision with scalability San Francisco Airport. Black blocks have higher densities

October 1, 2009Ubicomp Finding suitable endpoints using reverse geocoding Real endpoints do not start in non-driveable terrain Random point in geographic location Reverse Geocoding Street address closest to the random point

October 1, 2009Ubicomp Path Generator Consults an off-the-shelf navigation service –Our implementation uses Microsoft Multimap API to obtain waypoints Users may not always follow the shortest path to destination –Detours, road closures, user intention Computes multiple paths to the destination (with varying lengths) Uses a probability distribution to choose path

October 1, 2009Ubicomp Query Generator Triggered each time the user queries the LBS Simulates the motion of users along the Sybil paths Uses current traffic conditions to more accurately simulate user movement –Eg. Simulate slower movement if traffic is congested

October 1, 2009Ubicomp Outline Introduction SybilQuery Overview Design Challenges Implementation Evaluation and Results Conclusions and Future Work

October 1, 2009Ubicomp SybilQuery Implementation An interface akin to navigation systems Input: –The source and destination address for the trip –A security parameter k Number of Sybil users Query interface: –Integrated with Yahoo! Local Search

October 1, 2009Ubicomp Outline Introduction SybilQuery Overview Design Challenges Implementation Evaluation and Results Conclusions and Future Work

October 1, 2009Ubicomp Evaluation Goals 1.Privacy How indistinguishable are Sybil queries from real queries? 2.Performance Can Sybil queries be efficiently generated?

October 1, 2009Ubicomp Evaluation: Privacy User Study –Give the working system to adversarial users, who would try to break the system by find real user paths hidden between Sybil paths –15 volunteers Methodology –Pick real paths from the Cabspotter traces –Use SybilQuery to generate Sybil paths with different values of k

October 1, 2009Ubicomp Results from user study k# Questions# CorrectProbability

October 1, 2009Ubicomp User approaches to distinguish queries Contrasting rationale to guess real users –Circuitous paths –Prominent start/end location –Odd man out

October 1, 2009Ubicomp Evaluation: Performance Setup: –Server: 2.33 GHz Core2 Duo, 3 GB RAM, 250 GB SATA (7200 RPM) –Client: 1.73 GHz Pentium-M laptop, 512 MB RAM, Linux 2.6 –Privacy parameter k = 4 (unless otherwise specified) –Each experiment repeated 50 times Micro-benchmarks –One-time and once-per-trip costs –Query-response latency of SybilQuery Comparison with Spatial Cloaking

October 1, 2009Ubicomp One-time and once-per-trip costs One-time cost – preprocessing of traffic database –2 hours 16 mins (processed 529,533 trips) Once-per-trip costs – endpoint generation and path generation TaskAverage Time (sec)St dev (sec) Endpoint generation Path generation * * Includes network latency to query the Microsoft MultiMap API

October 1, 2009Ubicomp Query-response latency of SybilQuery Scales linearly with k (number of Sybil users) Sub-second latency for typical values of k

October 1, 2009Ubicomp Spatial Cloaking Spatial Cloaking – k-anonymity solution that uses anonymizers Users send their location to anonymizer Anonymizer computes cloaked region –Region where atleast k users are present client server anonymizer

October 1, 2009Ubicomp Performance Comparison with Spatial Cloaking Cloaked regions grow as users travel Cloaked regions grow as users travel SybilQuery overhead constant SybilQuery overhead constant Response Size as users travel

October 1, 2009Ubicomp Related Work Synthetic Locations for Privacy [Krumm 09, Kido 05] Spacial Cloaking [Gruteser and Grunwald 03, and others] Peer-to-peer Schemes [Chow 06, Ghinita 07] Private Information Retrieval (PIR) [Ghinita 08] Detailed list is available in paper

October 1, 2009Ubicomp Conclusions and Future Work SybilQuery: Efficient decentralized technique to hide user location from LBSes Experimental results demonstrate: –Sybil queries can be generated efficiently –Sybil queries resemble real user queries Future Work –Enhance SybilQuery to achieve stronger privacy guarantees, such as l-diversity, t-closeness and differential privacy

Thank You!