A Dummy-based Anonymization Method Based on User Trajectory with Pauses Ryo Kato, Mayu Iwata, Takahiro Hara, Akiyoshi Suzuki, Shojiro Nishio Osaka University.

Slides:



Advertisements
Similar presentations
TWO STEP EQUATIONS 1. SOLVE FOR X 2. DO THE ADDITION STEP FIRST
Advertisements

Advanced Piloting Cruise Plot.
Technische Universität München + Hewlett Packard Laboratories Dynamic Workload Management for Very Large Data Warehouses Juggling Feathers and Bowling.
A Mobility Model for Studying Wireless Communication Raymond Greenlaw Armstrong Atlantic State University Savannah, GA, USA Sanpawat Kantabutra Chiang.
Copyright © 2003 Pearson Education, Inc. Slide 1 Computer Systems Organization & Architecture Chapters 8-12 John D. Carpinelli.
Chapter 1 The Study of Body Function Image PowerPoint
1 Copyright © 2013 Elsevier Inc. All rights reserved. Appendix 01.
1 Copyright © 2010, Elsevier Inc. All rights Reserved Fig 2.1 Chapter 2.
STATISTICS HYPOTHESES TEST (III) Nonparametric Goodness-of-fit (GOF) tests Professor Ke-Sheng Cheng Department of Bioenvironmental Systems Engineering.
By D. Fisher Geometric Transformations. Reflection, Rotation, or Translation 1.
On Scheduling Vehicle-Roadside Data Access Yang Zhang Jing Zhao and Guohong Cao The Pennsylvania State University.
A Trajectory-Preserving Synchronization Method for Collaborative Visualization Lewis W.F. Li* Frederick W.B. Li** Rynson W.H. Lau** City University of.
All Rights Reserved, Copyright(C) 2007, Hitachi, Ltd. 1 Transport-layer optimization for thin-client systems Yukio OGAWA Systems Development Laboratory,
and 6.855J Cycle Canceling Algorithm. 2 A minimum cost flow problem , $4 20, $1 20, $2 25, $2 25, $5 20, $6 30, $
1 Preliminary results of the Environmental Data Exchange Network for Inland Waters (EDEN-IW) project Practical lessons. P. Haastrup.
Jeopardy Q 1 Q 6 Q 11 Q 16 Q 21 Q 2 Q 7 Q 12 Q 17 Q 22 Q 3 Q 8 Q 13
Jeopardy Q 1 Q 6 Q 11 Q 16 Q 21 Q 2 Q 7 Q 12 Q 17 Q 22 Q 3 Q 8 Q 13
Properties of Real Numbers CommutativeAssociativeDistributive Identity + × Inverse + ×
ALGEBRAIC EXPRESSIONS
2 pt 3 pt 4 pt 5 pt 1 pt 2 pt 3 pt 4 pt 5 pt 1 pt 2 pt 3 pt 4 pt 5 pt 1 pt 2 pt 3 pt 4 pt 5 pt 1 pt 2 pt 3 pt 4 pt 5 pt 1 pt ShapesPatterns Counting Number.
DIVIDING INTEGERS 1. IF THE SIGNS ARE THE SAME THE ANSWER IS POSITIVE 2. IF THE SIGNS ARE DIFFERENT THE ANSWER IS NEGATIVE.
MULTIPLYING MONOMIALS TIMES POLYNOMIALS (DISTRIBUTIVE PROPERTY)
MULT. INTEGERS 1. IF THE SIGNS ARE THE SAME THE ANSWER IS POSITIVE 2. IF THE SIGNS ARE DIFFERENT THE ANSWER IS NEGATIVE.
Addition Facts
Year 6 mental test 5 second questions
Year 6 mental test 10 second questions
Evaluating Window Joins over Unbounded Streams Author: Jaewoo Kang, Jeffrey F. Naughton, Stratis D. Viglas University of Wisconsin-Madison CS Dept. Presenter:
BT Wholesale October Creating your own telephone network WHOLESALE CALLS LINE ASSOCIATED.
MIMO Broadcast Scheduling with Limited Feedback Student: ( ) Director: 2008/10/2 1 Communication Signal Processing Lab.
1 Competitive Privacy: Secure Analysis on Integrated Sequence Data Raymond Chi-Wing Wong 1, Eric Lo 2 The Hong Kong University of Science and Technology.
Hash Tables.
Mobile IP: Multicast Service Reference: Multicast routing protocol in mobile networks; Hee- Sook Shin; Young-Joo Suh;, Proc. IEEE International Conference.
Mitigating Routing Misbehavior in Mobile Ad-Hoc Networks Reference: Mitigating Routing Misbehavior in Mobile Ad Hoc Networks, Sergio Marti, T.J. Giuli,
1 Undirected Breadth First Search F A BCG DE H 2 F A BCG DE H Queue: A get Undiscovered Fringe Finished Active 0 distance from A visit(A)
1 Application of for Predicting Indoor Airflow and Thermal Comfort.
IP Multicast Information management 2 Groep T Leuven – Information department 2/14 Agenda •Why IP Multicast ? •Multicast fundamentals •Intradomain.
VOORBLAD.
15. Oktober Oktober Oktober 2012.
Location-Based Social Networks Yu Zheng and Xing Xie Microsoft Research Asia Chapter 8 and 9 of the book Computing with Spatial Trajectories.
Name Convolutional codes Tomashevich Victor. Name- 2 - Introduction Convolutional codes map information to code bits sequentially by convolving a sequence.
Protecting Location Privacy: Optimal Strategy against Localization Attacks Reza Shokri, George Theodorakopoulos, Carmela Troncoso, Jean-Pierre Hubaux,
Differential Forms for Target Tracking and Aggregate Queries in Distributed Networks Rik Sarkar Jie Gao Stony Brook University 1.
1 Developing a Predictive Model for Internet Video Quality-of-Experience Athula Balachandran, Vyas Sekar, Aditya Akella, Srinivasan Seshan, Ion Stoica,
© 2012 National Heart Foundation of Australia. Slide 2.
Partitioning Social Networks for Fast Retrieval of Time-dependent Queries Mindi Yuan, David Stein, Berenice Carrasco, Joana Trindade, Yi Lu University.
Executional Architecture
Addition 1’s to 20.
25 seconds left…...
1 By Terence James Haydock Manufacturing Cell A simulated response in Arena.
Detecting Spam Zombies by Monitoring Outgoing Messages Zhenhai Duan Department of Computer Science Florida State University.
Week 1.
Analyzing Genes and Genomes
We will resume in: 25 Minutes.
©Brooks/Cole, 2001 Chapter 12 Derived Types-- Enumerated, Structure and Union.
Intracellular Compartments and Transport
1 Unit 1 Kinematics Chapter 1 Day
PSSA Preparation.
Essential Cell Biology
1 Trust-based Privacy Preservation for Peer-to-peer Data Sharing Y. Lu, W. Wang, D. Xu, and B. Bhargava yilu, wangwc, dxu, cs.purdue.edu Department.
Energy Generation in Mitochondria and Chlorplasts
Driving with Knowledge from the Physical World Jing Yuan, Yu Zheng Microsoft Research Asia.
T-Drive : Driving Directions Based on Taxi Trajectories Microsoft Research Asia University of North Texas Jing Yuan, Yu Zheng, Chengyang Zhang, Xing Xie,
Update Log Dissemination in Mobile Ad Hoc Networks Hideki HAYASHI Hitachi, Ltd., Central Research Laboratory (Grad. School of Info. Science and Tech.,
Sidewinder A Predictive Data Forwarding Protocol for Mobile Wireless Sensor Networks Matt Keally 1, Gang Zhou 1, Guoliang Xing 2 1 College of William and.
Privacy-Aware Personalization for Mobile Advertising
A Mobile Terminal Based Trajectory Preserving Strategy for Continuous Querying LBS Users Yunxia Feng, Peng Liu, Jianhui Zhang May , 2012 Hangzhou,
Location Privacy Protection for Location-based Services CS587x Lecture Department of Computer Science Iowa State University.
Presentation transcript:

A Dummy-based Anonymization Method Based on User Trajectory with Pauses Ryo Kato, Mayu Iwata, Takahiro Hara, Akiyoshi Suzuki, Shojiro Nishio Osaka University Yuki Arase, Xing Xie Microsoft Research Asia ACM SIGSPATIAL GIS 2012

User 1 Overview Location privacy in LBS Extending k-Anonymous algorithm Does not need a trusted third-party server K-Anonymous server User 1 User 2 User 3 User 4 LBS provider k requests k responses Actual location + dummy locations

Related Work [12] – Moving in a neighborhood – Moving in a limited neighborhood [14] – Circle-based dummy – Uniform grid-based dummy [18] – Location Traceable Tree(LT-tree)

Dummy-based Approach

Restrictions in Real World Environment Consistency of movements – Consider actual road map information in order to generate reasonable dummy trajectories Traceability Anonymous area

Proposed Approach - Assumptions User continuously sends location to LBS provider Moving with some distribution of speed Stopping at several locations for a certain time Movement plans are known in advance

Proposed Approach Three Steps 1.Determine base pause position and base pause start time 2.Determine sets of shared pause positions and shared pause start times 3.Determine dummy’s movements

Determining Base Pause Position and Base Pause Start Time T0123…8 0s s s s00301 total58615 Base pause grid: 3 Base pause start time: 20s

Determining Sets of Shared Pause Positions and Shared Paused Start Times Reachable Base pause position & Base pause start time Reachable

Determining Dummy’s Movements T=3 T=12 T=14 T=28 Reachable Mid-pause position Mid-pause position Shared pause position Shared pause position Shared pause position Base pause position Mid-pause position T=9 T=19 T=22

Evaluation Setup Network simulator MobiREAL

Evaluation Metrics

Methods Comparison Previous method [17] – Similar method without pauses Proposed method Proposed method (AAAR-80) – Size of anonymous area varies greatly, low AAAR- Count found in some situations – Dynamically adjust anonymous area size to achieve 80% AAAR-Count

Result – AAAR-Count

Result – AAAR-Ratio

Result – AAAR-80

Result – MTC

Conclusion & Future Work The proposed approach generated dummies that moved naturally Real world restrictions taken into consideration Reactive dummies, does not need to know user’s movement plan in advance Real world experiment with real humans

Comments Did not mention communication and computation cost Prefer distribution/CDF plot over AAAR- Count/AAAR-Size percentage plot No additional third-party server is required Location accuracy is preserved