Privacy preserving proximity testing using elliptic curves

M. N. Sakib, Chin-Tser Huang
{"title":"Privacy preserving proximity testing using elliptic curves","authors":"M. N. Sakib, Chin-Tser Huang","doi":"10.1109/ATNAC.2016.7878794","DOIUrl":null,"url":null,"abstract":"The availability of GPS in smartphones and other wireless devices has made location based services extremely popular. One of the most widely used location based services is finding nearby friends. Popular social networks like Facebook offer this service purely based on exact user locations. To subscribe to this feature, users are forced to let the service provider know their actual locations, compromising their location privacy. In this paper, we present a protocol based on elliptic curve cryptography concepts for proximity testing which can preserve location privacy of the users. Our protocol enables two parties, Alice and Bob, to test whether they are within an agreed upon distance range from each other without revealing their exact location. Our security analysis shows that our protocol is secure against most known location privacy threats including location triangulation attacks. From experimental evaluation performed on prototype implementation, we found that our protocol is practical for resource-constrained smartphone devices requiring a reasonably small execution time (53 ms) without the communication overhead.","PeriodicalId":317649,"journal":{"name":"2016 26th International Telecommunication Networks and Applications Conference (ITNAC)","volume":"295 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2016 26th International Telecommunication Networks and Applications Conference (ITNAC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ATNAC.2016.7878794","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 6

Abstract

The availability of GPS in smartphones and other wireless devices has made location based services extremely popular. One of the most widely used location based services is finding nearby friends. Popular social networks like Facebook offer this service purely based on exact user locations. To subscribe to this feature, users are forced to let the service provider know their actual locations, compromising their location privacy. In this paper, we present a protocol based on elliptic curve cryptography concepts for proximity testing which can preserve location privacy of the users. Our protocol enables two parties, Alice and Bob, to test whether they are within an agreed upon distance range from each other without revealing their exact location. Our security analysis shows that our protocol is secure against most known location privacy threats including location triangulation attacks. From experimental evaluation performed on prototype implementation, we found that our protocol is practical for resource-constrained smartphone devices requiring a reasonably small execution time (53 ms) without the communication overhead.
使用椭圆曲线的隐私保护接近测试
GPS在智能手机和其他无线设备上的可用性使得基于位置的服务非常受欢迎。最广泛使用的定位服务之一是寻找附近的朋友。像Facebook这样的流行社交网络提供的这项服务完全基于用户的精确位置。要订阅此功能,用户必须让服务提供商知道他们的实际位置,从而损害他们的位置隐私。本文提出了一种基于椭圆曲线密码学概念的近距离测试协议,可以保护用户的位置隐私。我们的协议使双方,Alice和Bob,能够在不透露确切位置的情况下测试他们是否在约定的距离范围内。我们的安全分析表明,我们的协议对大多数已知的位置隐私威胁都是安全的,包括位置三角测量攻击。从对原型实现进行的实验评估中,我们发现我们的协议对于资源受限的智能手机设备来说是实用的,需要相当小的执行时间(53毫秒),而且没有通信开销。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信