Towards TTP-Free Lightweight Solution for Location Privacy Using Location-Based Anonymity Prediction
Document Type
Conference Proceeding
Language
eng
Format of Original
5 p.
Publication Date
11-2011
Publisher
Association for Computing Machinery
Source Publication
Proceedings of the 2011 ACM Research in Applied Computation Symposium
Source ISSN
9781450310871
Original Item ID
doi: 10.1145/2103380.2103440
Abstract
Location-based services are becoming increasingly popular with the proliferation of location aware devices. It is not possible to access location-based services and preserve privacy at the same time when the user provides exact location information. Cloaking or obfuscating location data is the only way to protect location-privacy. To do that, most of the systems use third party location anonymizer. In this paper, we propose a novel location privacy obfuscation framework without any trusted third party (TTP). Most of the existing solutions attempt to satisfy k-anonymity. In this paper we present the problems of using fixed and user defined k. In order to solve the problems our proposed solution aims to meet probabilistic k-anonymity. Based on historic data expected number of users present in a place is predicted which is used as probabilistic anonymity level. Thus we eliminate the use of any TTP which results into improvement of query-processing time and provides fewer query results for the user to process minimizing the overall response time. Users' exact location information is not revealed in either communication or computation process.
Recommended Citation
Ahamed, Sheikh Iqbal; Hasan, Chowdhury S.; Haque, Md. Munirul; and Gani, Md. O., "Towards TTP-Free Lightweight Solution for Location Privacy Using Location-Based Anonymity Prediction" (2011). Mathematics, Statistics and Computer Science Faculty Research and Publications. 115.
https://epublications.marquette.edu/mscs_fac/115
Comments
Published as part of the proceedings of the conference, the 2011 ACM Research in Applied Computation Symposium, 2011: 293-297. DOI.