VP2-Match: Verifiable Privacy-Aware and Personalized Crowdsourcing Task Matching via Blockchain
Research output: Contribution to journal › Journal article › Research › peer-review
Standard
VP2-Match : Verifiable Privacy-Aware and Personalized Crowdsourcing Task Matching via Blockchain. / Wu, Haiqin; Dudder, Boris; Jiang, Shunrong; Wang, Liangmin.
In: IEEE Transactions on Mobile Computing, 2024.Research output: Contribution to journal › Journal article › Research › peer-review
Harvard
APA
Vancouver
Author
Bibtex
}
RIS
TY - JOUR
T1 - VP2-Match
T2 - Verifiable Privacy-Aware and Personalized Crowdsourcing Task Matching via Blockchain
AU - Wu, Haiqin
AU - Dudder, Boris
AU - Jiang, Shunrong
AU - Wang, Liangmin
N1 - Publisher Copyright: IEEE
PY - 2024
Y1 - 2024
N2 - Privacy-aware task allocation/matching has been an active research focus in crowdsourcing. However, existing studies focus on an honest-but-curious assumption and a single-attribute matching model. There is a lack of adequate attention paid to scheme designs against malicious behaviors and supporting user-side personalized task matching over multiple attributes. A few recent works employ blockchain and cryptographic techniques to decentralize the matching procedure with verifiable and privacy-preserving on-chain executions. However, they still bear expensive on-chain overhead. In this paper, we propose VP$^{2}$-Match, a blockchain-assisted (publicly) verifiable privacy-aware crowdsourcing task matching scheme with personalization. VP$^{2}$-Match extends symmetric hidden vector encryption for user-side expressive matching without compromising their privacy. It avoids costly on-chain matching by letting the blockchain only store evidence/proofs for public verifiability of the matching correctness and for enforcing fair interactions against misbehaviors. Specifically, we construct extended attribute sets and solve matching verification by an algorithmic reduction into subset verification with an accumulator for proof generation. Formal security proof and extensive comparison experiments on Ethereum demonstrate the provable security and better performance of VP$^{2}$-Match, respectively.
AB - Privacy-aware task allocation/matching has been an active research focus in crowdsourcing. However, existing studies focus on an honest-but-curious assumption and a single-attribute matching model. There is a lack of adequate attention paid to scheme designs against malicious behaviors and supporting user-side personalized task matching over multiple attributes. A few recent works employ blockchain and cryptographic techniques to decentralize the matching procedure with verifiable and privacy-preserving on-chain executions. However, they still bear expensive on-chain overhead. In this paper, we propose VP$^{2}$-Match, a blockchain-assisted (publicly) verifiable privacy-aware crowdsourcing task matching scheme with personalization. VP$^{2}$-Match extends symmetric hidden vector encryption for user-side expressive matching without compromising their privacy. It avoids costly on-chain matching by letting the blockchain only store evidence/proofs for public verifiability of the matching correctness and for enforcing fair interactions against misbehaviors. Specifically, we construct extended attribute sets and solve matching verification by an algorithmic reduction into subset verification with an accumulator for proof generation. Formal security proof and extensive comparison experiments on Ethereum demonstrate the provable security and better performance of VP$^{2}$-Match, respectively.
KW - blockchain
KW - Blockchains
KW - Crowdsourcing
KW - Cryptography
KW - Encryption
KW - personalized task allocation
KW - Privacy
KW - privacy protection
KW - public verifiability
KW - Task analysis
KW - Vectors
UR - http://www.scopus.com/inward/record.url?scp=85186108990&partnerID=8YFLogxK
U2 - 10.1109/TMC.2024.3369085
DO - 10.1109/TMC.2024.3369085
M3 - Journal article
AN - SCOPUS:85186108990
JO - IEEE Transactions on Mobile Computing
JF - IEEE Transactions on Mobile Computing
SN - 1536-1233
ER -
ID: 385650129