Achieving Differential Privacy of Data Disclosure in the Smart Grid

被引:0
作者
Zhao, Jing [1 ]
Jung, Taeho [1 ]
Wang, Yu [2 ]
Li, Xiangyang [1 ,3 ,4 ]
机构
[1] IIT, Dept Comp Sci, Chicago, IL 60616 USA
[2] Univ N Carolina, Dept Comp Sci, Charlotte, NC 28223 USA
[3] Tsinghua Univ, Dept Comp Sci & Technol, Beijing 100084, Peoples R China
[4] Tsinghua Univ, TNLIST, Beijing 100084, Peoples R China
来源
2014 PROCEEDINGS IEEE INFOCOM | 2014年
关键词
Smart Grid; Smart Meter; Privacy; Differential Privacy; Data Disclosure;
D O I
暂无
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
The smart grid introduces new privacy implications to individuals and their family due to the fine-grained usage data collection. For example, smart metering data could reveal highly accurate real-time home appliance energy load, which may be used to infer the human activities inside the houses. One effective way to hide actual appliance loads from the outsiders is Battery-based Load Hiding (BLH), in which a battery is installed for each household and smartly controlled to store and supply power to the appliances. Even though such technique has been demonstrated useful and can prevent certain types of attacks, none of existing BLH works can provide probably privacy-preserving mechanisms. In this paper, we investigate the privacy of smart meters via differential privacy. We first analyze the current existing BLH methods and show that they cannot guarantee differential privacy in the BLH problem. We then propose a novel randomized BLH algorithm which successfully assures differential privacy, and further propose the Multitasking-BLH-Exp3 algorithm which adaptively updates the BLH algorithm based on the context and the constraints. Results from extensive simulations show the efficiency and effectiveness of the proposed method over existing BLH methods.
引用
收藏
页码:504 / 512
页数:9
相关论文
共 32 条
[1]  
[Anonymous], 2012, UNDERSTANDING POTENT
[2]  
[Anonymous], P UBICOMP 2010
[3]  
[Anonymous], 2006, P EUROCRYPT
[4]  
Auer P, 2003, SIAM J COMPUT, V32, P48, DOI 10.1137/S0097539701398375
[5]   Finite-time analysis of the multiarmed bandit problem [J].
Auer, P ;
Cesa-Bianchi, N ;
Fischer, P .
MACHINE LEARNING, 2002, 47 (2-3) :235-256
[6]  
Blum A., 2008, P ACM STOC
[7]   Regret Analysis of Stochastic and Nonstochastic Multi-armed Bandit Problems [J].
Bubeck, Sebastien ;
Cesa-Bianchi, Nicolo .
FOUNDATIONS AND TRENDS IN MACHINE LEARNING, 2012, 5 (01) :1-122
[8]  
Bugliesi M., 2006, LECT NOTES COMPUT SC, P1
[9]  
Dwork C., 2006, P TCC
[10]  
Fehrenbacher K., 2009, SMART METER WORM COU