Continuous K Nearest Neighbor Query Scheme with Privacy and Security Guarantees in Road Networks

被引:3
|
作者
Zhou, Changli [1 ]
Wang, Tian [1 ]
Tian, Hui [1 ]
Jiang, Wenxian [1 ]
机构
[1] Huaqiao Univ, Coll Comp Sci & Technol, Xiamen, Peoples R China
基金
中国国家自然科学基金;
关键词
privacy preservation; data security; K nearest neighbor query; oblivious transfer; location-based service(LBS); LOCATION PRIVACY;
D O I
10.1109/SmartWorld.2018.00153
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
There are two key issues in existing LBS privacy preserving query schemes: @1. most solutions based on strong cryptosystem are less practical in road networks, especially inapplicable for continuous query, it leads to efficiency and accuracy declines; most solutions focus on user privacy preservation without considering the data security of server side. In view of the aforementioned issues, we firstly present an encryption and pseudorandom permutation algorithm for the database of LBS with a full consideration of the factors in road networks, this algorithm is a basis to facilitate our query scheme to be implemented in a real scenario, and then we propose the privacy-preserving KNN query scheme based on oblivious transfer, in which the user does not need to provide his actual location or explicit query content, and only obtains one type of POI records each time. By this way, our scheme guarantees both user privacy and server data security, since the data is the server's asset as well. Performance analysis and experiments show that our solution is practical for continuous query in road networks, and achieves a more favorable query efficiency and accuracy compared with existing solutions for KNN queries.
引用
收藏
页码:828 / 833
页数:6
相关论文
共 50 条
  • [41] Continuous K-Nearest Neighbor Query for Moving Objects with Uncertain Velocity
    Yuan-Ko Huang
    Chao-Chun Chen
    Chiang Lee
    GeoInformatica, 2009, 13 (1) : 1 - 25
  • [42] Continuous K-Nearest neighbor query for moving objects with uncertain velocity
    Department of Computer Science and Information Engineering, National Cheng-Kung University, Tainan, Taiwan
    不详
    GeoInformatica, 2009, 1 (1-25)
  • [43] Efficient Continuous Nearest Neighbor Query in Spatial Networks Using Euclidean Restriction
    Demiryurek, Ugur
    Banaei-Kashani, Farnoush
    Shahabi, Cyrus
    ADVANCES IN SPATIAL AND TEMPORAL DATABASES, PROCEEDINGS, 2009, 5644 : 25 - 43
  • [44] The Moving K Diversified Nearest Neighbor Query
    Gu, Yu
    Liu, Guanli
    Qi, Jianzhong
    Xu, Hongfei
    Yu, Ge
    Zhang, Rui
    IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 2016, 28 (10) : 2778 - 2792
  • [45] A safe exit algorithm for continuous nearest neighbor monitoring in road networks
    Cho, Hyung-Ju
    Kwon, Se Jin
    Chung, Tae-Sun
    MOBILE INFORMATION SYSTEMS, 2013, 9 (01) : 37 - 53
  • [46] Preserving Users' Privacy for Continuous Query Services in Road Networks
    Domenic, Kamenyi M.
    Wang, Yong
    Zhang, Fengli
    Memon, Imran
    Gustav, Yankson H.
    PROCEEDINGS OF 2013 6TH INTERNATIONAL CONFERENCE ON INFORMATION MANAGEMENT, INNOVATION MANAGEMENT AND INDUSTRIAL ENGINEERING (ICIII 2013) VOL 1, 2013, : 352 - +
  • [47] Continuous k-nearest neighbor monitoring over moving objects with uncertain speeds in road networks
    Li, Yanhong
    Pan, Yi
    Li, Guohui
    Zhongnan Daxue Xuebao (Ziran Kexue Ban)/Journal of Central South University (Science and Technology), 2013, 44 (12): : 4916 - 4922
  • [48] The Partition Bridge (PB) tree: Efficient nearest neighbor query processing on road networks
    Min, Xiangqiang
    Pfoser, Dieter
    Zufle, Andreas
    Sheng, Yehua
    Huang, Yi
    INFORMATION SYSTEMS, 2023, 118
  • [49] Robust K nearest neighbor query processing algorithm in wireless sensor networks
    Liu, Liang
    Qin, Xiao-Lin
    Liu, Ya-Li
    Li, Bo-Han
    Tongxin Xuebao/Journal on Communications, 2010, 31 (11): : 171 - 179
  • [50] A Privacy-Preserving and Efficient k-Nearest Neighbor Query and Classification Scheme Based on k-Dimensional Tree for Outsourced Data
    Du, Jiangyi
    Bian, Fuling
    IEEE ACCESS, 2020, 8 (08) : 69333 - 69345