Indexed by:
Abstract:
When enjoying mobile crowdsensing (MCS), it is vital to evaluate the trustworthiness of mobile users (MUs) without disclosing their sensitive information. However, the existing schemes ignore this requirement in the multiple crowdsourcers (CSs) scenario. The lack of a credible sharing about MUs' trustworthiness results in an inaccurate trust evaluation, disabling allocating tasks to reliable MUs. To address it, based on the analysis of the desired properties, we propose a scheme enabling d ependable d ata collection with m ultiple crowdsourcers t rust s haring ( (DMTS)-M-2 ). Specifically, we design the MU anonymous management. Two kinds of MU generated pseudonym systems without relationships are presented to mark each MU in trust evaluation and task execution, respectively. Through the devised pseudonym changes on these pseudonyms and the common token distribution algorithm, (DMTS)-M-2 realizes privacy-preserving trust sharing. Moreover, to guarantee credible sharing, based on the hash chain, (DMTS)-M-2 records MUs' trustworthiness with the unforgeable signature on the blockchain established by multiple CSs which do not trust each other naturally. Extensive experiments show that compared with the other works, (DMTS)-M-2 's detection ratio of vicious MUs and the percentage of reliable MUs among the selected ones can increase by 208.61% and 28.27%. Both computational and communication delays are limited.
Keyword:
Reprint 's Address:
Email:
Version:
Source :
IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING
ISSN: 1041-4347
Year: 2024
Issue: 3
Volume: 36
Page: 927-942
8 . 9 0 0
JCR@2023
Cited Count:
SCOPUS Cited Count:
ESI Highly Cited Papers on the List: 0 Unfold All
WanFang Cited Count:
Chinese Cited Count:
30 Days PV: 0
Affiliated Colleges: