Anonymous usage of location-based services through spatial and temporal cloaking

被引：945

作者：

Gruteser, M ^{[1
]}

Grunwald, D ^{[1
]}

机构：

[1] Univ Colorado, Dept Comp Sci, Boulder, CO 80309 USA

来源：

PROCEEDINGS OF MOBISYS 2003 | 2003年

关键词：

D O I：

10.1145/1066116.1189037

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

Advances in sensing and tracking technology enable location-based applications but they also create significant privacy risks. Anonymity can provide a high degree of privacy, save service users from dealing with service providers' privacy policies, and reduce the service providers' requirements for safeguarding private information. However, guaranteeing anonymous usage of location-based services requires that the precise location information transmitted by a user cannot be easily used to re-identify the subject. This paper presents a middleware architecture and algorithms that can be used by a centralized location broker service. The adaptive algorithms adjust the resolution of location information along spatial or temporal dimensions to meet specified anonymity constraints based on the entities who may be using location services within a given area. Using a model based on automotive traffic counts and cartographic material, we estimate the realistically expected spatial resolution for different anonymity constraints. The median resolution generated by our algorithms is 125 meters. Thus, anonymous location-based requests for urban areas would have the same accuracy currently needed for E-911 services; this would provide sufficient resolution for wayfinding, automated bus routing services and similar location-dependent services.

引用

页码：31 / 42

页数：12

共 31 条

[1]

ADAM NR, 1989, COMPUT SURV, V21, P515, DOI 10.1145/76894.76895

[2]

Agrawal D., 2001, Proceedings of the 20th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, P247, DOI DOI 10.1145/375551.375602

[3] Routing through the mist: Privacy preserving communication in ubiquitous computing environments [J].

Al-Muhtadi, J ;

Campbell, R ;

Kapadia, A ;

Mickunas, MD ;

Yi, S .

22ND INTERNATIONAL CONFERENCE ON DISTRIBUTED COMPUTING SYSTEMS, PROCEEDINGS, 2002, :74-83

[4]

[Anonymous], P 2 INT WORKSH MOB C

[5]

[Anonymous], P ACM CCS 00

[6]

[Anonymous], 2000, Privacy-preserving data mining, DOI DOI 10.1145/342009.335438

[7]

BISDIKIAN C, 2001, 1 WORKSH MOB COMM

[8] UNTRACEABLE ELECTRONIC MAIL, RETURN ADDRESSES, AND DIGITAL PSEUDONYMS [J].

CHAUM, DL .

COMMUNICATIONS OF THE ACM, 1981, 24 (02) :84-88

[9]

*CO DEP TRANSP, TRAFF STAT DAT

[10]

Cuellar J., 2002, INTERNET ENG TASK FO

← 1 2 3 4 →