北京邮电大学学报

  • EI核心期刊

北京邮电大学学报 ›› 2021, Vol. 44 ›› Issue (6): 103-108.doi: 10.13190/j.jbupt.2021-041

• 研究报告 • 上一篇    下一篇

多值预测位置隐私保护机制

宋成, 金彤, 贺军义   

  1. 河南理工大学 计算机科学与技术学院, 焦作 454003
  • 收稿日期:2021-03-19 出版日期:2021-12-28 发布日期:2021-12-28
  • 通讯作者: 贺军义(1982—),男,副教授,E-mail:hejunyi@hpu.edu.cn. E-mail:hejunyi@hpu.edu.cn
  • 作者简介:宋成(1980—),男,副教授.
  • 基金资助:
    国家自然科学基金项目(61872126,61772159);河南省科技攻关计划项目(192102210123,182102110333)

A Multi-Value Prediction Location Privacy Protection Mechanism

SONG Cheng, JIN Tong, HE Jun-yi   

  1. School of Computer Science and Technology, Henan Polytechnic University, Jiaozuo 454003, China
  • Received:2021-03-19 Online:2021-12-28 Published:2021-12-28

摘要: 针对当前位置隐私保护方案中存在的安全和效率问题,基于马尔可夫链技术提出一种多值预测查询的位置隐私保护方案. 首先,根据状态转移矩阵对输入的多个查询值进行计算,并生成下一时刻的预测位置和查询内容;然后,基于布隆过滤器原理,建立兴趣点缓存机制. 安全分析结果表明,所提方案满足匿名性、不可伪造性和抵抗查询服务追踪等安全特性;仿真结果表明,所提方案与现有方案相比具有较高的执行效率和较低的通信开销,且有较高的缓存命中率,能有效减少与基于位置服务器间的交互次数.

关键词: 位置隐私, 马尔可夫链, 布隆过滤器, 缓存

Abstract: To solve the security and efficiency issues in the existing location privacy protection schemes, a location privacy protection scheme based on Markov chain technology for multi-value predictive query is proposed. First, the state transition matrix is used to calculate the input multiple query values, and generate the predicted position and the query content at the next moment. Then, Bloom filter technology is adopted to establish a caching mechanism for points of interest. Security analyses demonstrate that the proposed scheme satisfies security features such as anonymity, unforgeability, and is able to resist to query service tracking. Simulation results show that the proposed scheme has higher execution efficiency, lower communication costs, and a higher cache hit rate, which can effectively reduce the number of interactions with the location based service server.

Key words: location privacy, Markov chain, Bloom filter, cache

中图分类号: