SS-LDP: A Framework for Sparse Streaming Data Collection Based on Local Differential Privacy

IF 1.5 4区 计算机科学 Q3 COMPUTER SCIENCE, SOFTWARE ENGINEERING
Hongjiao Li, Ming Jin, Jiayi Xu, Zhenya Shi, Anyang Yin
{"title":"SS-LDP: A Framework for Sparse Streaming Data Collection Based on Local Differential Privacy","authors":"Hongjiao Li,&nbsp;Ming Jin,&nbsp;Jiayi Xu,&nbsp;Zhenya Shi,&nbsp;Anyang Yin","doi":"10.1002/cpe.70119","DOIUrl":null,"url":null,"abstract":"<div>\n \n <p>The continuous collection of streaming data in the Internet of Things (IoT) may compromise user privacy, as such data often originates from personal information. Local differential privacy (LDP) is a novel privacy notion that offers a strong privacy guarantee to all users without relying on a trusted data collector. However, existing LDP-based studies mainly focus on static scenarios or perturbation of data points at a single timestamp without sufficiently considering data sparsity, which adds excessive noise and leads to low utility. Therefore, we propose a Framework for Sparse Streaming Data Collection based on Local Differential Privacy (SS-LDP), which aims to provide high utility at each timestamp while satisfying <span></span><math>\n <semantics>\n <mrow>\n <mi>w</mi>\n </mrow>\n <annotation>$$ w $$</annotation>\n </semantics></math>-event LDP. One component is the introduction of an upper-bound optimization mechanism, which reduces the noise scale by combining error minimization with the gradient descent method. Another component of SS-LDP targets the efficient management of privacy resources through two specific strategies. First, significant changes in streaming data are captured by calculating differences between the latest few data points, thereby conserving the privacy budget. Second, an improved sparse privacy budget allocation mechanism quantifies data sparsity at each timestamp using the moving average method, enabling efficient allocation of the privacy budget for each timestamp. SS-LDP is evaluated using two real-world datasets and compared with four baseline methods that satisfy <span></span><math>\n <semantics>\n <mrow>\n <mi>w</mi>\n </mrow>\n <annotation>$$ w $$</annotation>\n </semantics></math>-event privacy. Extensive experiments and theoretical analyses are conducted to demonstrate the superiority of our framework.</p>\n </div>","PeriodicalId":55214,"journal":{"name":"Concurrency and Computation-Practice & Experience","volume":"37 12-14","pages":""},"PeriodicalIF":1.5000,"publicationDate":"2025-05-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Concurrency and Computation-Practice & Experience","FirstCategoryId":"94","ListUrlMain":"https://onlinelibrary.wiley.com/doi/10.1002/cpe.70119","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, SOFTWARE ENGINEERING","Score":null,"Total":0}
引用次数: 0

Abstract

The continuous collection of streaming data in the Internet of Things (IoT) may compromise user privacy, as such data often originates from personal information. Local differential privacy (LDP) is a novel privacy notion that offers a strong privacy guarantee to all users without relying on a trusted data collector. However, existing LDP-based studies mainly focus on static scenarios or perturbation of data points at a single timestamp without sufficiently considering data sparsity, which adds excessive noise and leads to low utility. Therefore, we propose a Framework for Sparse Streaming Data Collection based on Local Differential Privacy (SS-LDP), which aims to provide high utility at each timestamp while satisfying w $$ w $$ -event LDP. One component is the introduction of an upper-bound optimization mechanism, which reduces the noise scale by combining error minimization with the gradient descent method. Another component of SS-LDP targets the efficient management of privacy resources through two specific strategies. First, significant changes in streaming data are captured by calculating differences between the latest few data points, thereby conserving the privacy budget. Second, an improved sparse privacy budget allocation mechanism quantifies data sparsity at each timestamp using the moving average method, enabling efficient allocation of the privacy budget for each timestamp. SS-LDP is evaluated using two real-world datasets and compared with four baseline methods that satisfy w $$ w $$ -event privacy. Extensive experiments and theoretical analyses are conducted to demonstrate the superiority of our framework.

SS-LDP:一个基于局部差分隐私的稀疏流数据采集框架
物联网(IoT)中不断收集的流数据可能会损害用户的隐私,因为这些数据通常来自个人信息。本地差分隐私(LDP)是一种新颖的隐私概念,它在不依赖于可信数据收集器的情况下为所有用户提供强大的隐私保证。然而,现有的基于ldp的研究主要集中在单个时间戳的静态场景或数据点的扰动上,没有充分考虑数据的稀疏性,增加了过多的噪声,导致效用不高。因此,我们提出了一种基于局部差分隐私(SS-LDP)的稀疏流数据收集框架,该框架旨在在满足$$ w $$ -事件LDP的同时,在每个时间戳提供高效用。其一是引入上界优化机制,将误差最小化与梯度下降法相结合,降低噪声尺度;SS-LDP的另一个组成部分旨在通过两个特定的策略有效地管理隐私资源。首先,通过计算最近几个数据点之间的差异来捕获流数据中的重大变化,从而节省隐私预算。其次,改进的稀疏隐私预算分配机制使用移动平均方法量化每个时间戳的数据稀疏性,从而实现每个时间戳的有效隐私预算分配。SS-LDP使用两个真实世界的数据集进行评估,并与满足w $$ w $$ -事件隐私的四种基线方法进行比较。大量的实验和理论分析证明了我们的框架的优越性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Concurrency and Computation-Practice & Experience
Concurrency and Computation-Practice & Experience 工程技术-计算机:理论方法
CiteScore
5.00
自引率
10.00%
发文量
664
审稿时长
9.6 months
期刊介绍: Concurrency and Computation: Practice and Experience (CCPE) publishes high-quality, original research papers, and authoritative research review papers, in the overlapping fields of: Parallel and distributed computing; High-performance computing; Computational and data science; Artificial intelligence and machine learning; Big data applications, algorithms, and systems; Network science; Ontologies and semantics; Security and privacy; Cloud/edge/fog computing; Green computing; and Quantum computing.
×
引用
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学术官方微信