当前位置: X-MOL 学术Future Gener. Comput. Syst. › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
Lightweight, Divide-and-Conquer privacy-preserving data aggregation in fog computing
Future Generation Computer Systems ( IF 6.2 ) Pub Date : 2021-02-19 , DOI: 10.1016/j.future.2021.02.013
Kinza Sarwar , Sira Yongchareon , Jian Yu , Saeed ur Rehman

With the increasing popularity of the Internet of Things’ (IoT) and fog computing paradigm, aggregating IoT data considering privacy concerns over fog networks can be seen as one of the biggest security challenges. Numerous schemes address this problem. However, most of the existing schemes and their associated methods are heavyweight, facing issues related to performance overhead. Furthermore, performing data aggregation at a single aggregator fog node causes an overly computational burden on the node, which results in high latency, degraded reliability and scalability leading to a single point of failure risks. To fill these gaps, this paper presents a lightweight, Divide-and-Conquer privacy-preserving data aggregation scheme in fog computing to improve data privacy, data processing, and storage capabilities. Particularly, we design a data division strategy based on the Level of Privacy (LoP) defined by data owners. The data division strategy not only effectively divides data according to LoP and distributes it among participating fog nodes for aggregation and storage processing, but also reduces computational and memory overhead in the processing simultaneously. Moreover, we perform a privacy analysis of our scheme and perform comprehensive experiments to compare it with other traditional schemes to evaluate performance efficiency. The results demonstrate that our scheme can efficiently achieve data privacy in fog computing and outperforms the other schemes in computational and memory costs.



中文翻译:

雾计算中的轻量级分治隐私保护数据聚合

随着物联网(IoT)和雾计算范式的日益普及,考虑雾网络的隐私问题而聚集IoT数据被视为最大的安全挑战之一。许多方案解决了这个问题。但是,大多数现有方案及其关联方法都是重量级的,面临着与性能开销有关的问题。此外,在单个聚合器雾节点上执行数据聚合会导致该节点上的计算负担过大,从而导致高延迟,降低的可靠性和可伸缩性,从而导致单点故障风险。为了填补这些空白,本文提出了一种轻量级的,在雾计算中保留分而治之的隐私保护数据聚合方案,以改善数据隐私,数据处理和存储功能。特别,我们根据数据所有者定义的隐私级别(LoP)设计数据划分策略。数据划分策略不仅可以根据LoP有效地划分数据,并将其分布在参与的雾节点之间以进行聚合和存储处理,而且还可以同时减少处理中的计算和内存开销。此外,我们对我们的方案进行了隐私分析,并进行了全面的实验,以将其与其他传统方案进行比较以评估性能效率。结果表明,我们的方案可以有效地实现雾计算中的数据保密性,并且在计算和存储成本方面优于其他方案。数据划分策略不仅可以根据LoP有效地划分数据,并将其分布在参与的雾节点之间以进行聚合和存储处理,而且还可以同时减少处理中的计算和内存开销。此外,我们对我们的方案进行了隐私分析,并进行了全面的实验,以将其与其他传统方案进行比较以评估性能效率。结果表明,我们的方案可以有效地实现雾计算中的数据保密性,并且在计算和存储成本方面优于其他方案。数据划分策略不仅可以根据LoP有效地划分数据,并将其分布在参与的雾节点之间以进行聚合和存储处理,而且还可以同时减少处理中的计算和内存开销。此外,我们对我们的方案进行了隐私分析,并进行了全面的实验,以将其与其他传统方案进行比较以评估性能效率。结果表明,我们的方案可以有效地实现雾计算中的数据保密性,并且在计算和存储成本方面优于其他方案。我们对该方案进行了隐私分析,并进行了全面的实验,以将其与其他传统方案进行比较以评估性能效率。结果表明,我们的方案可以有效地实现雾计算中的数据保密性,并且在计算和存储成本方面优于其他方案。我们对该方案进行了隐私分析,并进行了全面的实验,以将其与其他传统方案进行比较以评估性能效率。结果表明,我们的方案可以有效地实现雾计算中的数据保密性,并且在计算和存储成本方面优于其他方案。

更新日期:2021-02-28
down
wechat
bug