【24h】

Practical K Nearest Neighbor Query Scheme with Two-Party Guarantees in Road Networks

机译:道路网络中具有两方保证的实用K最近邻查询方案

获取原文
获取原文并翻译 | 示例

摘要

In order to achieve user's privacy preservation and data security of LBS server in road networks, a query scheme for points of interest(PoI) is proposed in this paper based on oblivious transfer and private information retrieval. The scheme can proceed in two phases: Firstly, we take vertexes in road networks as generating elements to construct a new data structure which is employed to store the distribution information and details of PoIs which are encrypted with different symmetric keys for sake of data security of LBS server. And an oblivious transfer protocol is presented based on the data structure, which facilitates a user to privately obtain the unique key materials corresponding to his interested PoIs without revealing any other PoI information in LBS server since the data is its asset. Then, a private information retrieval protocol is presented to obtain the interested PoI details, the user does not need to provide his location or explicit query content in the query, whereas he can derive an accurate result with the previous key materials, so it guarantees the user's privacy as well. Finally, performance analysis and experiments show that our scheme is more efficient and accurate in a real scenario compared with existing solutions.
机译:为了在路网中实现LBS服务器的用户隐私保护和数据安全,提出了一种基于遗忘传输和私有信息检索的兴趣点查询方案。该方案可以分两个阶段进行:首先,我们以路网中的顶点为生成元素来构建新的数据结构,该数据结构用于存储分布信息和PoI的细节,并使用不同的对称密钥对其进行加密,以确保数据安全。 LBS服务器。并且基于数据结构提出了一种遗忘的传输协议,由于数据是数据的资产,因此方便用户私自获取与其感兴趣的兴趣点相对应的唯一密钥材料,而不会在LBS服务器中泄露任何其他兴趣点信息。然后,提出了一种私有信息检索协议来获取感兴趣的PoI详细信息,用户无需在查询中提供自己的位置或明确的查询内容,而他可以使用先前的关键材料得出准确的结果,从而确保了用户的隐私。最后,性能分析和实验表明,与现有解决方案相比,我们的方案在实际情况下更加高效,准确。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号