A Location Privacy-Preserving Protocol Based on Homomorphic Encryption and Key Agreement

Xiao-ling Zhu, Yang Lu, Xiaojuan Zhu, Shuwei Qiu
{"title":"A Location Privacy-Preserving Protocol Based on Homomorphic Encryption and Key Agreement","authors":"Xiao-ling Zhu, Yang Lu, Xiaojuan Zhu, Shuwei Qiu","doi":"10.1109/ISCC-C.2013.17","DOIUrl":null,"url":null,"abstract":"Location-based services (LBS) bring so much convenience to our daily life. However they have incurred serious location privacy problems. K-anonymity is the one of most popular privacy-preserving methods. The method relying on a trusted third party (TTP) might cause the TTP to become a performance bottleneck. So TTP-free protocols are proposed. But existing TTP-free protocols cannot resist attacks from multiple users colluding with a LBS provider. To solve the problems, this paper proposes a novel location privacy-preserving protocol. The protocol uses key agreement to construct the perturbations which can be removed on the whole. The perturbations are used to disguise real locations, meanwhile, they do not affect LBS service quality. With the help of homomorphic encryption, the LBS provider can compute the centroid of a companion set while it does not know the locations of the members in the set. The analysis shows that the protocol can resist location privacy attacks from insiders and outsiders, especially from multiple users colluding with the LBS provider. The protocol achieves high service quality while providing strong location privacy protection for LBS.","PeriodicalId":313511,"journal":{"name":"2013 International Conference on Information Science and Cloud Computing Companion","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2013-12-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"8","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013 International Conference on Information Science and Cloud Computing Companion","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISCC-C.2013.17","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 8

Abstract

Location-based services (LBS) bring so much convenience to our daily life. However they have incurred serious location privacy problems. K-anonymity is the one of most popular privacy-preserving methods. The method relying on a trusted third party (TTP) might cause the TTP to become a performance bottleneck. So TTP-free protocols are proposed. But existing TTP-free protocols cannot resist attacks from multiple users colluding with a LBS provider. To solve the problems, this paper proposes a novel location privacy-preserving protocol. The protocol uses key agreement to construct the perturbations which can be removed on the whole. The perturbations are used to disguise real locations, meanwhile, they do not affect LBS service quality. With the help of homomorphic encryption, the LBS provider can compute the centroid of a companion set while it does not know the locations of the members in the set. The analysis shows that the protocol can resist location privacy attacks from insiders and outsiders, especially from multiple users colluding with the LBS provider. The protocol achieves high service quality while providing strong location privacy protection for LBS.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于同态加密和密钥协议的位置隐私保护协议
基于位置的服务(LBS)给我们的日常生活带来了很多便利。然而,它们已经引起了严重的位置隐私问题。k -匿名是最流行的隐私保护方法之一。依赖于可信第三方(TTP)的方法可能导致TTP成为性能瓶颈。因此提出了无ttp协议。但是现有的无ttp协议无法抵御来自多个用户与一个LBS提供商串通的攻击。为了解决这些问题,本文提出了一种新的位置隐私保护协议。该协议使用密钥一致性来构造可以从整体上消除的扰动。这些扰动用于掩盖真实位置,同时不影响LBS服务质量。在同态加密的帮助下,LBS提供者可以在不知道同伴集中成员位置的情况下计算同伴集的质心。分析表明,该协议可以抵御来自内部和外部的位置隐私攻击,特别是来自多个用户与LBS提供商串通的攻击。该协议在实现高服务质量的同时,为LBS提供了较强的位置隐私保护。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Commercial Bank Stress Tests Based on Credit Risk An Instant-Based Qur'an Memorizer Application Interface Optimization of PID Parameters Based on Improved Particle-Swarm-Optimization The Universal Approximation Capabilities of 2pi-Periodic Approximate Identity Neural Networks Survey of Cloud Messaging Push Notification Service
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1