On the formation of historically k-anonymous anonymity sets in a continuous LBS

6Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Privacy preservation in location based services (LBS) has received extensive attention in recent years. One of the less explored problems in this domain is associated with services that rely on continuous updates from the mobile object. Cloaking algorithms designed to hide user locations in single requests perform poorly in this scenario. The historical k-anonymity property is therefore enforced to ensure that all cloaking regions include at least k objects in common. However, the mobility of the objects can easily render increasingly bigger cloaking regions and degrade the quality of service. To this effect, this paper presents an algorithm to efficiently enforce historical k-anonymity by partitioning of an object's cloaking region. We further enforce some degree of directional similarity in the k common peers in order to prevent an excessive expansion of the cloaking region.© Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering 2010.

Cite

CITATION STYLE

APA

Dewri, R., Ray, I., Ray, I., & Whitley, D. (2010). On the formation of historically k-anonymous anonymity sets in a continuous LBS. In Lecture Notes of the Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering (Vol. 50 LNICST, pp. 71–88). https://doi.org/10.1007/978-3-642-16161-2_5

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free