Privacy-Preserving Competitive Detour Tasking in Spatial Crowdsourcing

IF 5.8 2区 计算机科学 Q1 COMPUTER SCIENCE, INFORMATION SYSTEMS IEEE Transactions on Services Computing Pub Date : 2024-12-05 DOI:10.1109/TSC.2024.3511992
Yifeng Zheng;Menglun Zhou;Songlei Wang;Zhongyun Hua;Jinghua Jiang;Yansong Gao
{"title":"Privacy-Preserving Competitive Detour Tasking in Spatial Crowdsourcing","authors":"Yifeng Zheng;Menglun Zhou;Songlei Wang;Zhongyun Hua;Jinghua Jiang;Yansong Gao","doi":"10.1109/TSC.2024.3511992","DOIUrl":null,"url":null,"abstract":"Spatial crowdsourcing (SC) has recently emerged as a new crowdsourcing service paradigm, where workers move physically to designated locations to perform tasks. Most SC systems perform task assignment based on the spatial proximity between task locations and worker locations. Under such a strategy, workers can only perform tasks near them, which may result in low social welfare (i.e., the total profit of the platform and workers). In contrast, the newly emerging strategy of competitive task assignment (CTA) stimulates workers to compete for their preferred tasks, allowing optimization of the overall profit of SC systems. Among others, one novel CTA setting is competitive detour tasking, which allows workers to compete for tasks that need them to make detours from their original travel paths. However, it requires collecting each worker’s bidding profile which may expose private information. In light of this, in this article, we design, implement, and evaluate PrivCO, a new system framework enabling privacy-preserving competitive detour tasking services in SC. PrivCO delicately bridges state-of-the-art competitive detour tasking algorithms with lightweight cryptography, providing strong protections for workers’ bidding profiles. Extensive experiments over real-world datasets demonstrate that while offering strong security guarantees, PrivCO achieves social welfare comparable to the plaintext domain.","PeriodicalId":13255,"journal":{"name":"IEEE Transactions on Services Computing","volume":"18 1","pages":"385-398"},"PeriodicalIF":5.8000,"publicationDate":"2024-12-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Transactions on Services Computing","FirstCategoryId":"94","ListUrlMain":"https://ieeexplore.ieee.org/document/10778588/","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 0

Abstract

Spatial crowdsourcing (SC) has recently emerged as a new crowdsourcing service paradigm, where workers move physically to designated locations to perform tasks. Most SC systems perform task assignment based on the spatial proximity between task locations and worker locations. Under such a strategy, workers can only perform tasks near them, which may result in low social welfare (i.e., the total profit of the platform and workers). In contrast, the newly emerging strategy of competitive task assignment (CTA) stimulates workers to compete for their preferred tasks, allowing optimization of the overall profit of SC systems. Among others, one novel CTA setting is competitive detour tasking, which allows workers to compete for tasks that need them to make detours from their original travel paths. However, it requires collecting each worker’s bidding profile which may expose private information. In light of this, in this article, we design, implement, and evaluate PrivCO, a new system framework enabling privacy-preserving competitive detour tasking services in SC. PrivCO delicately bridges state-of-the-art competitive detour tasking algorithms with lightweight cryptography, providing strong protections for workers’ bidding profiles. Extensive experiments over real-world datasets demonstrate that while offering strong security guarantees, PrivCO achieves social welfare comparable to the plaintext domain.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
空间众包中保护隐私的竞争性绕行任务
空间众包(SC)最近作为一种新的众包服务范式出现,在这种服务范式中,工作人员实际移动到指定的地点执行任务。大多数SC系统根据任务位置和工人位置之间的空间接近度来执行任务分配。在这种策略下,工人只能在他们附近执行任务,这可能导致社会福利低(即平台和工人的总利润)。相比之下,新出现的竞争性任务分配(CTA)策略刺激工人竞争他们喜欢的任务,使SC系统的整体利润最优化。其中,一个新颖的CTA设置是竞争性绕行任务,它允许员工竞争需要他们从原来的旅行路径绕行的任务。然而,它需要收集每个工人的投标档案,这可能会暴露私人信息。鉴于此,在本文中,我们设计、实现和评估了PrivCO,这是一种新的系统框架,可以在SC中实现保护隐私的竞争性绕路任务服务。PrivCO巧妙地将最先进的竞争性绕路任务算法与轻量级加密技术相结合,为工人的投标档案提供强大的保护。对真实世界数据集的广泛实验表明,PrivCO在提供强大的安全保证的同时,实现了与明文域相当的社会福利。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
IEEE Transactions on Services Computing
IEEE Transactions on Services Computing COMPUTER SCIENCE, INFORMATION SYSTEMS-COMPUTER SCIENCE, SOFTWARE ENGINEERING
CiteScore
11.50
自引率
6.20%
发文量
278
审稿时长
>12 weeks
期刊介绍: IEEE Transactions on Services Computing encompasses the computing and software aspects of the science and technology of services innovation research and development. It places emphasis on algorithmic, mathematical, statistical, and computational methods central to services computing. Topics covered include Service Oriented Architecture, Web Services, Business Process Integration, Solution Performance Management, and Services Operations and Management. The transactions address mathematical foundations, security, privacy, agreement, contract, discovery, negotiation, collaboration, and quality of service for web services. It also covers areas like composite web service creation, business and scientific applications, standards, utility models, business process modeling, integration, collaboration, and more in the realm of Services Computing.
期刊最新文献
Skillchain: A Service-Oriented Blockchain Platform for Secure and Scalable Microcredential Management Crowdsourcing Feature Selection via a Distributed Evolutionary Algorithm Enhancing MLLMs for Online Understanding in Video Services via Preference Optimization Scheduling Training-Inference Co-Location in Demand Response for Sustainable Edge AI AdpFL: A Privacy-Preserving Federated Learning Framework through Adaptive Model Pruning on Non-IID Data
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1