首页> 外文期刊>Wireless personal communications: An Internaional Journal >Privacy Preserving in Cloud Environment for Obstructed Shortest Path Query
【24h】

Privacy Preserving in Cloud Environment for Obstructed Shortest Path Query

机译:阻塞最短路径查询云环境中保留的隐私

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

摘要

With the prosperity of location-based services, shortest path query became one of the most common services, and provided convenience for finding the best way to arrive at the destination of users. However, in order to obtain the service, users had to submit the current locations to a data owner, and this process may pose privacy threats to users. More seriously, if the data owner outsourcing the query data to a cloud server for calculating the shortest distance, users' privacy may be leaked even further. To cope with the problem of outsourcing computation, based the homomorphic encryption and secure multiparty computation, this manuscript presents a framework to reduce the likelihood of private information leakage, and privacy preservation of both the user, and the data owner. In this framework, two different conditions were considered, and the shortest path was computed with or without obstruction on the road. Thereafter, two protocols called "query with obstruction" and "query without obstruction" are presented.
机译:随着基于位置的服务的繁荣,最短路径查询成为最常见的服务之一,为找到了到达用户目的地的最佳方式提供了便利性。但是,为了获得服务,用户必须将当前位置提交给数据所有者,此过程可能会对用户构成隐私威胁。更严重的是,如果数据所有者将查询数据外包给云服务器计算最短距离,则用户的隐私可能进一步泄露。为了应对外包计算的问题,基于同型加密和安全多方计算,该稿件提出了一个框架,以减少私人信息泄漏的可能性,以及用户和数据所有者的隐私保存。在该框架中,考虑了两个不同的条件,并且在路上计算了最短路径或没有阻碍。此后,提出了一个名为“查询障碍物”和“没有障碍物查询”的两个协议。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号