VP2-Match: Verifiable Privacy-Aware and Personalized Crowdsourcing Task Matching via Blockchain

被引:3
作者
Wu, Haiqin [1 ]
Dudder, Boris [2 ]
Jiang, Shunrong [3 ]
Wang, Liangmin [4 ]
机构
[1] East China Normal Univ, Software Engn Inst, Shanghai Key Lab Trustworthy Comp, Shanghai 200062, Peoples R China
[2] Univ Copenhagen, Dept Comp Sci, DK-2100 Copenhagen, Denmark
[3] China Univ Min & Technol, Dept Informat Sci, Xuzhou 221116, Jiangsu, Peoples R China
[4] Southeast Univ, Sch Cyber Sci & Engn, Nanjing 211100, Jiangsu, Peoples R China
基金
中国国家自然科学基金; 国家重点研发计划;
关键词
Task analysis; Vectors; Privacy; Cryptography; Encryption; Blockchain; crowdsourcing; personalized task allocation; privacy protection; public verifiability; SECURE; ALLOCATION; QUERIES;
D O I
10.1109/TMC.2024.3369085
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
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 VP2-Match, a blockchain-assisted (publicly) verifiable privacy-aware crowdsourcing task matching scheme with personalization. VP2-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 VP2-Match, respectively.
引用
收藏
页码:9913 / 9930
页数:18
相关论文
共 48 条
  • [1] [Anonymous], 2013, IACR CRYPTOL EPRINT
  • [2] [Anonymous], 2012, P 3 INNOVATIONS THEO, DOI 10.1145/ 2090236.2090263
  • [3] Bellare M., 1993, P ACM C COMP COMM SE, P73
  • [4] SPACE/TIME TRADE/OFFS IN HASH CODING WITH ALLOWABLE ERRORS
    BLOOM, BH
    [J]. COMMUNICATIONS OF THE ACM, 1970, 13 (07) : 422 - &
  • [5] Short group signatures
    Boneh, D
    Boyen, X
    Shacham, H
    [J]. ADVANCES IN CRYPTOLOGY - CRYPTO 2004, PROCEEDINGS, 2004, 3152 : 41 - 55
  • [6] Boneh D, 2007, LECT NOTES COMPUT SC, V4392, P535
  • [7] Bulletproofs: Short Proofs for Confidential Transactions and More
    Bunz, Benedikt
    Bootle, Jonathan
    Boneh, Dan
    Poelstra, Andrew
    Wuille, Pieter
    Maxwell, Greg
    [J]. 2018 IEEE SYMPOSIUM ON SECURITY AND PRIVACY (SP), 2018, : 315 - 334
  • [8] Building a Secure Knowledge Marketplace Over Crowdsensed Data Streams
    Cai, Chengjun
    Zheng, Yifeng
    Zhou, Anxin
    Wang, Cong
    [J]. IEEE TRANSACTIONS ON DEPENDABLE AND SECURE COMPUTING, 2021, 18 (06) : 2601 - 2616
  • [9] Perfect hashing
    Czech, ZJ
    Havas, G
    Majewski, BS
    [J]. THEORETICAL COMPUTER SCIENCE, 1997, 182 (1-2) : 1 - 143
  • [10] FedCrowd: A Federated and Privacy-Preserving Crowdsourcing Platform on Blockchain
    Guo, Yu
    Xie, Hongcheng
    Miao, Yinbin
    Wang, Cong
    Jia, Xiaohua
    [J]. IEEE TRANSACTIONS ON SERVICES COMPUTING, 2022, 15 (04) : 2060 - 2073