Distributional differential privacy for large-scale smart metering

Márk Jelasity, K. Birman
{"title":"Distributional differential privacy for large-scale smart metering","authors":"Márk Jelasity, K. Birman","doi":"10.1145/2600918.2600919","DOIUrl":null,"url":null,"abstract":"In smart power grids it is possible to match supply and demand by applying control mechanisms that are based on fine-grained load prediction. A crucial component of every control mechanism is monitoring, that is, executing queries over the network of smart meters. However, smart meters can learn so much about our lives that if we are to use such methods, it becomes imperative to protect privacy. Recent proposals recommend restricting the provider to differentially private queries, however the practicality of such approaches has not been settled. Here, we tackle an important problem with such approaches: even if queries at different points in time over statistically independent data are implemented in a differentially private way, the parameters of the distribution of the query might still reveal sensitive personal information. Protecting these parameters is hard if we allow for continuous monitoring, a natural requirement in the smart grid. We propose novel differentially private mechanisms that solve this problem for sum queries. We evaluate our methods and assumptions using a theoretical analysis as well as publicly available measurement data and show that the extra noise needed to protect distribution parameters is small.","PeriodicalId":243756,"journal":{"name":"Information Hiding and Multimedia Security Workshop","volume":"77 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-06-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"26","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Information Hiding and Multimedia Security Workshop","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/2600918.2600919","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 26

Abstract

In smart power grids it is possible to match supply and demand by applying control mechanisms that are based on fine-grained load prediction. A crucial component of every control mechanism is monitoring, that is, executing queries over the network of smart meters. However, smart meters can learn so much about our lives that if we are to use such methods, it becomes imperative to protect privacy. Recent proposals recommend restricting the provider to differentially private queries, however the practicality of such approaches has not been settled. Here, we tackle an important problem with such approaches: even if queries at different points in time over statistically independent data are implemented in a differentially private way, the parameters of the distribution of the query might still reveal sensitive personal information. Protecting these parameters is hard if we allow for continuous monitoring, a natural requirement in the smart grid. We propose novel differentially private mechanisms that solve this problem for sum queries. We evaluate our methods and assumptions using a theoretical analysis as well as publicly available measurement data and show that the extra noise needed to protect distribution parameters is small.
大规模智能计量的分布式差分隐私
在智能电网中,可以通过应用基于细粒度负荷预测的控制机制来匹配供需。每个控制机制的一个关键组成部分是监控,即在智能电表网络上执行查询。然而,智能电表可以了解我们的生活,如果我们要使用这种方法,就必须保护隐私。最近的建议建议将提供者限制为差异私有查询,但是这种方法的实用性尚未得到解决。在这里,我们用这些方法解决了一个重要的问题:即使在统计独立数据的不同时间点上的查询以不同的私有方式实现,查询分布的参数仍然可能泄露敏感的个人信息。如果我们允许连续监测,保护这些参数是困难的,这是智能电网的自然要求。我们提出了新的差分私有机制来解决求和查询的这个问题。我们使用理论分析和公开可用的测量数据来评估我们的方法和假设,并表明保护分布参数所需的额外噪声很小。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
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学术文献互助群
群 号:604180095
Book学术官方微信