基于区块链的质量意识工人招聘计划的声誉隐私保护

IF 3 3区 计算机科学 Q2 COMPUTER SCIENCE, HARDWARE & ARCHITECTURE
Qingyong Deng;Qinghua Zuo;Zhetao Li;Haolin Liu;Yong Xie
{"title":"基于区块链的质量意识工人招聘计划的声誉隐私保护","authors":"Qingyong Deng;Qinghua Zuo;Zhetao Li;Haolin Liu;Yong Xie","doi":"10.1109/TNET.2024.3453056","DOIUrl":null,"url":null,"abstract":"Mobile Crowdsourcing (MCS) has become a novel paradigm for enabling data collection by worker recruitment, and the reputation plays a crucial role in achieving high-quality data. Although identity, data, and bid privacy preserving have been thoroughly investigated with the advance of blockchain technology, existing literature barely focuses on reputation privacy, which prevents malicious workers from submitting false data that could affect truth discovery for data requester. Therefore, we propose a Blockchain-Based Reputation Privacy Preserving for Quality-Aware Worker Recruitment Scheme (BRPP-QWR). First, we design a lightweight privacy preserving scheme for the whole life cycle of the worker’s reputation, which adopts sub-address retrieval technique combined with Pedersen Commitment and Compact Linkable Spontaneous Anonymous Group (CLSAG) signature to enable fast and anonymous verification of the reputation update process. Subsequently, to tackle the unknown worker recruitment problem, we propose a Reputation, Selfishness, and Quality-based Multi-Armed Bandit (RSQ-MAB) learning algorithm to select reliable and high-quality workers. Lastly, we implement a prototype system on Hyperledger Fabric to evaluate the performance of the reputation management scheme. The results indicate that the execution latency for the reputation score verification and retrieval latency can be reduced by an average of 6.30%–56.90% compared with ARMS-MCS. In addition, experimental results on both real and synthetic datasets show that the proposed RSQ-MAB algorithm achieves an increase of at least 20.05% in regard to the data requester’s total revenue and a decrease of at least 48.55% and 3.18% in regret and Multi-round Average Error (MAE), respectively, compared with other benchmark methods.","PeriodicalId":13443,"journal":{"name":"IEEE/ACM Transactions on Networking","volume":"32 6","pages":"5188-5203"},"PeriodicalIF":3.0000,"publicationDate":"2024-09-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Blockchain-Based Reputation Privacy Preserving for Quality-Aware Worker Recruitment Scheme in MCS\",\"authors\":\"Qingyong Deng;Qinghua Zuo;Zhetao Li;Haolin Liu;Yong Xie\",\"doi\":\"10.1109/TNET.2024.3453056\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Mobile Crowdsourcing (MCS) has become a novel paradigm for enabling data collection by worker recruitment, and the reputation plays a crucial role in achieving high-quality data. Although identity, data, and bid privacy preserving have been thoroughly investigated with the advance of blockchain technology, existing literature barely focuses on reputation privacy, which prevents malicious workers from submitting false data that could affect truth discovery for data requester. Therefore, we propose a Blockchain-Based Reputation Privacy Preserving for Quality-Aware Worker Recruitment Scheme (BRPP-QWR). First, we design a lightweight privacy preserving scheme for the whole life cycle of the worker’s reputation, which adopts sub-address retrieval technique combined with Pedersen Commitment and Compact Linkable Spontaneous Anonymous Group (CLSAG) signature to enable fast and anonymous verification of the reputation update process. Subsequently, to tackle the unknown worker recruitment problem, we propose a Reputation, Selfishness, and Quality-based Multi-Armed Bandit (RSQ-MAB) learning algorithm to select reliable and high-quality workers. Lastly, we implement a prototype system on Hyperledger Fabric to evaluate the performance of the reputation management scheme. The results indicate that the execution latency for the reputation score verification and retrieval latency can be reduced by an average of 6.30%–56.90% compared with ARMS-MCS. In addition, experimental results on both real and synthetic datasets show that the proposed RSQ-MAB algorithm achieves an increase of at least 20.05% in regard to the data requester’s total revenue and a decrease of at least 48.55% and 3.18% in regret and Multi-round Average Error (MAE), respectively, compared with other benchmark methods.\",\"PeriodicalId\":13443,\"journal\":{\"name\":\"IEEE/ACM Transactions on Networking\",\"volume\":\"32 6\",\"pages\":\"5188-5203\"},\"PeriodicalIF\":3.0000,\"publicationDate\":\"2024-09-11\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"IEEE/ACM Transactions on Networking\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://ieeexplore.ieee.org/document/10677381/\",\"RegionNum\":3,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"COMPUTER SCIENCE, HARDWARE & ARCHITECTURE\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE/ACM Transactions on Networking","FirstCategoryId":"94","ListUrlMain":"https://ieeexplore.ieee.org/document/10677381/","RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"COMPUTER SCIENCE, HARDWARE & ARCHITECTURE","Score":null,"Total":0}
引用次数: 0

摘要

移动众包(MCS)已经成为通过员工招聘收集数据的一种新模式,其声誉在获得高质量数据方面起着至关重要的作用。尽管随着区块链技术的进步,身份、数据和投标隐私保护已经得到了深入的研究,但现有文献几乎没有关注声誉隐私,这可以防止恶意工作者提交可能影响数据请求者发现真相的虚假数据。因此,我们提出了一种基于区块链的质量意识员工招聘计划(BRPP-QWR)的声誉隐私保护。首先,我们设计了一个工作者声誉全生命周期的轻量级隐私保护方案,该方案采用子地址检索技术,结合Pedersen承诺和Compact Linkable Spontaneous Anonymous Group (CLSAG)签名,实现了声誉更新过程的快速匿名验证。随后,为了解决未知工人招聘问题,我们提出了一种基于声誉、自私和质量的多武装强盗(RSQ-MAB)学习算法,以选择可靠、优质的工人。最后,我们在Hyperledger Fabric上实现了一个原型系统来评估声誉管理方案的性能。结果表明,与ARMS-MCS相比,信誉评分验证的执行延迟和检索延迟平均降低了6.30% ~ 56.90%。此外,在真实数据集和合成数据集上的实验结果表明,与其他基准方法相比,所提出的RSQ-MAB算法的数据请求者的总收入至少提高了20.05%,遗憾率和多轮平均误差(MAE)分别降低了48.55%和3.18%。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Blockchain-Based Reputation Privacy Preserving for Quality-Aware Worker Recruitment Scheme in MCS
Mobile Crowdsourcing (MCS) has become a novel paradigm for enabling data collection by worker recruitment, and the reputation plays a crucial role in achieving high-quality data. Although identity, data, and bid privacy preserving have been thoroughly investigated with the advance of blockchain technology, existing literature barely focuses on reputation privacy, which prevents malicious workers from submitting false data that could affect truth discovery for data requester. Therefore, we propose a Blockchain-Based Reputation Privacy Preserving for Quality-Aware Worker Recruitment Scheme (BRPP-QWR). First, we design a lightweight privacy preserving scheme for the whole life cycle of the worker’s reputation, which adopts sub-address retrieval technique combined with Pedersen Commitment and Compact Linkable Spontaneous Anonymous Group (CLSAG) signature to enable fast and anonymous verification of the reputation update process. Subsequently, to tackle the unknown worker recruitment problem, we propose a Reputation, Selfishness, and Quality-based Multi-Armed Bandit (RSQ-MAB) learning algorithm to select reliable and high-quality workers. Lastly, we implement a prototype system on Hyperledger Fabric to evaluate the performance of the reputation management scheme. The results indicate that the execution latency for the reputation score verification and retrieval latency can be reduced by an average of 6.30%–56.90% compared with ARMS-MCS. In addition, experimental results on both real and synthetic datasets show that the proposed RSQ-MAB algorithm achieves an increase of at least 20.05% in regard to the data requester’s total revenue and a decrease of at least 48.55% and 3.18% in regret and Multi-round Average Error (MAE), respectively, compared with other benchmark methods.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
IEEE/ACM Transactions on Networking
IEEE/ACM Transactions on Networking 工程技术-电信学
CiteScore
8.20
自引率
5.40%
发文量
246
审稿时长
4-8 weeks
期刊介绍: The IEEE/ACM Transactions on Networking’s high-level objective is to publish high-quality, original research results derived from theoretical or experimental exploration of the area of communication/computer networking, covering all sorts of information transport networks over all sorts of physical layer technologies, both wireline (all kinds of guided media: e.g., copper, optical) and wireless (e.g., radio-frequency, acoustic (e.g., underwater), infra-red), or hybrids of these. The journal welcomes applied contributions reporting on novel experiences and experiments with actual systems.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信