{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,11]],"date-time":"2025-12-11T07:06:40Z","timestamp":1765436800963},"reference-count":36,"publisher":"Association for Computing Machinery (ACM)","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Proc. VLDB Endow."],"published-print":{"date-parts":[[2011,9]]},"abstract":"<jats:p>\n            With the growing use of location-based services, location privacy attracts increasing attention from users, industry, and the research community. While considerable effort has been devoted to inventing techniques that prevent service providers from knowing a user's exact location, relatively little attention has been paid to enabling so-called peer-wise privacy---the protection of a user's location from unauthorized peer users. This paper identifies an important efficiency problem in existing peer-privacy approaches that simply apply a filtering step to identify users that are located in a query range, but that do not want to disclose their location to the querying peer. To solve this problem, we propose a novel, privacy-policy enabled index called the\n            <jats:italic>PEB-tree<\/jats:italic>\n            that seamlessly integrates location proximity and policy compatibility. We propose efficient algorithms that use the PEB-tree for processing privacy-aware range and\n            <jats:italic>k<\/jats:italic>\n            NN queries. Extensive experiments suggest that the PEB-tree enables efficient query processing.\n          <\/jats:p>","DOI":"10.14778\/2047485.2047489","type":"journal-article","created":{"date-parts":[[2014,6,24]],"date-time":"2014-06-24T12:17:57Z","timestamp":1403612277000},"page":"37-48","source":"Crossref","is-referenced-by-count":4,"title":["A moving-object index for efficient query processing with peer-wise location privacy"],"prefix":"10.14778","volume":"5","author":[{"given":"Dan","family":"Lin","sequence":"first","affiliation":[{"name":"Missouri University of Science &amp; Technology"}]},{"given":"Christian S.","family":"Jensen","sequence":"additional","affiliation":[{"name":"Aarhus University"}]},{"given":"Rui","family":"Zhang","sequence":"additional","affiliation":[{"name":"The University of Melbourne"}]},{"given":"Lu","family":"Xiao","sequence":"additional","affiliation":[{"name":"Missouri University of Science &amp; Technology"}]},{"given":"Jiaheng","family":"Lu","sequence":"additional","affiliation":[{"name":"Renmin University of China"}]}],"member":"320","published-online":{"date-parts":[[2011,9]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/1367497.1367531"},{"key":"e_1_2_1_2_1","volume-title":"Future location-based experiences. JISC Technology and Standards Watch, 17 pages","author":"Benford S.","year":"2005","unstructured":"S. Benford . Future location-based experiences. JISC Technology and Standards Watch, 17 pages , 2005 . S. Benford. Future location-based experiences. JISC Technology and Standards Watch, 17 pages, 2005."},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.14778\/1454159.1454229"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.14778\/1687627.1687666"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1063979.1063985"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/11428572_10"},{"key":"e_1_2_1_7_1","first-page":"554","volume-title":"Proc. National Computer Security Conference","author":"Ferraiolo D. F.","year":"1992","unstructured":"D. F. Ferraiolo and D. R. Kuhn . Role-based access control . In Proc. National Computer Security Conference , pages 554 -- 563 , 1992 . D. F. Ferraiolo and D. R. Kuhn. Role-based access control. In Proc. National Computer Security Conference, pages 554--563, 1992."},{"key":"e_1_2_1_8_1","first-page":"620","volume-title":"Proc. IEEE ICDCS","author":"Gedik B.","year":"2005","unstructured":"B. Gedik and L. Liu . A customizable k-anonymity model for protecting location privacy . In Proc. IEEE ICDCS , pages 620 -- 629 , 2005 . B. Gedik and L. Liu. A customizable k-anonymity model for protecting location privacy. In Proc. IEEE ICDCS, pages 620--629, 2005."},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1376616.1376631"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/1066116.1189037"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/11423409_17"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2009.106"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.5555\/1316689.1316756"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.5555\/1784462.1784476"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2005.269"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/1179601.1179605"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2010.149"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.5555\/1556406.1556409"},{"key":"e_1_2_1_19_1","first-page":"763","volume-title":"Proc. VLDB","author":"Mokbel M. F.","year":"2006","unstructured":"M. F. Mokbel , C. Y. Chow , and W. G. Aref . The new casper: Query processing for location services without compromising privacy . In Proc. VLDB , pages 763 -- 774 , 2006 . M. F. Mokbel, C. Y. Chow, and W. G. Aref. The new casper: Query processing for location services without compromising privacy. In Proc. VLDB, pages 763--774, 2006."},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/MDM.2007.45"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/1529282.1529330"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1109\/69.908985"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1109\/MPRV.2003.1186726"},{"key":"e_1_2_1_24_1","unstructured":"Orange U. K. location tracking -- dangers. http:\/\/wwwl.orange.co.uk\/safety\/mobile\/241\/244.html.  Orange U. K. location tracking -- dangers. http:\/\/wwwl.orange.co.uk\/safety\/mobile\/241\/244.html."},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/1007568.1007639"},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/1734583.1734585"},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/342009.335427"},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/501158.501164"},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1142\/S021848850200165X"},{"key":"e_1_2_1_30_1","volume-title":"search of LBS accountability. In telecomasia.net","author":"Tanner J. C.","year":"2008","unstructured":"J. C. Tanner . In search of LBS accountability. In telecomasia.net , 2008 . http:\/\/www.telecomasia.net\/content\/search-lbs-accountability-0. J. C. Tanner. In search of LBS accountability. In telecomasia.net, 2008. http:\/\/www.telecomasia.net\/content\/search-lbs-accountability-0."},{"key":"e_1_2_1_31_1","first-page":"790","volume-title":"Proc. VLDB","author":"Tao Y.","year":"2003","unstructured":"Y. Tao , D. Papadias , and J. Sun . The TPR*-tree: an optimized spatio-temporal access method for predictive queries . In Proc. VLDB , pages 790 -- 801 , 2003 . Y. Tao, D. Papadias, and J. Sun. The TPR*-tree: an optimized spatio-temporal access method for predictive queries. In Proc. VLDB, pages 790--801, 2003."},{"key":"e_1_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-006-0013-2"},{"key":"e_1_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2004.48"},{"key":"e_1_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1109\/MIC.2011.29"},{"key":"e_1_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2006.125"},{"key":"e_1_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/1966385.1966388"}],"container-title":["Proceedings of the VLDB Endowment"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.14778\/2047485.2047489","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,28]],"date-time":"2022-12-28T10:03:18Z","timestamp":1672221798000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.14778\/2047485.2047489"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,9]]},"references-count":36,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2011,9]]}},"alternative-id":["10.14778\/2047485.2047489"],"URL":"https:\/\/doi.org\/10.14778\/2047485.2047489","relation":{},"ISSN":["2150-8097"],"issn-type":[{"value":"2150-8097","type":"print"}],"subject":[],"published":{"date-parts":[[2011,9]]}}}