{"title":"空间众包中保护隐私的竞争性绕行任务","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.5000,"publicationDate":"2024-12-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"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.5000,\"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}","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}
Privacy-Preserving Competitive Detour Tasking in Spatial Crowdsourcing
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.
期刊介绍:
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.