首页> 外文会议>International conference on web information systems and applications >Random Sequence Coding Based Privacy Preserving Nearest Neighbor Query Method
【24h】

Random Sequence Coding Based Privacy Preserving Nearest Neighbor Query Method

机译:基于随机序列编码的隐私保护最近邻居查询方法

获取原文

摘要

Location based service has been widely used in people' life. It brings convenience to the people, in parallel with the risk of query user's location privacy disclosure. As a result, privacy preserving location based nearest neighbor queries witness its thriving in recent years. Private information retrieval (PIR) based solutions receives continuous attention for in privacy preserving for its merits in high level privacy protection strength and independence of the trusted third parties. However, existing PIR based methods fall short in high time consuming of encoding, querying efficiency and poor security to mode attacks. To address above issues, random sequence is introduced to encode POI data, which can resist mode attacks and reduce the time of data encoding. As a consequence, location privacy protection effectiveness is improved. Meanwhile, to accelerate query efficiency, a hash table structure is built at the server-side to store rules of POI distribution in the manner of space bitmap, which can position nearing POI quickly and reduce the I/O cost of database visiting efficiently. Theoretical analysis and experimental results demonstrates our solution's efficiency and effectiveness.
机译:基于位置的服务已广泛应用于人们的生活中。它给人们带来了便利,同时也带来了查询用户位置隐私泄露的风险。结果,基于隐私保护位置的最近邻居查询见证了其近年来的蓬勃发展。基于私有信息检索(PIR)的解决方案因其在高级别隐私保护强度和受信任第三方的独立性方面的优势而一直受到隐私保护的关注。但是,现有的基于PIR的方法在编码的高耗时,查询效率以及对模式攻击的安全性方面都不足。为了解决上述问题,引入了随机序列来对POI数据进行编码,这可以抵抗模式攻击并减少数据编码的时间。结果,提高了位置隐私保护的有效性。同时,为了提高查询效率,在服务器端建立了哈希表结构,以空间位图的方式存储POI分配规则,可以快速定位POI的位置,并有效降低数据库访问的I / O成本。理论分析和实验结果证明了我们解决方案的效率和有效性。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号