首页> 外文期刊>IEEE transactions on information forensics and security >A Novel Privacy Preserving Location-Based Service Protocol With Secret Circular Shift for $k$-NN Search
【24h】

A Novel Privacy Preserving Location-Based Service Protocol With Secret Circular Shift for $k$-NN Search

机译:$ k $ -NN搜索的具有秘密循环移位的新型隐私保护基于位置的服务协议

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

摘要

Location-based service (LBS) is booming up in recent years with the rapid growth of mobile devices and the emerging of cloud computing paradigm. Among the challenges to establish LBS, the user privacy issue becomes the most important concern. A successful privacy-preserving LBS must be secure and provide accurate query [e.g., $k$ -nearest neighbor (NN)] results. In this work, we propose a private circular query protocol (PCQP) to deal with the privacy and the accuracy issues of privacy-preserving LBS. The protocol consists of a space filling curve and a public-key homomorphic cryptosystem. First, we connect the points of interest (POIs) on a map to form a circular structure with the aid of a Moore curve. And then the homomorphism of Paillier cryptosystem is used to perform secret circular shifts of POI-related information (POI-info), stored on the server side. Since the POI-info after shifting and the amount of shifts are encrypted, LBS providers (e.g., servers) have no knowledge about the user's location during the query process. The protocol can resist correlation attack and support a multiuser scenario as long as the predescribed secret circular shift is performed before each query; in other words, the robustness of the proposed protocol is the same as that of a one-time pad encryption scheme. As a result, the security level of the proposed protocol is close to perfect secrecy without the aid of a trusted third party and simulation results show that the $k$-NN query accuracy rate of the proposed protocol is higher than 90% even when $k$ is large.
机译:随着移动设备的快速增长和云计算范式的出现,基于位置的服务(LBS)近年来正在蓬勃发展。在建立LBS的挑战中,用户隐私问题成为最重要的问题。成功的保留隐私的LBS必须安全并提供准确的查询[例如, $ k $ -最近邻居(NN)]结果。在这项工作中,我们提出了一个专用循环查询协议(PCQP)来处理隐私和保存隐私LBS的准确性问题。该协议由一个空间填充曲线和一个公共密钥同态密码系统组成。首先,我们借助Moore曲线连接地图上的兴趣点(POI)以形成圆形结构。然后使用Paillier密码系统的同态性来执行存储在服务器端的POI相关信息(POI-info)的秘密循环移位。由于移动后的POI信息和移动量是加密的,因此LBS提供者(例如服务器)在查询过程中不了解用户的位置。只要在每个查询之前执行了上述秘密循环移位,该协议就可以抵抗相关攻击并支持多用户方案。换句话说,所提出协议的鲁棒性与一次性填充加密方案的鲁棒性相同。结果,在没有可信赖的第三方的帮助下,所提出协议的安全级别接近完美的保密性,并且仿真结果表明 $ k $ <即使 $ k $ ,所提出协议的/ tex> -NN查询准确率仍高于90%大。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号