Location privacy preserving obstructed nearest neighbor queries

被引:0
|
作者
机构
[1] College of Information Science and Engineering, Northeastern University
来源
Wang, B. (binwang@mail.neu.edu.cn) | 1600年 / Science Press卷 / 51期
关键词
Cloaked region; Location privacy; Nearest neighbor queries; Obstructed distance; Obstructed space;
D O I
10.7544/issn1000-1239.2014.20130694
中图分类号
学科分类号
摘要
Location privacy has been a hot topic in recent years. However, the methods of existing location privacy preserving only support simple nearest neighbor queries, which do not consider the obstructed space. But in fact, the obstructed space is very popular in our life. Therefore, we study location privacy preserving obstructed nearest neighbor queries. Due to the effect of obstacles, this problem is also very hard. In this paper, we adopt a normal approach based on the third trusted party for privacy preserving obstructed nearest neighbor (ONN) queries. The approach can entertain the location-based service without leaking the user's exact location and obtain the exact answer. In our approach, firstly, the third trusted party constructs a cloaked region corresponding to the exact location and sends the cloaked region to the LBS. Then LBS processes the query region. In the process of query processing, we use two methods to return a set of candidate answers with respect to the cloaking region for the actual user location: 1) Basic approach of query processing, which uses the max obstructed distance of segment to expand the region and returning the results in the expanded region; 2) Improved approach of query processing, which further narrows the expanded region based on the basic approach. At last, the third trusted party returns the actual answer to the users corresponding to user's exact location. Finally, experimental results and proof theory show the effectiveness and correctness of our approach.
引用
收藏
页码:115 / 125
页数:10
相关论文
共 13 条
  • [1] ABI research: GPS-enabled location-based services subscribers will total 315 million in 5 years
  • [2] Mohamed F.M., Chow C.Y., Walid G.A., The new Casper: Query processing for location services without compromising privacy, Proc of the 32nd Int Conf on VLDB, pp. 763-774, (2006)
  • [3] Jang M.Y., Chang J.W., A new K-NN query processing algorithm enhancing privacy protection in location-based services, Proc of the 11th Int Conf on Computer and Information Technology, pp. 421-428, (2011)
  • [4] Xue J., Liu X., Yang X., Et al., A location privacy preserving approach on road network, Chinese Journal of Computers, 34, 5, pp. 865-879, (2011)
  • [5] Qiao Z., Gu J., Lin X., Et al., Privacy-preserving skyline queries in LBS, Proc of Int Conf on Machine Vision and Human-Machine Interface, pp. 499-504, (2010)
  • [6] Hashem T., Kulik L., Zhang R., Privacy preserving group nearest neighbor queries, Proc of the 13th Int Conf on Extending Database Technology, pp. 489-500, (2010)
  • [7] Ghinita G., Kalnis P., Khoshgozaran A., Et al., Private queries in location based services: Anonymizers are not necessary, Proc of the 2008 ACM SIGMOD Int Conf on Managent of Data, pp. 121-132, (2008)
  • [8] Wang B., Yang X., Wang G., Et al., Continually answering constraint k-NN queries in unstructured P2P systems, Journal of Computer Science and Technology (JCST), 23, 4, pp. 538-556, (2008)
  • [9] Zhang J., Papadias D., Mouratidis K., Et al., Spatial queries in the presence of obstacles, Proc of the 9th Int Conf on Extending Database Technology, pp. 366-384, (2004)
  • [10] Xia C., Hsu D., Tung A.K., A fast filter for obstructed nearest neighbor queries, Proc of the 21st British National Conf on Databases, pp. 203-215, (2004)