BPPF:用于移动群组感知的双边隐私保护框架

Liu Junyu, Yongjian Yang, Wang En
{"title":"BPPF:用于移动群组感知的双边隐私保护框架","authors":"Liu Junyu, Yongjian Yang, Wang En","doi":"10.12142/ZTECOM.202102004","DOIUrl":null,"url":null,"abstract":"With the emergence of mobile crowdsensing (MCS), merchants can use their mo⁃ bile devices to collect data that customers are interested in. Now there are many mobile crowdsensing platforms in the market, such as Gigwalk, Uber and Checkpoint, which pub⁃ lish and select the right workers to complete the task of some specific locations (for example, taking photos to collect the price of goods in a shopping mall). In mobile crowdsensing, in or⁃ der to select the right workers, the platform needs the actual location information of workers and tasks, which poses a risk to the location privacy of workers and tasks. In this paper, we study privacy protection in MCS. The main challenge is to assign the most suitable worker to a task without knowing the task and the actual location of the worker. We propose a bilateral privacy protection framework based on matrix multiplication, which can protect the location privacy between the task and the worker, and keep their relative distance unchanged.","PeriodicalId":61991,"journal":{"name":"ZTE Communications","volume":"19 1","pages":"20-28"},"PeriodicalIF":0.0000,"publicationDate":"2021-07-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"BPPF: Bilateral Privacy-Preserving Framework for Mobile Crowdsensing\",\"authors\":\"Liu Junyu, Yongjian Yang, Wang En\",\"doi\":\"10.12142/ZTECOM.202102004\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"With the emergence of mobile crowdsensing (MCS), merchants can use their mo⁃ bile devices to collect data that customers are interested in. Now there are many mobile crowdsensing platforms in the market, such as Gigwalk, Uber and Checkpoint, which pub⁃ lish and select the right workers to complete the task of some specific locations (for example, taking photos to collect the price of goods in a shopping mall). In mobile crowdsensing, in or⁃ der to select the right workers, the platform needs the actual location information of workers and tasks, which poses a risk to the location privacy of workers and tasks. In this paper, we study privacy protection in MCS. The main challenge is to assign the most suitable worker to a task without knowing the task and the actual location of the worker. We propose a bilateral privacy protection framework based on matrix multiplication, which can protect the location privacy between the task and the worker, and keep their relative distance unchanged.\",\"PeriodicalId\":61991,\"journal\":{\"name\":\"ZTE Communications\",\"volume\":\"19 1\",\"pages\":\"20-28\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2021-07-27\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"ZTE Communications\",\"FirstCategoryId\":\"1093\",\"ListUrlMain\":\"https://doi.org/10.12142/ZTECOM.202102004\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"ZTE Communications","FirstCategoryId":"1093","ListUrlMain":"https://doi.org/10.12142/ZTECOM.202102004","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

随着移动众包(MCS)的出现,商家可以使用他们的移动设备来收集客户感兴趣的数据。现在市场上有许多移动众包平台,如Gigwalk、优步和Checkpoint,哪些酒吧和选择合适的员工来完成某些特定地点的任务(例如,在购物中心拍照收集商品价格)。在移动众筹中,为了选择合适的工作人员,平台需要工作人员和任务的实际位置信息,这对工作人员和工作任务的位置隐私构成了风险。在本文中,我们研究了MCS中的隐私保护。主要的挑战是在不知道任务和工人的实际位置的情况下,为任务分配最合适的工人。我们提出了一种基于矩阵乘法的双边隐私保护框架,该框架可以保护任务和工作人员之间的位置隐私,并保持他们的相对距离不变。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
BPPF: Bilateral Privacy-Preserving Framework for Mobile Crowdsensing
With the emergence of mobile crowdsensing (MCS), merchants can use their mo⁃ bile devices to collect data that customers are interested in. Now there are many mobile crowdsensing platforms in the market, such as Gigwalk, Uber and Checkpoint, which pub⁃ lish and select the right workers to complete the task of some specific locations (for example, taking photos to collect the price of goods in a shopping mall). In mobile crowdsensing, in or⁃ der to select the right workers, the platform needs the actual location information of workers and tasks, which poses a risk to the location privacy of workers and tasks. In this paper, we study privacy protection in MCS. The main challenge is to assign the most suitable worker to a task without knowing the task and the actual location of the worker. We propose a bilateral privacy protection framework based on matrix multiplication, which can protect the location privacy between the task and the worker, and keep their relative distance unchanged.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
1320
期刊最新文献
Artificial Intelligence Rehabilitation Evaluation and Training System for Degeneration of Joint Disease A Survey of Intelligent Sensing Technologies in Autonomous Driving Using UAV to Detect Truth for Clean Data Collection in Sensor‑Cloud Systems Semiconductor Optical Amplifier and Gain Chip Used in Wavelength Tunable Lasers Feedback‑Aware Anomaly Detection Through Logs for Large‑Scale Software Systems
×
引用
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