Publication Type

Journal Article

Version

publishedVersion

Publication Date

1-2021

Abstract

Task matching in crowdsourcing has been extensively explored with the increasing popularity of crowdsourcing. However, privacy of tasks and workers is usually ignored in most of exiting solutions. In this paper, we study the problem of privacy-preserving task matching for crowdsourcing with multiple requesters and multiple workers. Instead of utilizing proxy re-encryption, we propose a proxy-free task matching scheme for multi-requester/multi-worker crowdsourcing, which achieves task-worker matching over encrypted data with scalability and non-interaction. We further design two different mechanisms for worker revocation including ServerLocal Revocation (SLR) and Global Revocation (GR), which realize efficient worker revocation with minimal overhead on the whole system. The proposed scheme is provably secure in the random oracle model under the Decisional q-Combined Bilinear Diffie-Hellman (q-DCDBH) assumption. Comprehensive theoretical analysis and detailed simulation results show that the proposed scheme outperforms the state-of-the-art work.

Keywords

Crowdsourcing, multi-requester/multi-worker, task matching, privacy, proxy-free, revocation

Discipline

Databases and Information Systems | Information Security

Research Areas

Information Systems and Management

Publication

IEEE Transactions on Dependable and Secure Computing

Volume

18

Issue

1

First Page

117

Last Page

130

ISSN

1545-5971

Identifier

10.1109/TDSC.2018.2875682

Publisher

Institute of Electrical and Electronics Engineers

Download

Share

COinS