An efficient method for privacy preserving location queries

Recently, the issue of privacy preserving location queries has attracted much research. However, there are few works focusing on the tradeoff between location privacy preservation and location query information collection. To tackle this kind of tradeoff, we propose the privacy persevering location...

Full description

Saved in:
Bibliographic Details
Published inFrontiers of Computer Science Vol. 6; no. 4; pp. 409 - 420
Main Authors LIU, Yubao, CHEN, Xiuwei, LI, Zhan, LI, Zhijie, WONG, Raymond Chi-Wing
Format Journal Article
LanguageEnglish
Published Heidelberg Higher Education Press 01.08.2012
SP Higher Education Press
Springer Nature B.V
Subjects
Online AccessGet full text
ISSN1673-7350
2095-2228
1673-7466
2095-2236
DOI10.1007/s11704-012-2838-8

Cover

Abstract Recently, the issue of privacy preserving location queries has attracted much research. However, there are few works focusing on the tradeoff between location privacy preservation and location query information collection. To tackle this kind of tradeoff, we propose the privacy persevering location query (PLQ), an efficient privacy preserving location query processing framework. This framework can enable the location-based query without revealing user location information. The framework can also facilitate location-based service providers to collect some information about the location based query, which is useful in practice. PLQ consists of three key components, namely, the location anonymizer at the client side, the privacy query processor at the server side, and an additional trusted third party connecting the client and server. The location anonymizer blurs the user location into a cloaked area based on a map-hierarchy. The map-hierarchy contains accurate regions that are partitioned according to real landforms. The privacy query processor deals with the requested nearest-neighbor (NN) location based query. A new convex hull of polygon (CHP) algorithm is proposed for nearest-neighbor queries using a polygon cloaked area. The experimental results show that our algorithms can efficiently process location based queries.
AbstractList Recently, the issue of privacy preserving loca- tion queries has attracted much research. However, there are few works focusing on the tradeoff between location privacy preservation and location query information collection. To tackle this kind of tradeoff, we propose the privacy persevering location query (PLQ), an efficient privacy pre-serving location query processing framework. This frame- work can enable the location-based query without revealing user location information. The framework can also facilitate location-based service providers to collect some information about the location based query, which is useful in practice. PLQ consists of three key components, namely, the location anonymizer at the client side, the privacy query processor at the server side, and an additional trusted third party connect- ing the client and server. The location anonymizer blurs the user location into a cloaked area based on a map-hierarchy. The map-hierarchy contains accurate regions that are parti- tioned according to real landforms. The privacy query pro- cessor deals with the requested nearest-neighbor (NN) loca- tion based query. A new convex hull of polygon (CHP) algo- rithm is proposed for nearest-neighbor queries using a poly- gon cloaked area. The experimental results show that our al- gorithms can efficiently process location based queries.
Recently, the issue of privacy preserving location queries has attracted much research. However, there are few works focusing on the tradeoff between location privacy preservation and location query information collection. To tackle this kind of tradeoff, we propose the privacy persevering location query (PLQ), an efficient privacy preserving location query processing framework. This framework can enable the location-based query without revealing user location information. The framework can also facilitate location-based service providers to collect some information about the location based query, which is useful in practice. PLQ consists of three key components, namely, the location anonymizer at the client side, the privacy query processor at the server side, and an additional trusted third party connecting the client and server. The location anonymizer blurs the user location into a cloaked area based on a map-hierarchy. The map-hierarchy contains accurate regions that are partitioned according to real landforms. The privacy query processor deals with the requested nearest-neighbor (NN) location based query. A new convex hull of polygon (CHP) algorithm is proposed for nearest-neighbor queries using a polygon cloaked area. The experimental results show that our algorithms can efficiently process location based queries.
Author Yubao LIU Xiuwei CHEN Zhan LI Zhijie LI Raymond Chi-Wing WONG
AuthorAffiliation Department of Computer Science, Sun Yat-Sen University, Guangzhou 510006, China Department of Computer Science, Jinan University, Guangzhou 510632, China Department of Computer Science and Engineering, The Hong Kong University of Science and Technology, Hong Kong, China
Author_xml – sequence: 1
  givenname: Yubao
  surname: LIU
  fullname: LIU, Yubao
  email: liuyubao@mail.sysu.edu.cn
  organization: Department of Computer Science, Sun Yat-Sen University, Guangzhou 510006, China
– sequence: 2
  givenname: Xiuwei
  surname: CHEN
  fullname: CHEN, Xiuwei
  organization: Department of Computer Science, Sun Yat-Sen University, Guangzhou 510006, China
– sequence: 3
  givenname: Zhan
  surname: LI
  fullname: LI, Zhan
  organization: Department of Computer Science, Jinan University, Guangzhou 510632, China
– sequence: 4
  givenname: Zhijie
  surname: LI
  fullname: LI, Zhijie
  organization: Department of Computer Science, Sun Yat-Sen University, Guangzhou 510006, China
– sequence: 5
  givenname: Raymond Chi-Wing
  surname: WONG
  fullname: WONG, Raymond Chi-Wing
  organization: Department of Computer Science and Engineering, The Hong Kong University of Science and Technology, Hong Kong, China
BookMark eNp9kEtLAzEUhYNU0FZ_gLsR16O5SSYPXEnxBYIbXYdpJplGaqLJKPTfmzpVwUVX9y7Od8-5Z4omIQaL0Angc8BYXGQAgVmNgdREUlnLPXQIXNBaMM4nPztt8AGa5vyCMSeE40N0eRUq65w33oaherXDMnaVi6l6S_6zNesybbbp04e-WkXTDj6G6v3DJm_zEdp37Srb4-2coeeb66f5Xf3weHs_v3qoDVUw1EooB851lgN0VLHOEXBMYDBGNZ3qDCwEa7FYOEM5d8owSmDRGNlYbCRVdIbOxrtvKRbrPOiX-JFCsdREgRQgOIeiEqPKpJhzsk4bP3znHVLrVxqw3jSlx6Z0aUpvmtKykPCPLM-_tmm9kyEjk4s29Db9ZdoFyRFa-n5pk-025WbtUsnobdqNnm4zLmPo34vlb0hGVEOkYvQL3W2Z9g
CitedBy_id crossref_primary_10_1109_TDSC_2020_2974218
crossref_primary_10_1109_JIOT_2016_2553083
Cites_doi 10.1109/ICDE.2007.367904
10.14778/1453856.1453948
10.1109/ICDCS.2005.48
10.1145/10515.10549
10.1145/1367497.1367531
10.1142/S021848850200165X
10.1145/1653771.1653808
10.1145/1242572.1242623
10.1109/MPRV.2003.1186725
10.1109/ICDE.2008.4497459
10.1145/1066116.1189037
10.1109/ICDE.2005.269
10.1007/978-3-540-72524-4_75
10.14778/1687627.1687745
10.1109/ICDE.2009.106
10.1145/1376616.1376631
10.1007/978-3-642-20149-3_10
10.1109/TMC.2007.1062
10.1145/990064.990087
10.1145/872757.872823
10.1145/602259.602266
10.1016/j.sysarc.2009.01.003
10.1145/1183471.1183500
10.1109/ISVD.2006.25
10.1007/11428572_10
ContentType Journal Article
Copyright Copyright reserved, 2014, Higher Education Press and Springer-Verlag Berlin Heidelberg
Higher Education Press and Springer-Verlag Berlin Heidelberg 2012
Higher Education Press and Springer-Verlag Berlin Heidelberg 2012.
Copyright_xml – notice: Copyright reserved, 2014, Higher Education Press and Springer-Verlag Berlin Heidelberg
– notice: Higher Education Press and Springer-Verlag Berlin Heidelberg 2012
– notice: Higher Education Press and Springer-Verlag Berlin Heidelberg 2012.
DBID 2RA
92L
CQIGP
W92
~WA
AAYXX
CITATION
8FE
8FG
AFKRA
ARAPS
AZQEC
BENPR
BGLVJ
CCPQU
DWQXO
GNUQQ
HCIFZ
JQ2
K7-
P5Z
P62
PHGZM
PHGZT
PKEHL
PQEST
PQGLB
PQQKQ
PQUKI
DOI 10.1007/s11704-012-2838-8
DatabaseName 维普期刊资源整合服务平台
中文科技期刊数据库-CALIS站点
维普中文期刊数据库
中文科技期刊数据库-工程技术
中文科技期刊数据库- 镜像站点
CrossRef
ProQuest SciTech Collection
ProQuest Technology Collection
ProQuest Central UK/Ireland
Advanced Technologies & Computer Science Collection
ProQuest Central Essentials - QC
ProQuest Central
ProQuest Technology Collection
ProQuest One
ProQuest Central Korea
ProQuest Central Student
SciTech Premium Collection
ProQuest Computer Science Collection
Computer Science Database
Advanced Technologies & Aerospace Database
ProQuest Advanced Technologies & Aerospace Collection
ProQuest Central Premium
ProQuest One Academic
ProQuest One Academic Middle East (New)
ProQuest One Academic Eastern Edition (DO NOT USE)
ProQuest One Applied & Life Sciences
ProQuest One Academic
ProQuest One Academic UKI Edition
DatabaseTitle CrossRef
Advanced Technologies & Aerospace Collection
Computer Science Database
ProQuest Central Student
Technology Collection
ProQuest One Academic Middle East (New)
ProQuest Advanced Technologies & Aerospace Collection
ProQuest Central Essentials
ProQuest Computer Science Collection
ProQuest One Academic Eastern Edition
SciTech Premium Collection
ProQuest One Community College
ProQuest Technology Collection
ProQuest SciTech Collection
ProQuest Central
Advanced Technologies & Aerospace Database
ProQuest One Applied & Life Sciences
ProQuest One Academic UKI Edition
ProQuest Central Korea
ProQuest Central (New)
ProQuest One Academic
ProQuest One Academic (New)
DatabaseTitleList


Advanced Technologies & Aerospace Collection
Database_xml – sequence: 1
  dbid: 8FG
  name: ProQuest Technology Collection
  url: https://search.proquest.com/technologycollection1
  sourceTypes: Aggregation Database
DeliveryMethod fulltext_linktorsrc
Discipline Computer Science
DocumentTitleAlternate An efficient method for privacy preserving location queries
EISSN 1673-7466
2095-2236
EndPage 420
ExternalDocumentID 10_1007_s11704_012_2838_8
10.1007/s11704-012-2838-8
42952894
GroupedDBID -59
-5G
-BR
-Y2
1-T
2LR
2RA
2VQ
2~H
4.4
6NX
8TC
92L
95~
AABHQ
AARTL
AAWCG
ABFTV
ABJNI
ABJOX
ABKCH
ABMNI
ABTMW
ACGFS
ACOMO
ADHHG
ADURQ
ADYFF
AEGAL
AEGNC
AEKMD
AEOHA
AFGCZ
AGDGC
AGQMX
ALMA_UNASSIGNED_HOLDINGS
AMKLP
AMYQR
BA0
BGNMA
CAG
COF
CQIGP
CS3
DPUIP
EBS
EJD
GQ6
HF~
HG6
HLICF
HMJXF
HRMNR
IJ-
I~X
J9A
JBSCW
KOV
M4Y
NQJWS
NU0
P9O
QOS
R9I
ROL
RPX
RSV
S1Z
S27
SCO
SDH
SOJ
T13
U2A
UG4
VC2
W92
WK8
~A9
~WA
-EM
.VR
06D
0VY
2J2
2JN
2JY
2KG
2KM
30V
406
408
40E
5VS
95-
95.
96X
AAFGU
AAIAL
AAJKR
AANZL
AARHV
AATLR
AATNV
AATVU
AAUYE
AAYFA
AAYIU
AAYQN
AAYTO
ABDZT
ABECU
ABFGW
ABFTD
ABHQN
ABKAS
ABMQK
ABNWP
ABQBU
ABSXP
ABTEG
ABTHY
ABTKH
ABWNU
ABXPI
ACAOD
ACBMV
ACBRV
ACBXY
ACHSB
ACHXU
ACIPQ
ACKNC
ACMDZ
ACMLO
ACOKC
ACSNA
ACTTH
ACVWB
ACWMK
ACZOJ
ADHIR
ADINQ
ADKNI
ADKPE
ADMDM
ADOXG
ADRFC
ADTPH
ADZKW
AEBTG
AEFTE
AEJHL
AEJRE
AEMSY
AENEX
AEPYU
AESKC
AESTI
AETLH
AEVLU
AEVTX
AEXYK
AFKRA
AFLOW
AFNRJ
AFQWF
AFWTZ
AFZKB
AGAYW
AGGBP
AGJBK
AGMZJ
AGQEE
AGWIL
AGWZB
AGYKE
AHBYD
AHKAY
AHSBF
AHYZX
AIAKS
AIIXL
AILAN
AIMYW
AITGF
AJBLW
AJDOV
AJRNO
AJZVZ
ALWAN
AMXSW
AMYLF
AOCGG
ARAPS
ARMRJ
AXYYD
B-.
BDATZ
BENPR
BGLVJ
CCPQU
CSCUP
DDRTE
DNIVK
EBLON
EIOEI
ESBYG
FERAY
FFXSO
FIGPU
FINBP
FNLPD
FRRFC
FSGXE
FWDCC
GGCAI
GGRSB
GJIRD
GNWQR
GQ7
HCIFZ
HZ~
IKXTQ
IWAJR
IXD
I~Z
J-C
JZLTJ
K7-
LLZTM
MA-
NPVJJ
O9J
P4S
PF0
PT4
R89
S16
S3B
SAP
SCL
SHX
SISQX
SNE
SNPRN
SNX
SOHCF
SPISZ
SRMVM
SSLCW
STPWE
SZN
TSG
TUC
UNUBA
UOJIU
UTJUX
UZXMN
VFIZW
W48
YLTOR
Z7R
Z7X
Z81
Z83
Z88
ZMTXR
0R~
AACDK
AAJBT
AAPKM
AASML
AAXDM
AAYXX
AAYZH
ABAKF
ABBRH
ABDBE
ABFSG
ABRTQ
ACDTI
ACPIV
ACSTC
AEFQL
AEZWR
AFBBN
AFDZB
AFHIU
AGRTI
AHPBZ
AHWEU
AIGIU
AIXLP
ATHPR
AYFIA
CITATION
PHGZM
PHGZT
PQGLB
PUEGO
SJYHP
8FE
8FG
AFFHD
AZQEC
DWQXO
GNUQQ
JQ2
P62
PKEHL
PQEST
PQQKQ
PQUKI
ID FETCH-LOGICAL-c391t-979f1ffde611d394df21f4701cc95d9dc1b74a07bfc366f9c4321b5c85e0c8393
IEDL.DBID BENPR
ISSN 1673-7350
2095-2228
IngestDate Thu Oct 30 09:35:37 EDT 2025
Wed Oct 01 06:35:03 EDT 2025
Thu Apr 24 22:58:47 EDT 2025
Fri Feb 21 02:33:36 EST 2025
Tue Feb 27 04:42:59 EST 2024
Wed Feb 14 10:45:17 EST 2024
IsDoiOpenAccess true
IsOpenAccess true
IsPeerReviewed true
IsScholarly true
Issue 4
Keywords privacy preservation
location based service (LBS)
nearest-neighbor (NN) location query
Language English
License This is an open-access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.
http://www.springer.com/tdm
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c391t-979f1ffde611d394df21f4701cc95d9dc1b74a07bfc366f9c4321b5c85e0c8393
Notes location based service (LBS), privacy preserva- tion, nearest-neighbor (NN) location query
Recently, the issue of privacy preserving loca- tion queries has attracted much research. However, there are few works focusing on the tradeoff between location privacy preservation and location query information collection. To tackle this kind of tradeoff, we propose the privacy persevering location query (PLQ), an efficient privacy pre-serving location query processing framework. This frame- work can enable the location-based query without revealing user location information. The framework can also facilitate location-based service providers to collect some information about the location based query, which is useful in practice. PLQ consists of three key components, namely, the location anonymizer at the client side, the privacy query processor at the server side, and an additional trusted third party connect- ing the client and server. The location anonymizer blurs the user location into a cloaked area based on a map-hierarchy. The map-hierarchy contains accurate regions that are parti- tioned according to real landforms. The privacy query pro- cessor deals with the requested nearest-neighbor (NN) loca- tion based query. A new convex hull of polygon (CHP) algo- rithm is proposed for nearest-neighbor queries using a poly- gon cloaked area. The experimental results show that our al- gorithms can efficiently process location based queries.
11-5731/TP
Document accepted on :2011-11-30
Document received on :2011-04-19
privacy preservation
location based service (LBS)
nearest-neighbor (NN) location query
ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
OpenAccessLink https://journal.hep.com.cn/fcs/EN/10.1007/s11704-012-2838-8
PQID 2918717661
PQPubID 2044369
PageCount 12
ParticipantIDs proquest_journals_2918717661
crossref_citationtrail_10_1007_s11704_012_2838_8
crossref_primary_10_1007_s11704_012_2838_8
springer_journals_10_1007_s11704_012_2838_8
higheredpress_frontiers_10_1007_s11704_012_2838_8
chongqing_primary_42952894
ProviderPackageCode CITATION
AAYXX
PublicationCentury 2000
PublicationDate 2012-08-01
PublicationDateYYYYMMDD 2012-08-01
PublicationDate_xml – month: 08
  year: 2012
  text: 2012-08-01
  day: 01
PublicationDecade 2010
PublicationPlace Heidelberg
PublicationPlace_xml – name: Heidelberg
PublicationSubtitle Selected Publications from Chinese Universities
PublicationTitle Frontiers of Computer Science
PublicationTitleAbbrev Front Comput Sci
Front. Comput. Sci
PublicationTitleAlternate Frontiers of Computer Science in China
PublicationYear 2012
Publisher Higher Education Press
SP Higher Education Press
Springer Nature B.V
Publisher_xml – name: Higher Education Press
– name: SP Higher Education Press
– name: Springer Nature B.V
References Ackerman L, Kempf J, Miki T. Wireless location privacy: a report on law and policy in the United States, the Europrean Union, and Japan. Technical Report DCL-TR 2003-001, DoCoMo Commuinication Laboratories, USA, 2003
Gruteser M, Grunwald D. Anonymous usage of location-based services through spatial and temporal cloaking. In: Proceedings of the 1st International Conference on Mobile Systems, Applications and Services. 2003, 31–42
Mokbel M, Chow C, Aref W. The new Casper: query processing for location services without compromising privacy. In: Proceedings of the 32nd International Conference on Very Large Data Bases. 2006, 763–774
Wong R CW, Liu Y, Yin J, Huang Z, Fu AWC, Pei J. (α, k)-anonymity based privacy preservation by lossy join. In: Proceedings of the Joint 9th Asia-Pacific Web and the 8th International Conference onWeb-age Information Management. 2007, 733–744
SweeneyL.Achieving k-anonymity privacy protection using generalization and suppressionInternational Journal on Uncertainty, Fuzziness and Knowledge-Based Systems200210557158819482001084.6853710.1142/S021848850200165X
Hu H, Xu J. Non-exposure location anonymity. In: Proceedings of the IEEE 25th International Conference on Data Engineering. 2009, 1120–1131
Chen J, Cheng R. Efficient evaluation of imprecise location-dependent queries. In: Proceedings of IEEE the 23rd International Conference on Data Engineering. 2007, 586–595
Kido H, Yanagisawa Y, Satoh T. An anonymous communication technique using dummies for location-based services. In: Proceedings of the 2005 International Conference on Pervasive Services. 2005, 88–97
ArdagnaC. A.CremoniniM.GianiniG.Landscape-aware locationprivacy protection in location-based servicesJournal of Systems Architecture200955424325410.1016/j.sysarc.2009.01.003
Cheng R, Kalashnikov D V, Prabhakar S. Evaluating probabilistic queries over imprecise data. In: Proceedings of the 2003 ACM SIGMOD International Conference on Management of Data. 2003, 551–562
BuY.FuA. W. C.WongR. C. W.ChenL.LiJ.Privacy preserving serial data publishing by role compositionProceedings of the VLDB Endowment200811845856
Ghinita G, Kalnis P, Skiadopoulos S. PRIVE: anonymous locationbased queries in distributed mobile systems. In: Proceedings of the 16th International Conference on World Wide Web. 2007, 371–389
Chow C Y, Mokbel M F, Liu X. A peer-to-peer spatial cloaking algorithm for anonymous location-based services. In: Proceedings of the 14th annual ACM international symposium on Advances in geographic information systems. 2006, 171–178
Guttman A. R-trees: a dynamic index structure for spatial searching. In: Proceedings of the 1984 ACM SIGMOD International Conference on Management of Data. 1984, 47–57
GedikB.LiuL.Protecting location privacy with personalized kanonymity: architecture and algorithmsIEEE Transactions on Mobile Computing20087111810.1109/TMC.2007.1062
Barkhuus L, Dey A K. Location-based services for mobile telephony: a study of users’ privacy concerns. In: Proceedings of IFIP TC13 International Conference on Human-Computer Interaction. 2003
Duckham M, Kulik L. A formal model of obfuscation and negotiation for location privacy. In: Proceedings of the 3rd International Conference on Pervasive Computing. 2005, 152–170
WangT.LiuL.Privacy-aware mobile services over road networksProceedings of the VLDB Endowment20092110421053
Mioc D, Anton F, Gold C M, Moulin B. Map updates in a dynamic Voronoi data structure. In: Proceedings of the 3rd International Symposium on Voronoi Diagrams in Science and Engineering. 2006, 264–269
Pan X, Meng X, Xu J. Distortion-based anonymity for continuous queries in location-based mobile services. In: Proceedings of the 17th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems. 2009, 256–265
Gedik B, Liu L. Location privacy in mobile systems: a personalized anonymization model. In: Proceedings of the 25th IEEE International Conference on Distributed Computing Systems. 2005, 620–629
Hong J I, Landay J A. An architecture for privacy-sensitive ubiquitous computing. In: Proceedings of the 2nd International Conference on Mobile Systems, Applications, and Services. 2004, 177–189
Ghinita G, Kalnis P, Khoshgozaran A, Shahabi C, Tan K L. Private queries in location based services: anonymizers are not necessary. In: Proceedings of the 2008 ACM SIGMOD International Conference on Management of Data. 2008, 121–132
BeresfordA. R.StajanoF.Location privacy in pervasive computingIEEE Pervasive Computing200321465510.1109/MPRV.2003.1186725
Fortune S. A sweepline algorithm for voronoi diagrams. In: Proceedings of the 2nd Annual Symposium on Computational Geometry. 1986, 313–322
Bamba B, Liu L, Pesti P, Wang T. Supporting anonymous location queries in mobile environments with privacy grid. In: Proceedings of the 17th International Conference on World WideWeb. 2008, 237–246
Zhou B, Pei J. Preserving privacy in social networks against neighborhood attacks. In: Proceedings of the IEEE 24th International Conference on Data Engineering. 2008, 506–515
Tian X, Sha C, Wang X, Zhou A. Privacy preserving query processing on secret share based data storage. In: Proceedings of the 16th International Conference on Database Systems for Advanced Applications, Volume Part I. 2011, 108–122
2838_CR15
L. Ackerman (2838_CR1) 2003
2838_CR12
2838_CR11
2838_CR10
2838_CR19
2838_CR18
2838_CR17
B. Gedik (2838_CR4) 2008; 7
2838_CR16
T. Wang (2838_CR6) 2009; 2
2838_CR26
2838_CR25
C. A. Ardagna (2838_CR14) 2009; 55
2838_CR23
2838_CR22
2838_CR21
2838_CR20
2838_CR28
2838_CR2
2838_CR27
2838_CR5
2838_CR7
2838_CR8
2838_CR9
Y. Bu (2838_CR24) 2008; 1
A. R. Beresford (2838_CR3) 2003; 2
L. Sweeney (2838_CR13) 2002; 10
References_xml – reference: GedikB.LiuL.Protecting location privacy with personalized kanonymity: architecture and algorithmsIEEE Transactions on Mobile Computing20087111810.1109/TMC.2007.1062
– reference: WangT.LiuL.Privacy-aware mobile services over road networksProceedings of the VLDB Endowment20092110421053
– reference: Gedik B, Liu L. Location privacy in mobile systems: a personalized anonymization model. In: Proceedings of the 25th IEEE International Conference on Distributed Computing Systems. 2005, 620–629
– reference: Chow C Y, Mokbel M F, Liu X. A peer-to-peer spatial cloaking algorithm for anonymous location-based services. In: Proceedings of the 14th annual ACM international symposium on Advances in geographic information systems. 2006, 171–178
– reference: Ghinita G, Kalnis P, Skiadopoulos S. PRIVE: anonymous locationbased queries in distributed mobile systems. In: Proceedings of the 16th International Conference on World Wide Web. 2007, 371–389
– reference: Pan X, Meng X, Xu J. Distortion-based anonymity for continuous queries in location-based mobile services. In: Proceedings of the 17th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems. 2009, 256–265
– reference: Gruteser M, Grunwald D. Anonymous usage of location-based services through spatial and temporal cloaking. In: Proceedings of the 1st International Conference on Mobile Systems, Applications and Services. 2003, 31–42
– reference: SweeneyL.Achieving k-anonymity privacy protection using generalization and suppressionInternational Journal on Uncertainty, Fuzziness and Knowledge-Based Systems200210557158819482001084.6853710.1142/S021848850200165X
– reference: Tian X, Sha C, Wang X, Zhou A. Privacy preserving query processing on secret share based data storage. In: Proceedings of the 16th International Conference on Database Systems for Advanced Applications, Volume Part I. 2011, 108–122
– reference: Fortune S. A sweepline algorithm for voronoi diagrams. In: Proceedings of the 2nd Annual Symposium on Computational Geometry. 1986, 313–322
– reference: Hong J I, Landay J A. An architecture for privacy-sensitive ubiquitous computing. In: Proceedings of the 2nd International Conference on Mobile Systems, Applications, and Services. 2004, 177–189
– reference: Mokbel M, Chow C, Aref W. The new Casper: query processing for location services without compromising privacy. In: Proceedings of the 32nd International Conference on Very Large Data Bases. 2006, 763–774
– reference: BuY.FuA. W. C.WongR. C. W.ChenL.LiJ.Privacy preserving serial data publishing by role compositionProceedings of the VLDB Endowment200811845856
– reference: Mioc D, Anton F, Gold C M, Moulin B. Map updates in a dynamic Voronoi data structure. In: Proceedings of the 3rd International Symposium on Voronoi Diagrams in Science and Engineering. 2006, 264–269
– reference: ArdagnaC. A.CremoniniM.GianiniG.Landscape-aware locationprivacy protection in location-based servicesJournal of Systems Architecture200955424325410.1016/j.sysarc.2009.01.003
– reference: Ackerman L, Kempf J, Miki T. Wireless location privacy: a report on law and policy in the United States, the Europrean Union, and Japan. Technical Report DCL-TR 2003-001, DoCoMo Commuinication Laboratories, USA, 2003
– reference: Bamba B, Liu L, Pesti P, Wang T. Supporting anonymous location queries in mobile environments with privacy grid. In: Proceedings of the 17th International Conference on World WideWeb. 2008, 237–246
– reference: BeresfordA. R.StajanoF.Location privacy in pervasive computingIEEE Pervasive Computing200321465510.1109/MPRV.2003.1186725
– reference: Wong R CW, Liu Y, Yin J, Huang Z, Fu AWC, Pei J. (α, k)-anonymity based privacy preservation by lossy join. In: Proceedings of the Joint 9th Asia-Pacific Web and the 8th International Conference onWeb-age Information Management. 2007, 733–744
– reference: Duckham M, Kulik L. A formal model of obfuscation and negotiation for location privacy. In: Proceedings of the 3rd International Conference on Pervasive Computing. 2005, 152–170
– reference: Guttman A. R-trees: a dynamic index structure for spatial searching. In: Proceedings of the 1984 ACM SIGMOD International Conference on Management of Data. 1984, 47–57
– reference: Cheng R, Kalashnikov D V, Prabhakar S. Evaluating probabilistic queries over imprecise data. In: Proceedings of the 2003 ACM SIGMOD International Conference on Management of Data. 2003, 551–562
– reference: Barkhuus L, Dey A K. Location-based services for mobile telephony: a study of users’ privacy concerns. In: Proceedings of IFIP TC13 International Conference on Human-Computer Interaction. 2003
– reference: Hu H, Xu J. Non-exposure location anonymity. In: Proceedings of the IEEE 25th International Conference on Data Engineering. 2009, 1120–1131
– reference: Kido H, Yanagisawa Y, Satoh T. An anonymous communication technique using dummies for location-based services. In: Proceedings of the 2005 International Conference on Pervasive Services. 2005, 88–97
– reference: Zhou B, Pei J. Preserving privacy in social networks against neighborhood attacks. In: Proceedings of the IEEE 24th International Conference on Data Engineering. 2008, 506–515
– reference: Ghinita G, Kalnis P, Khoshgozaran A, Shahabi C, Tan K L. Private queries in location based services: anonymizers are not necessary. In: Proceedings of the 2008 ACM SIGMOD International Conference on Management of Data. 2008, 121–132
– reference: Chen J, Cheng R. Efficient evaluation of imprecise location-dependent queries. In: Proceedings of IEEE the 23rd International Conference on Data Engineering. 2007, 586–595
– ident: 2838_CR18
  doi: 10.1109/ICDE.2007.367904
– volume: 1
  start-page: 845
  issue: 1
  year: 2008
  ident: 2838_CR24
  publication-title: Proceedings of the VLDB Endowment
  doi: 10.14778/1453856.1453948
– ident: 2838_CR12
  doi: 10.1109/ICDCS.2005.48
– ident: 2838_CR27
  doi: 10.1145/10515.10549
– ident: 2838_CR15
  doi: 10.1145/1367497.1367531
– volume: 10
  start-page: 571
  issue: 5
  year: 2002
  ident: 2838_CR13
  publication-title: International Journal on Uncertainty, Fuzziness and Knowledge-Based Systems
  doi: 10.1142/S021848850200165X
– ident: 2838_CR22
  doi: 10.1145/1653771.1653808
– ident: 2838_CR5
  doi: 10.1145/1242572.1242623
– volume: 2
  start-page: 46
  issue: 1
  year: 2003
  ident: 2838_CR3
  publication-title: IEEE Pervasive Computing
  doi: 10.1109/MPRV.2003.1186725
– ident: 2838_CR11
– ident: 2838_CR21
  doi: 10.1109/ICDE.2008.4497459
– ident: 2838_CR10
  doi: 10.1145/1066116.1189037
– ident: 2838_CR7
  doi: 10.1109/ICDE.2005.269
– ident: 2838_CR23
  doi: 10.1007/978-3-540-72524-4_75
– volume: 2
  start-page: 1042
  issue: 1
  year: 2009
  ident: 2838_CR6
  publication-title: Proceedings of the VLDB Endowment
  doi: 10.14778/1687627.1687745
– ident: 2838_CR20
  doi: 10.1109/ICDE.2009.106
– ident: 2838_CR17
  doi: 10.1145/1376616.1376631
– volume-title: Technical Report DCL-TR 2003-001
  year: 2003
  ident: 2838_CR1
– ident: 2838_CR25
  doi: 10.1007/978-3-642-20149-3_10
– volume: 7
  start-page: 1
  issue: 1
  year: 2008
  ident: 2838_CR4
  publication-title: IEEE Transactions on Mobile Computing
  doi: 10.1109/TMC.2007.1062
– ident: 2838_CR8
  doi: 10.1145/990064.990087
– ident: 2838_CR19
  doi: 10.1145/872757.872823
– ident: 2838_CR26
  doi: 10.1145/602259.602266
– ident: 2838_CR2
– volume: 55
  start-page: 243
  issue: 4
  year: 2009
  ident: 2838_CR14
  publication-title: Journal of Systems Architecture
  doi: 10.1016/j.sysarc.2009.01.003
– ident: 2838_CR16
  doi: 10.1145/1183471.1183500
– ident: 2838_CR28
  doi: 10.1109/ISVD.2006.25
– ident: 2838_CR9
  doi: 10.1007/11428572_10
SSID ssj0062260
ssj0002025522
Score 1.9166318
Snippet Recently, the issue of privacy preserving loca- tion queries has attracted much research. However, there are few works focusing on the tradeoff between...
Recently, the issue of privacy preserving location queries has attracted much research. However, there are few works focusing on the tradeoff between location...
SourceID proquest
crossref
springer
higheredpress
chongqing
SourceType Aggregation Database
Enrichment Source
Index Database
Publisher
StartPage 409
SubjectTerms Algorithms
Computer Science
Convexity
Landforms
location based service (LBS)
Location based services
Microprocessors
nearest-neighbor (NN) location query
Polygons
Privacy
privacy preservation
Queries
Query processing
Research Article
Servers
Tradeoffs
Trusted third parties
位置信息
位置查询
最近邻查询
服务供应商
服务器端
查询信息
查询处理器
隐私保护
SummonAdditionalLinks – databaseName: SpringerLink Journals (ICM)
  dbid: U2A
  link: http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1LSwMxEA5aL4L4Flsf5OBJWWiy2ewGT0UsRdCThd5C82oPslVbBf-9M-luS0ULnjc7gXl-k0xmCLnyThplwL59kQ0TIQRPlHAykSEFl8ytCnE24OOT7PXFwyAbVO-4p3W1e30lGT318rEby2PFBD4nBistNslWht28QIn7vLM4WOGIkvmih5QEfIEHLRywRILHHfXV5m8kscHCeFKO3mD7lUC1M45VF97F6tQVNPrjAjXGpe4-2a0AJe3MNeCAbPjykOzVwxpoZbtH5LZTUh_7RUCYofPB0RQQKwW6n0P7RXFPdBzliGKAQ4FR2BxT6WPS794_3_WSanJCYlPFZonKgcchOC8ZcykwP3AWRN5m1qrMKWeZycWwnZtgUymDsiLlzGS2yHzbAmRKT0ijnJT-lFDngWfSFcZBpuaHxmQ-dQrWSy8C-IMmaS1Ypl_nHTI0BLkMMjnRJO2ah9pWPcdx9MWLXnZLRhFoEIFGEeiiSa4Xv9Tk1ixmK4LRAbs-4Azxdf-c18LTlb1ONVcMMsccwEqT3NQCXX7-k1jrX6vPyDZHZYv1g-ekMXv_8BeAaWbmMurwNy1p6XU
  priority: 102
  providerName: Springer Nature
Title An efficient method for privacy preserving location queries
URI http://lib.cqvip.com/qk/71018X/201204/42952894.html
https://journal.hep.com.cn/fcs/EN/10.1007/s11704-012-2838-8
https://link.springer.com/article/10.1007/s11704-012-2838-8
https://www.proquest.com/docview/2918717661
Volume 6
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVLSH
  databaseName: SpringerLink Journals
  customDbUrl:
  mediaType: online
  eissn: 1673-7466
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0002025522
  issn: 1673-7350
  databaseCode: AFBBN
  dateStart: 20070201
  isFulltext: true
  providerName: Library Specific Holdings
– providerCode: PRVPQU
  databaseName: ProQuest Central
  customDbUrl: http://www.proquest.com/pqcentral?accountid=15518
  eissn: 1673-7466
  dateEnd: 20241101
  omitProxy: true
  ssIdentifier: ssj0002025522
  issn: 1673-7350
  databaseCode: BENPR
  dateStart: 20070201
  isFulltext: true
  titleUrlDefault: https://www.proquest.com/central
  providerName: ProQuest
– providerCode: PRVAVX
  databaseName: SpringerLINK - Czech Republic Consortium
  customDbUrl:
  eissn: 1673-7466
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0002025522
  issn: 1673-7350
  databaseCode: AGYKE
  dateStart: 20070101
  isFulltext: true
  titleUrlDefault: http://link.springer.com
  providerName: Springer Nature
– providerCode: PRVAVX
  databaseName: SpringerLink Journals (ICM)
  customDbUrl:
  eissn: 1673-7466
  dateEnd: 99991231
  omitProxy: true
  ssIdentifier: ssj0062260
  issn: 1673-7350
  databaseCode: U2A
  dateStart: 20070201
  isFulltext: true
  titleUrlDefault: http://www.springerlink.com/journals/
  providerName: Springer Nature
link http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwfV3dixMxEB_u2hdB_BZ7niUPPimLTTab3SAiVdo7FIuIhfMpbL7uHmR7p1Xwv3cm3bRUsK-7yQRmJjOTzGR-AM-DV1Zb3N-hqdpCSikKLb0qVCzRJAunY8IG_LRQ50v54aK6OIJFfgtDZZXZJiZD7VeO7shfCc0xtq_Rnby9vikINYqyqxlCo-2hFfyb1GLsGIaCOmMNYPhutvj8ZXvrIiiETqkFgbFFQdcfOdWZ3tPxOhVl0ItlNAQNNVy4WnWXN-hG9hzX7atUhRF8qlbdi07_SagmPzW_B3f6AJNNNxpxH45C9wDuZvAG1u_lh_B62rGQ-keg22EbIGmGESxDur9b94fRmmRIuktGDo8EyHBxOlo_guV89vX9edEjKRSu1Hxd6Bp5HqMPinNfojCi4FHWE-6crrz2jttatpPaRlcqFbWTpeC2ck0VJg5DqPIxDLpVF54A8wF5pnxjPZ7cQmttFUqvcbwKMqJ9GMHJlmXmetMxw6DTq_BkJ0cwyTw0ru9BTlAY382uezKJwKAIDInANCN4sZ2SyR0YzPcEYyJ1gSBM8UNzTrPwTL9_f5qdto3gZRbo7vd_iZ0cJvYUbgnSrlRAeAqD9Y9f4RkGNWs7huNmfjaG4fTs28fZuNdb_LoU07_UYPQj
linkProvider ProQuest
linkToHtml http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV3dTxQxEJ8gPGhC_DYcovZBXzQbr91udxtCDCrkELgYAwlvdfsFD2SPj1PDP-ffxkxv9y5n4r3xvN1p05nOR2c6P4C3wSurLZ7vUBV1JqUUmZZeZSrmqJKF0zFhAx4O1eBYfjspTpbgb_cWhsoqO52YFLUfOboj_yg0R9--RHPy6eIyI9Qoyq52EBp1C63gt1KLsfZhx364-YMh3PXW3lfk9zshdneOvgyyFmUgc7nm40yXuJ4YfVCc-xwXGgWPsuxz53ThtXfclrLulza6XKmoncwFt4WritB36F7kSPcerMhcagz-Vj7vDL__mN7yCHLZUypDoC-T0XVLl1pN7_d4mYpA6IU0Kp6KGjycjZrTSzRbc4Zy9SxVfQSfqmPnvOF_ErjJLu4-hoetQ8u2JxL4BJZC8xQedWARrNUdz2Bzu2Eh9atAM8cmwNUMPWaGdH_X7obRnKS4mlNGBpYEhuHkFMo_h-M72dMXsNyMmrAGzAfcM-Ur6zFSDLW1Rci9xvEqyIj6qAfr0y0zF5MOHQaNbIGRpOxBv9tD49qe5wS9cW5m3ZqJBQZZYIgFpurB--kvHbkFg_kcY0ykrhOEYb7on42OeabVF9dmJt09-NAxdPb5v8TWFxN7A_cHR4cH5mBvuP8SHgiStFS8uAHL46tf4RU6VGP7upVaBj_v-qDcAvefLhM
linkToPdf http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1NTxsxEB3RVKoqIVr6oSak1AdOoBWx1-tdi1NEG4W2IA5E4mbFX-RQbVISkPj3zGx2E6UqSJzXa-_62Z439vgNwEHwymqL8zsU2TiRUopES68SFVNckoXTscoNeH6hhiP58zq7rvOczpto9-ZIcnmngVSaysXxzMfj9cU3nlfRE3S1GGds8QpeS9JJwAE9Ev3VJosgxixWelIKuQZtugjkFQltfTTHnP-rksQWJtPy5i9-yobR2p5UERjBV5GqG8z0n8PUykYN3sNOTS5ZfzkadmErlB_gXZO4gdXz-COc9EsWKu0I_GW2TCLNkL0yrPd-7B4YtUmLSHnDyNgReAwbJ7f6E4wGP65Oh0mdRSFxqeaLROfY3zH6oDj3KQIRBY8y73HndOa1d9zmctzLbXSpUlE7mQpuM1dkoeeQPqWfoVVOy_AFmA_YZ8oX1qPXFsbWZiH1GsurICOuDW3orLrMzJZqGQYNXoZenWxDr-lD42r9cUqD8ceslZMJAoMQGILAFG04XL3SVPdMYb4BjImkAEH5xJ97p9uAZ-q5OzdCc_QicyQubThqAF0_frKyzotKf4M3l98H5vfZxa89eCto3FVhhV1oLW7vwlekOgu7Xw3nRyDg8J0
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=An+efficient+method+for+privacy+preserving+location+queries&rft.jtitle=Frontiers+of+Computer+Science&rft.au=Liu%2C+Yubao&rft.au=Chen%2C+Xiuwei&rft.au=Li%2C+Zhan&rft.au=Li%2C+Zhijie&rft.date=2012-08-01&rft.pub=Springer+Nature+B.V&rft.issn=2095-2228&rft.eissn=2095-2236&rft.volume=6&rft.issue=4&rft.spage=409&rft.epage=420&rft_id=info:doi/10.1007%2Fs11704-012-2838-8
thumbnail_s http://utb.summon.serialssolutions.com/2.0.0/image/custom?url=http%3A%2F%2Fimage.cqvip.com%2Fvip1000%2Fqk%2F71018X%2F71018X.jpg