PGVMatch: Privacy-Preserving and Fine-Grained Crowdsourcing Task Matching With Lightweight On-Chain Public Verifiability
- 28 March 2025
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Mobile Computing
- Vol. 24 (9) , 8642-8655
Abstract
Secure task matching has been a crucial research problem in crowdsourcing, requiring the alignment of workers’ preferences and requesters’ task requirements while ensuring user privacy and matching integrity. Recently, some researchers applied blockchain to crowdsourcing, either replacing the platform for decentralization or recording proofs for public verification to defend against malicious platforms. However, they still suffer from unitary coarse-grained matching models or expensive on-chain costs. To address these limitations, we propose PGVMatch, a privacy-aware and fine-grained crowdsourcing task-matching scheme with lightweight on-chain public verifiability. Our scheme is constructed on our newly proposed cryptographic primitive–Multi-authority Attribute-Based Keyword Search with Public Verifiability (MABKS-PV), which avoids access policy leakage and key escrow risks on a single authority, meanwhile adding constant-size proof generation and lightweight verification algorithms to a basic ABKS construction. In PGVMatch, requesters can select workers with fine-grained attribute demands, and workers can pick interested tasks with multi-keyword search, preserving dual-side privacy. The matching process is conducted off-chain, while constant-size proofs are recorded on-chain for efficient and public verification of matching integrity. Security analysis and extensive experiments on the Hyperledger Fabric blockchain demonstrate both the security and our superior performance. PGVMatch outperforms the existing scheme with the fastest matching result verification, achieving a 29% improvement in throughput and a 33% reduction in latency.Keywords
Funding Information
- National Key R&D Program of China (2020YFA0712300, 2022YFB2701400)
- National Natural Science Foundation of China (62202167, 62172162, 62132005)
- Shanghai Trusted Industry Internet Software Collaborative Innovation Center
- Fundamental Research Funds for the Central Universities
This publication has 40 references indexed in Scilit:
- Bilateral Secure and Decentralized Crowdsourcing Task Matching Atop Consortium Blockchain2024
- A Secure Task Matching Scheme in Crowdsourcing Based on Blockchain2022
- A survey of mobile crowdsensing and crowdsourcing strategies for smart mobile device usersCCF Transactions on Pervasive Computing and Interaction, 2022
- Privacy-preserving task recommendation with win-win incentives for mobile crowdsourcingInformation Sciences, 2020
- SecBCS: a secure and privacy-preserving blockchain-based crowdsourcing systemScience China Information Sciences, 2020
- BPTM: Blockchain-Based Privacy-Preserving Task Matching in CrowdsourcingIEEE Access, 2019
- Towards secure and truthful task assignment in spatial crowdsourcingWorld Wide Web, 2018
- Efficient task assignment in spatial crowdsourcing with worker and task privacy protectionGeoInformatica, 2017
- Computationally Efficient Ciphertext-Policy Attribute-Based Encryption with Constant-Size Ciphertexts2014
- Decentralizing Attribute-Based Encryption2011