메뉴 건너뛰기




Volumn 36, Issue 2, 2011, Pages

Design and analysis of a ranking approach to private location-based services

Author keywords

Location privacy; Mobile service

Indexed keywords

ANONYMIZER; COMMUNICATION COST; DESIGN AND ANALYSIS; EMPIRICAL STUDIES; EUCLIDEAN SPACES; K-NEAREST NEIGHBORS; LOCATION PRIVACY; LOCATION-BASED SERVICES; MOBILE SERVICE; POINTS OF INTEREST; QUERY PERFORMANCE; RANKING APPROACH; SEARCH TECHNIQUE; SPATIAL NETWORK;

EID: 79960787246     PISSN: 03625915     EISSN: 15574644     Source Type: Journal    
DOI: 10.1145/1966385.1966388     Document Type: Article
Times cited : (58)

References (56)
  • 4
  • 5
    • 0016557674 scopus 로고
    • Multidimensional binary search trees used for associative searching
    • BENTLEY, J. L. 1975. Multidimensional binary search trees used for associative searching. Comm. ACM 18, 9, 509-517.
    • (1975) Comm. ACM , vol.18 , Issue.9 , pp. 509-517
    • Bentley, J.L.1
  • 7
    • 0036606530 scopus 로고    scopus 로고
    • A framework for generating network-based moving objects
    • DOI 10.1023/A:1015231126594
    • BRINKHOFF, T. 2002. A framework for generating network-based moving objects. GeoInformatica 6, 2, 153-180. (Pubitemid 34609430)
    • (2002) GeoInformatica , vol.6 , Issue.2 , pp. 153-180
    • Brinkhoff, T.1
  • 10
    • 34547474184 scopus 로고    scopus 로고
    • A peer-to-peer spatial cloaking algorithm for anonymous location-based service
    • DOI 10.1145/1183471.1183500, Proceedings of the 14th Annual ACM International Symposium on Advances in Geographic Information Systems, ACM-GIS'06
    • CHOW, C.-Y., MOKBEL, M. F., AND LIU, X. 2006. A peer-to-peer spatial cloaking algorithm for anonymous location-based services. In Proceedings of the ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems (ACM SIGSPATIAL GIS). 171-178. (Pubitemid 47168545)
    • (2006) GIS: Proceedings of the ACM International Symposium on Advances in Geographic Information Systems , pp. 171-178
    • Chow, C.-Y.1    Mokbel, M.F.2    Liu, X.3
  • 12
    • 24944432404 scopus 로고    scopus 로고
    • A formal model of obfuscation and negotiation for location privacy
    • Pervasive Computing: Third International Conference, PERVASIVE 2005, Proceedings
    • DUCKHAM, M. AND KULIK, L. 2005a. A formal model of obfuscation and negotiation for location privacy. In Proceedings of the International Conference on Pervasive Computing (PERVASIVE). 152-170. (Pubitemid 41313330)
    • (2005) Lecture Notes in Computer Science , vol.3468 , pp. 152-170
    • Duckham, M.1    Kulik, L.2
  • 17
    • 35348924316 scopus 로고    scopus 로고
    • PRIVE: Anonymous location-based queries in distributed mobile systems
    • DOI 10.1145/1242572.1242623, 16th International World Wide Web Conference, WWW2007
    • GHINITA, G.,KALNIS, P., AND SKIADOPOULOS, S. 2007b. PRIVÉ : Anonymous location-based queries in distributed mobile systems. In Proceedings of the World Wide Web Conference (WWW). 371-380. (Pubitemid 47582266)
    • (2007) 16th International World Wide Web Conference, WWW2007 , pp. 371-380
    • Ghinita, G.1    Kalnis, P.2    Skiadopoulos, S.3
  • 20
    • 2342562393 scopus 로고    scopus 로고
    • Protecting privacy in continuous location-tracking applications
    • GRUTESER,M. AND LIU, X. 2004. Protecting privacy in continuous location-tracking applications. IEEE Security Privacy 2, 2, 28-34.
    • (2004) IEEE Security Privacy , vol.2 , Issue.2 , pp. 28-34
    • Gruteser, M.1    Liu, X.2
  • 22
    • 0000701994 scopus 로고    scopus 로고
    • Distance browsing in spatial databases
    • HJALTASON, G. R. AND SAMET, H. 1999. Distance browsing in spatial databases. Trans. Datab. Syst. 24, 2, 265-318.
    • (1999) Trans. Datab. Syst. , vol.24 , Issue.2 , pp. 265-318
    • Hjaltason, G.R.1    Samet, H.2
  • 27
    • 23944466912 scopus 로고    scopus 로고
    • +-tree based indexing method for nearest neighbor search
    • DOI 10.1145/1071610.1071612
    • JAGADISH, H. V., OOI, B. C., TAN, K.-L., YU, C., AND ZHANG, R. 2005. iDistance: An adaptive B+-tree based indexing method for nearest neighbor search. Trans. Datab. Syst. 30, 2, 364-397. (Pubitemid 41204994)
    • (2005) ACM Transactions on Database Systems , vol.30 , Issue.2 , pp. 364-397
    • Jagadish, H.V.1    Ooi, B.C.2    Tan, K.-L.3    Yu, C.4    Zhang, R.5
  • 28
    • 70349131217 scopus 로고    scopus 로고
    • Location privacy techniques in client-server architectures
    • C. Bettini, S. Jajodia, P. Samarati, and X. S.Wong, Eds. Springer, Berlin
    • JENSEN, C. S.,LU,H., AND YIU,M. L. 2009. Location privacy techniques in client-server architectures. In Privacy in Location-Based Applications. C. Bettini, S. Jajodia, P. Samarati, and X. S.Wong, Eds. Springer, Berlin, 31-58.
    • (2009) Privacy in Location-Based Applications , pp. 31-58
    • Jensen, C.S.1    Lu, H.2    Yiu, M.L.3
  • 39
    • 79960775841 scopus 로고    scopus 로고
    • Research rep. R-2010-03, Department ofMathematical Sciences, Aalborg University. To appear in Advances in Applied Probability
    • MøLLER, J. AND YIU, M. L. 2010. Probabilistic results for a mobile service scenario. Research rep. R-2010-03, Department ofMathematical Sciences, Aalborg University. To appear in Advances in Applied Probability.
    • (2010) Probabilistic Results for a Mobile Service Scenario
    • Møller, J.1    Yiu, M.L.2
  • 40
    • 72949110369 scopus 로고    scopus 로고
    • Anonymous query processing in road networks
    • MOURATIDIS, K. AND YIU, M. L. 2010. Anonymous query processing in road networks. IEEE Trans. Knowl. Data Eng. 22, 1, 2-15.
    • (2010) IEEE Trans. Knowl. Data Eng. , vol.22 , Issue.1 , pp. 2-15
    • Mouratidis, K.1    Yiu, M.L.2
  • 45
    • 0021496754 scopus 로고
    • Radial generation of n-dimensional poisson processes
    • QUINE, M. P. AND WATSON, D. F. 1984. Radial generation of n-dimensional poisson processes. J. Appl. Prob. 21, 548-557. (Pubitemid 14664499)
    • (1984) Journal of Applied Probability , vol.21 , Issue.3 , pp. 548-557
    • Quine, M.P.1    Watson, D.F.2
  • 48
    • 13844298845 scopus 로고    scopus 로고
    • An efficient cost model for optimization of nearest neighbor search in low and medium dimensional spaces
    • DOI 10.1109/TKDE.2004.48
    • TAO, Y., ZHANG, J., PAPADIAS, D., AND MAMOULIS, N. 2004. An Efficient Cost Model for Optimization of Nearest Neighbor Search in Low and Medium Dimensional Spaces. IEEE Trans. Knowl. Data Eng. 16, 10, 1169-1184. (Pubitemid 40242332)
    • (2004) IEEE Transactions on Knowledge and Data Engineering , vol.16 , Issue.10 , pp. 1169-1184
    • Tao, Y.1    Zhang, J.2    Papadias, D.3    Mamoulis, N.4
  • 49
    • 77953980631 scopus 로고    scopus 로고
    • Privacy-aware mobile services over road networks
    • WANG, T. AND LIU, L. 2009. Privacy-aware mobile services over road networks. Proc. PVLDB 2, 1, 1042-1053.
    • (2009) Proc. PVLDB , vol.2 , Issue.1 , pp. 1042-1053
    • Wang, T.1    Liu, L.2
  • 50
    • 35448935270 scopus 로고    scopus 로고
    • Progressive and selective merge: Computing top-k with ad-hoc ranking functions
    • DOI 10.1145/1247480.1247494, SIGMOD 2007: Proceedings of the ACM SIGMOD International Conference on Management of Data
    • XIN, D., HAN, J., AND CHANG, K. C.-C. 2007. Progressive and selective merge: Computing top-k with Ad hoc ranking functions. In Proceedings of the ACM SIGMOD International Conference on Management of Data (SIGMOD). 103-114. (Pubitemid 47630800)
    • (2007) Proceedings of the ACM SIGMOD International Conference on Management of Data , pp. 103-114
    • Xin, D.1    Han, J.2    Chang, K.C.3
  • 52
    • 76749103805 scopus 로고    scopus 로고
    • Privacy-conscious location-based queries in mobile environments
    • XU, J., TANG, X., HU, H., AND DU, J. 2010. Privacy-conscious location-based queries in mobile environments. IEEE Trans. Parall. Distrib. Syst. 21, 3, 313-326.
    • (2010) IEEE Trans. Parall. Distrib. Syst. , vol.21 , Issue.3 , pp. 313-326
    • Xu, J.1    Tang, X.2    Hu, H.3    Du, J.4
  • 53
    • 67649510426 scopus 로고    scopus 로고
    • Authenticated indexing for outsourced spatial databases
    • YANG, Y., PAPADOPOULOS, S., PAPADIAS, D., AND KOLLIOS, G. 2009. Authenticated indexing for outsourced spatial databases. VLDB J. 18, 3, 631-648.
    • (2009) VLDB J. , vol.18 , Issue.3 , pp. 631-648
    • Yang, Y.1    Papadopoulos, S.2    Papadias, D.3    Kollios, G.4
  • 54
    • 77952749478 scopus 로고    scopus 로고
    • K nearest neighbor queries and kNN-Joins in large relational databases (almost) for free
    • YAO, B., LI, F., AND KUMAR, P. 2010. K nearest neighbor queries and kNN-Joins in large relational databases (almost) for free. In Proceedings of the Conference on Data Engineering (ICDE). 4-15.
    • (2010) Proceedings of the Conference on Data Engineering (ICDE) , pp. 4-15
    • Yao, B.1    Li, F.2    Kumar, P.3
  • 55
    • 52649118020 scopus 로고    scopus 로고
    • SpaceTwist: Managing the trade-offs among location privacy, query performance, and query accuracy in mobile services
    • YIU, M. L., JENSEN, C. S., HUANG, X., AND LU, H. 2008. SpaceTwist: Managing the trade-offs among location privacy, query performance, and query accuracy in mobile services. In Proceedings of the Conference on Data Engineering ICDE. 366-375.
    • (2008) Proceedings of the Conference on Data Engineering ICDE , pp. 366-375
    • Yiu, M.L.1    Jensen, C.S.2    Huang, X.3    Lu, H.4


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.