Reliable and Privacy-Preserving Task Matching in Blockchain-Based Crowdsourcing

被引:11
作者
Wang, Baolai [1 ]
Fu, Shaojing [1 ]
Zhang, Xuyun [2 ]
Xie, Tao [1 ]
Lyu, Lingjuan [3 ]
Luo, Yuchuan [1 ]
机构
[1] Natl Univ Def Technol, Changsha, Hunan, Peoples R China
[2] Macquarie Univ, Sydney, NSW, Australia
[3] Natl Univ Singapore, Singapore, Singapore
来源
PROCEEDINGS OF THE 30TH ACM INTERNATIONAL CONFERENCE ON INFORMATION & KNOWLEDGE MANAGEMENT, CIKM 2021 | 2021年
基金
澳大利亚研究理事会;
关键词
crowdsourcing; task matching; privacy-preserving; multi-keyword; blockchain;
D O I
10.1145/3459637.3482385
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
With the number of users in crowdsourcing increasing rapidly, task matching service is attracting more and more attention. However, it also causes many security concerns, one of which is the leakage of sensitive information. Privacy-preserving task matching techniques can protect the private information of task requesters and workers. Whereas existing privacy-preserving task matching schemes are constructed on a central server, and thereby they may suffer from potential wrongdoings of a malicious server. In addition, most of them only provide accurate task matching, which means that they cannot tolerate keyword spelling errors, leading to the decline of task matching accuracy. In this paper, we propose a Reliable and Privacy-preserving Task Matching scheme (RPTM) for crowdsourcing. To guarantee the reliability of task matching results, RPTM employs smart contracts to ensure that operations of RPTM are faithfully performed. However, it may still disclose the privacy of users due to the transparency of the blockchain. In order to deal with this problem, RPTM can perform task matching service without compromising the privacy of task requesters and workers by leveraging a novel integer vector encryption scheme. Moreover, RPTM supports multi-keyword fuzzy matching by exploiting locality sensitive hashing and Bloom filter, which can tolerate keyword spelling errors and different expression formats. Extensive analysis and experiments based on a test net of EOS show that RPTM is efficient and secure.
引用
收藏
页码:1879 / 1888
页数:10
相关论文
共 29 条
[1]  
Ambati Vamsi, 2011, WORKSH 25 AAAI C ART
[2]  
[Anonymous], IEEE T SERVICES COMP
[3]  
[Anonymous], 2015, INT C THEOR APPL CRY, DOI DOI 10.1007/978-3-662-48797-6_20
[4]  
[Anonymous], PROC CVPR IEEE
[5]  
[Anonymous], 2018, INFORM SCI
[6]   SPACE/TIME TRADE/OFFS IN HASH CODING WITH ALLOWABLE ERRORS [J].
BLOOM, BH .
COMMUNICATIONS OF THE ACM, 1970, 13 (07) :422-&
[7]  
Buterin Vitalik, 2019, ETHEREUM IS GLOBAL O
[8]   Histograms of oriented gradients for human detection [J].
Dalal, N ;
Triggs, B .
2005 IEEE COMPUTER SOCIETY CONFERENCE ON COMPUTER VISION AND PATTERN RECOGNITION, VOL 1, PROCEEDINGS, 2005, :886-893
[9]  
Difallah Djellel Eddine, 2015, 24 INT C
[10]   Shared and searchable encrypted data for untrusted servers [J].
Dong, Changyu ;
Russello, Giovanni ;
Dulay, Naranker .
JOURNAL OF COMPUTER SECURITY, 2011, 19 (03) :367-397