Privacy-preserving data aggregation scheme against internal attackers in smart grids

Abstract

With fast advancements of communication, systems and information technologies, a smart grid (SG) could bring much convenience to users because it could provide a reliable and efficient energy service. The data aggregation (DA) scheme for the SG plays an important role in evaluating information about current energy usage. To achieve the goal of preserving users' privacy, many DA schemes for the SG have been proposed in last decade. However, how to withstand attacks of internal adversaries is not considered in those schemes. To enhance preservation of privacy, Fan et al. proposed a DA scheme for the SG against internal adversaries. In Fan et al.'s DA scheme, blinding factors are used in evaluating information about current energy usage and the aggregator cannot get the consumption information of any individual user. Fan et al. demonstrated that their scheme was secure against various attacks. However, we find that their scheme suffers from the key leakage problem, i.e., the adversary could extract the user's private key through the public information. To overcome such serious weakness, this paper proposes an efficient and privacy-preserving DA scheme for the SG against internal attacks. Analysis shows that the proposed DA scheme not only overcome the key leakage problem in Fan et al.'s DA scheme, but also has better performance.

PAgIoT – Privacy-preserving Aggregation protocol for Internet of Things

“…Multiple proposals have been developed, from the aggregation of values [5,6,7,28,29,30,31,32,33,34,35,36], to additions [2,3,26,37,38,39,40,41,42,43], calculus of minimums or maximums [10,44,45] or even more complex tasks such as averages [9,10,30,46], variances [9,46], range queries [6] or logic operations [8].…”

“…Anonymity is generally achieved by the use of cryptographic schemes, e.g. symmetric encryption [2,6,7,30] or more sophisticated schemes like homomorphic encryption [8,37,38,39,31,40,41,42,43,46], homomorphic aggregation of signatures [36] and homomorphic encryption with re-randomization applying a proxy [5]. By contrast, Groat et al [44] propose the use of randomized arrays instead of a cryptographic system.…”

“…Privacy preservation against observers is considered in [2,3,5,7,8,29,26,44,31,41,42,46,36,25,48]. The use of cryptography is demanding to manage this issue [2,3,5,7,8,28,29,26,38,46,36,25,48], as well as randomized arrays or negative surveys [44].…”

“…Verifying that aggregation is correctly performed without polluted results is also addressed by several proposals [6,30,26,28,31,41,35,36,43,25,48]. A monitoring neighbour scheme is proposed in [26], where neighbours of intermediate aggregator nodes monitor their behaviour.…”

“…Authors propose that each leaf node verifies its parent's aggregation, considering that nodes are organized as a tree. [41] applies digital signatures to provide message integrity apart from confidentiality. With the same purpose [36,31] apply elliptic curve digital signatures.…”