Invisible, Yet Trusted: Blockchain-Empowered Privacy-Preserving Spatio-Temporal Task Matching in Crowdsourcing With Efficient Public Verification

IF 8.8 2区 计算机科学 Q1 COMPUTER SCIENCE, INFORMATION SYSTEMS
IEEE Transactions on Mobile Computing Pub Date : 2026-07-01 Epub Date: 2026-01-16 DOI:10.1109/TMC.2026.3654940
Xu Yang;Saiyu Qi;Jiayu Zhou;Zheng He;Yong Qi
{"title":"Invisible, Yet Trusted: Blockchain-Empowered Privacy-Preserving Spatio-Temporal Task Matching in Crowdsourcing With Efficient Public Verification","authors":"Xu Yang;Saiyu Qi;Jiayu Zhou;Zheng He;Yong Qi","doi":"10.1109/TMC.2026.3654940","DOIUrl":null,"url":null,"abstract":"Task matching is a core component of crowdsourcing systems, enabling efficient assignment of tasks to appropriate workers. However, this process often requires both task requesters and workers to disclose sensitive contextual information, such as spatial locations and temporal availability, raising serious privacy concerns. Although various cryptographic techniques and blockchain-based solutions have been proposed to preserve privacy and enhance trust, existing schemes still face three critical limitations: reliance on centralized key authorities, lack of support for fine-grained spatio-temporal constraints, and inefficient public verification mechanisms. To address these challenges, we propose PVSTMatch, a blockchain-empowered privacy-preserving spatio-temporal task matching scheme in crowdsourcing. PVSTMatch eliminates the need for trusted third parties through an authority-free authorization mechanism, supports secure spatio-temporal matching by designing a compact secure comparison method, and enables efficient public verifiability via a succinct verification mechanism. Furthermore, we introduce GE-PVSTMatch, a gas-efficient variant that significantly reduces on-chain storage costs. Security analysis and performance evaluation demonstrate that our schemes achieve strong bilateral privacy, verification correctness, and practical efficiency, making them well-suited for real-world decentralized crowdsourcing platforms.","PeriodicalId":50389,"journal":{"name":"IEEE Transactions on Mobile Computing","volume":"25 7","pages":"9660-9675"},"PeriodicalIF":8.8000,"publicationDate":"2026-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Transactions on Mobile Computing","FirstCategoryId":"94","ListUrlMain":"https://ieeexplore.ieee.org/document/11355819/","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"2026/1/16 0:00:00","PubModel":"Epub","JCR":"Q1","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 0

Abstract

Task matching is a core component of crowdsourcing systems, enabling efficient assignment of tasks to appropriate workers. However, this process often requires both task requesters and workers to disclose sensitive contextual information, such as spatial locations and temporal availability, raising serious privacy concerns. Although various cryptographic techniques and blockchain-based solutions have been proposed to preserve privacy and enhance trust, existing schemes still face three critical limitations: reliance on centralized key authorities, lack of support for fine-grained spatio-temporal constraints, and inefficient public verification mechanisms. To address these challenges, we propose PVSTMatch, a blockchain-empowered privacy-preserving spatio-temporal task matching scheme in crowdsourcing. PVSTMatch eliminates the need for trusted third parties through an authority-free authorization mechanism, supports secure spatio-temporal matching by designing a compact secure comparison method, and enables efficient public verifiability via a succinct verification mechanism. Furthermore, we introduce GE-PVSTMatch, a gas-efficient variant that significantly reduces on-chain storage costs. Security analysis and performance evaluation demonstrate that our schemes achieve strong bilateral privacy, verification correctness, and practical efficiency, making them well-suited for real-world decentralized crowdsourcing platforms.
看不见,但可信:区块链授权的保护隐私的时空任务匹配与有效的公共验证
任务匹配是众包系统的核心组成部分,可以将任务有效地分配给合适的工人。然而,此过程通常要求任务请求者和工作人员都公开敏感的上下文信息,例如空间位置和时间可用性,这引起了严重的隐私问题。尽管已经提出了各种加密技术和基于区块链的解决方案来保护隐私和增强信任,但现有方案仍然面临三个关键限制:依赖集中式密钥权威,缺乏对细粒度时空约束的支持,以及低效的公共验证机制。为了应对这些挑战,我们提出了PVSTMatch,这是一种在众包中支持区块链保护隐私的时空任务匹配方案。PVSTMatch通过无权限授权机制消除了对可信第三方的需求,通过设计紧凑的安全比较方法支持安全的时空匹配,并通过简洁的验证机制实现高效的公共可验证性。此外,我们还推出了GE-PVSTMatch,这是一种节能的变体,可显着降低链上存储成本。安全性分析和性能评估表明,我们的方案具有很强的双边隐私性、验证正确性和实际效率,非常适合现实世界的去中心化众包平台。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
IEEE Transactions on Mobile Computing
IEEE Transactions on Mobile Computing 工程技术-电信学
CiteScore
12.90
自引率
2.50%
发文量
403
审稿时长
6.6 months
期刊介绍: IEEE Transactions on Mobile Computing addresses key technical issues related to various aspects of mobile computing. This includes (a) architectures, (b) support services, (c) algorithm/protocol design and analysis, (d) mobile environments, (e) mobile communication systems, (f) applications, and (g) emerging technologies. Topics of interest span a wide range, covering aspects like mobile networks and hosts, mobility management, multimedia, operating system support, power management, online and mobile environments, security, scalability, reliability, and emerging technologies such as wearable computers, body area networks, and wireless sensor networks. The journal serves as a comprehensive platform for advancements in mobile computing research.
×
引用
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学术文献互助群
群 号:604180095
Book学术官方微信
小红书