Abstract

In smart grids (SG), data aggregation is widely used to strike a balance between data usability and privacy protection. The fault tolerance is an important requirement to improve the robustness of data aggregation protocols, which enables normal execution of the protocols even with failures on some entities. However, to achieve fault tolerance, most schemes either sacrifice the aggregation accuracy due to the use of differential privacy or substitution strategy or need to rely on an online trusted entity to manage all user blinding factors. In this paper, a (k,n) threshold privacy-preserving data aggregation scheme named (k,n)-PDA is proposed, which reconciles data usability and data privacy through the BGN cryptosystem and achieves fault tolerance with accurate aggregation using Shamir’s secret sharing without any online trusted entity. Besides, our scheme supports the efficient changing of users’ membership. Specifically, the dynamic secrete key is distributed to n smart meters (SMs) through the threshold secret sharing algorithm. When k or more meters participate in the aggregation, the data service center (DSC) can reconstruct the key to compute the aggregate results, and less than k SMs cannot recover the key. Thus, our solution still works functionally even if up to n−k SMs fail; also, it resists attacks from the collusion of less than k SMs. Moreover, system and performance analyses demonstrate that our scheme achieves privacy, fault tolerance, and membership dynamics with high efficiency.

Highlights

  • The development of information, communication technology, and advanced control technology has driven the emergence of the smart grid

  • We propose a novel privacy-preserving data aggregation protocol named (k, n)-PDA in smart grids where n is the number of smart meters (SMs) in the aggregation area, and k is the threshold

  • The main contributions of this paper are summarized as follows: (i) We construct the encryption, aggregation, and decryption process based on the BGN homomorphic cryptosystem to ensure the confidentiality and privacy of data (ii) We use the threshold characteristics of Shamir’s secret sharing algorithm to make the aggregation scheme threshold fault-tolerant, which means that accurate aggregate value with privacy preservation can be obtained even when n-k SMs collude with each other or do not work normally

Read more

Summary

Introduction

The development of information, communication technology, and advanced control technology has driven the emergence of the smart grid. (i) We construct the encryption, aggregation, and decryption process based on the BGN homomorphic cryptosystem to ensure the confidentiality and privacy of data (ii) We use the threshold characteristics of Shamir’s secret sharing algorithm to make the aggregation scheme threshold fault-tolerant, which means that accurate aggregate value with privacy preservation can be obtained even when n-k SMs collude with each other or do not work normally. Shamir’s algorithm makes our scheme achieve dynamic membership management (iii) We use the one-time pad to achieve forward security (iv) We analyze the security and some other system properties to show that the proposed scheme holds confidentiality, privacy preservation, fault tolerance, dynamic membership, forward security, and no need for any online trusted or high authority entity.

Related Works
Preliminaries
System Setup
Our Scheme
System Characteristic Analyses
Efficiency Evaluation
Conclusion
Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call