VLR-BPP:基于双边隐私保护架构的边缘云系统智能虚拟位置替换技术

IF 6.2 2区 计算机科学 Q1 COMPUTER SCIENCE, THEORY & METHODS
{"title":"VLR-BPP:基于双边隐私保护架构的边缘云系统智能虚拟位置替换技术","authors":"","doi":"10.1016/j.future.2024.107488","DOIUrl":null,"url":null,"abstract":"<div><p>Mobile Crowdsourcing (MCS) has emerged as a significant edge-cloud computing paradigm in which workers perceive data at the network edge and report it to cloud-based computing services for processing, enabling the construction of various applications. Consequently, it is imperative to achieve Bilateral Location Privacy-Preserving (BLPP) to protect the privacy of both Data Requester (DR) and workers, as disclosing location information entails many sensitive details that can result in losses for DR and workers alike. The Local Differential Privacy (LDP) approach is widely employed in Privacy-Preserving (PP) techniques due to its inherent advantages, wherein owners release data with added noise, allowing for proactive customization of privacy strength without relying on any third party. However, the current state of LDP methods presents a dilemma: when privacy protection is strong, introducing excessive location noise can lead to a decrease in the accuracy of task-worker matching, while a high rate of task-worker matching necessitates the compromise of privacy strength. In this paper, an intelligent Virtual Location Replacement based enhanced Bilateral Privacy-Preserving (VLR-BPP) architecture is proposed to improve privacy protection strength and matching accuracy in MCS simultaneously. Within the VLR-BPP architecture, a Bipartite-Graph-based Matrix Completion (BGMC) model is employed to establish the spatiotemporal correlations among data. Then, a Virtual Location Replacement (VLR) strategy is proposed to obfuscate the locations of tasks or workers to their highly correlated virtual location before publishing. Based on VLR, three preemptive location virtualization approaches are introduced: Only Task Location Virtual (OTLV), Only Workers Location Virtual (OWLV), and Both Task and Workers Location Virtual (BTWLV). For workers and DR, Randomized Response (RR) techniques and Random Matrix Multiplication Mechanism (RMM) are used to implement LDP independently. A greedy algorithm is adopted to recruit workers for tasks. In response to the data submitted by workers, BGMC imputation mechanism is utilized to enhance data quality. Finally, simulations based on real-world datasets demonstrate that the performance of our architecture surpasses existing state-of-the-art methods in privacy protection and data collection quality by 18.92∼38.17% and 15.49∼50.77%, respectively.</p></div>","PeriodicalId":55132,"journal":{"name":"Future Generation Computer Systems-The International Journal of Escience","volume":null,"pages":null},"PeriodicalIF":6.2000,"publicationDate":"2024-08-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"VLR-BPP: An intelligent virtual location replacement based bilateral privacy-preserving architecture for edge cloud systems\",\"authors\":\"\",\"doi\":\"10.1016/j.future.2024.107488\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>Mobile Crowdsourcing (MCS) has emerged as a significant edge-cloud computing paradigm in which workers perceive data at the network edge and report it to cloud-based computing services for processing, enabling the construction of various applications. Consequently, it is imperative to achieve Bilateral Location Privacy-Preserving (BLPP) to protect the privacy of both Data Requester (DR) and workers, as disclosing location information entails many sensitive details that can result in losses for DR and workers alike. The Local Differential Privacy (LDP) approach is widely employed in Privacy-Preserving (PP) techniques due to its inherent advantages, wherein owners release data with added noise, allowing for proactive customization of privacy strength without relying on any third party. However, the current state of LDP methods presents a dilemma: when privacy protection is strong, introducing excessive location noise can lead to a decrease in the accuracy of task-worker matching, while a high rate of task-worker matching necessitates the compromise of privacy strength. In this paper, an intelligent Virtual Location Replacement based enhanced Bilateral Privacy-Preserving (VLR-BPP) architecture is proposed to improve privacy protection strength and matching accuracy in MCS simultaneously. Within the VLR-BPP architecture, a Bipartite-Graph-based Matrix Completion (BGMC) model is employed to establish the spatiotemporal correlations among data. Then, a Virtual Location Replacement (VLR) strategy is proposed to obfuscate the locations of tasks or workers to their highly correlated virtual location before publishing. Based on VLR, three preemptive location virtualization approaches are introduced: Only Task Location Virtual (OTLV), Only Workers Location Virtual (OWLV), and Both Task and Workers Location Virtual (BTWLV). For workers and DR, Randomized Response (RR) techniques and Random Matrix Multiplication Mechanism (RMM) are used to implement LDP independently. A greedy algorithm is adopted to recruit workers for tasks. In response to the data submitted by workers, BGMC imputation mechanism is utilized to enhance data quality. Finally, simulations based on real-world datasets demonstrate that the performance of our architecture surpasses existing state-of-the-art methods in privacy protection and data collection quality by 18.92∼38.17% and 15.49∼50.77%, respectively.</p></div>\",\"PeriodicalId\":55132,\"journal\":{\"name\":\"Future Generation Computer Systems-The International Journal of Escience\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":6.2000,\"publicationDate\":\"2024-08-28\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Future Generation Computer Systems-The International Journal of Escience\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S0167739X24004448\",\"RegionNum\":2,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"COMPUTER SCIENCE, THEORY & METHODS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Future Generation Computer Systems-The International Journal of Escience","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0167739X24004448","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, THEORY & METHODS","Score":null,"Total":0}
引用次数: 0

摘要

移动众包(MCS)已成为一种重要的边缘云计算模式,工人在网络边缘感知数据并将其报告给云计算服务进行处理,从而构建各种应用。因此,实现双边位置隐私保护(Bilateral Location Privacy-Preserving,BLPP)以保护数据请求者(DR)和工作人员的隐私势在必行,因为泄露位置信息会涉及许多敏感细节,可能会给数据请求者和工作人员带来损失。本地差分隐私(LDP)方法因其固有的优势而被广泛应用于隐私保护(PP)技术中,在这种方法中,数据所有者在发布数据时会增加噪音,从而可以主动定制隐私强度,而无需依赖任何第三方。然而,LDP 方法的现状却让人进退两难:当隐私保护强度较高时,引入过多的位置噪声会导致任务-工作者匹配的准确性降低,而任务-工作者匹配率较高时,又必须牺牲隐私强度。本文提出了一种基于虚拟位置替换的增强型双边隐私保护(VLR-BPP)智能架构,以同时提高 MCS 中的隐私保护强度和匹配精度。在 VLR-BPP 架构中,采用了基于双方格图的矩阵补全(BGMC)模型来建立数据之间的时空相关性。然后,提出了虚拟位置替换(VLR)策略,在发布前将任务或工人的位置混淆为高度相关的虚拟位置。在 VLR 的基础上,引入了三种抢先位置虚拟化方法:仅任务位置虚拟化(OTLV)、仅工人位置虚拟化(OWLV)和任务与工人位置虚拟化(BTWLV)。对于工人和 DR,采用随机响应(RR)技术和随机矩阵乘法机制(RMM)来独立实现 LDP。采用贪婪算法为任务招募工人。针对工人提交的数据,采用 BGMC 估算机制来提高数据质量。最后,基于真实数据集的仿真表明,我们的架构在隐私保护和数据收集质量方面的性能分别比现有的最先进方法高出 18.92∼38.17% 和 15.49∼50.77%。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
VLR-BPP: An intelligent virtual location replacement based bilateral privacy-preserving architecture for edge cloud systems

Mobile Crowdsourcing (MCS) has emerged as a significant edge-cloud computing paradigm in which workers perceive data at the network edge and report it to cloud-based computing services for processing, enabling the construction of various applications. Consequently, it is imperative to achieve Bilateral Location Privacy-Preserving (BLPP) to protect the privacy of both Data Requester (DR) and workers, as disclosing location information entails many sensitive details that can result in losses for DR and workers alike. The Local Differential Privacy (LDP) approach is widely employed in Privacy-Preserving (PP) techniques due to its inherent advantages, wherein owners release data with added noise, allowing for proactive customization of privacy strength without relying on any third party. However, the current state of LDP methods presents a dilemma: when privacy protection is strong, introducing excessive location noise can lead to a decrease in the accuracy of task-worker matching, while a high rate of task-worker matching necessitates the compromise of privacy strength. In this paper, an intelligent Virtual Location Replacement based enhanced Bilateral Privacy-Preserving (VLR-BPP) architecture is proposed to improve privacy protection strength and matching accuracy in MCS simultaneously. Within the VLR-BPP architecture, a Bipartite-Graph-based Matrix Completion (BGMC) model is employed to establish the spatiotemporal correlations among data. Then, a Virtual Location Replacement (VLR) strategy is proposed to obfuscate the locations of tasks or workers to their highly correlated virtual location before publishing. Based on VLR, three preemptive location virtualization approaches are introduced: Only Task Location Virtual (OTLV), Only Workers Location Virtual (OWLV), and Both Task and Workers Location Virtual (BTWLV). For workers and DR, Randomized Response (RR) techniques and Random Matrix Multiplication Mechanism (RMM) are used to implement LDP independently. A greedy algorithm is adopted to recruit workers for tasks. In response to the data submitted by workers, BGMC imputation mechanism is utilized to enhance data quality. Finally, simulations based on real-world datasets demonstrate that the performance of our architecture surpasses existing state-of-the-art methods in privacy protection and data collection quality by 18.92∼38.17% and 15.49∼50.77%, respectively.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
CiteScore
19.90
自引率
2.70%
发文量
376
审稿时长
10.6 months
期刊介绍: Computing infrastructures and systems are constantly evolving, resulting in increasingly complex and collaborative scientific applications. To cope with these advancements, there is a growing need for collaborative tools that can effectively map, control, and execute these applications. Furthermore, with the explosion of Big Data, there is a requirement for innovative methods and infrastructures to collect, analyze, and derive meaningful insights from the vast amount of data generated. This necessitates the integration of computational and storage capabilities, databases, sensors, and human collaboration. Future Generation Computer Systems aims to pioneer advancements in distributed systems, collaborative environments, high-performance computing, and Big Data analytics. It strives to stay at the forefront of developments in grids, clouds, and the Internet of Things (IoT) to effectively address the challenges posed by these wide-area, fully distributed sensing and computing 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学术官方微信