{"title":"A fault-tolerant and efficient scheme for data aggregation over groups in the smart grid","authors":"F. Knirsch, D. Engel, Z. Erkin","doi":"10.1109/WIFS.2017.8267646","DOIUrl":null,"url":null,"abstract":"Aggregating data in the smart grid is an important issue for obtaining the total consumption of a group of households. In order to aggregate data in a privacy preserving manner, it has to be assured that individual contributions are untraceable and only the sum is visible to an aggregator. For billing, network security and statistical analysis data from different types of customers (e.g., industrial, residential) has to be aggregated separately. This paper presents a fault-tolerant and efficient scheme for aggregating data over different groups while preserving the privacy of the households. We propose to build on the Chinese Remainder Theorem for aggregating over groups and on a fault-tolerant and tree-based approach for increasing efficiency. The resulting protocol is evaluated in terms of privacy, complexity and real-world applicability, such as dynamic joins and leaves.","PeriodicalId":305837,"journal":{"name":"2017 IEEE Workshop on Information Forensics and Security (WIFS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"9","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 IEEE Workshop on Information Forensics and Security (WIFS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/WIFS.2017.8267646","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 9
Abstract
Aggregating data in the smart grid is an important issue for obtaining the total consumption of a group of households. In order to aggregate data in a privacy preserving manner, it has to be assured that individual contributions are untraceable and only the sum is visible to an aggregator. For billing, network security and statistical analysis data from different types of customers (e.g., industrial, residential) has to be aggregated separately. This paper presents a fault-tolerant and efficient scheme for aggregating data over different groups while preserving the privacy of the households. We propose to build on the Chinese Remainder Theorem for aggregating over groups and on a fault-tolerant and tree-based approach for increasing efficiency. The resulting protocol is evaluated in terms of privacy, complexity and real-world applicability, such as dynamic joins and leaves.