A Practical Privacy-Preserving Data Aggregation (3PDA) Scheme for Smart Grid

The real-time electricity consumption data can be used in value-added service such as big data analysis, meanwhile the single user's privacy needs to be protected. How to balance the data utility and the privacy preservation is a vital issue, where the privacy-preserving data aggregation could...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:IEEE transactions on industrial informatics Ročník 15; číslo 3; s. 1767 - 1774
Hlavní autoři: Liu, Yining, Guo, Wei, Fan, Chun-I, Chang, Liang, Cheng, Chi
Médium: Journal Article
Jazyk:angličtina
Vydáno: IEEE 01.03.2019
Témata:
Cryptography
Data aggregation
Data privacy
data utility
distributed decryption algorithm
Logic gates
Privacy
privacy preservation
Real-time systems
smart grid
ISSN:1551-3203, 1941-0050
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:The real-time electricity consumption data can be used in value-added service such as big data analysis, meanwhile the single user's privacy needs to be protected. How to balance the data utility and the privacy preservation is a vital issue, where the privacy-preserving data aggregation could be a feasible solution. Most of the existing data aggregation schemes rely on a trusted third party (TTP). However, this assumption will have negative impact on reliability, because the system can be easily knocked down by the denial of service attack. In this paper, a practical privacy-preserving data aggregation scheme is proposed without TTP, in which the users with some extent trust construct a virtual aggregation area to mask the single user's data, and meanwhile, the aggregation result almost has no effect for the data utility in large scale applications. The computation cost and communication overhead are reduced in order to promote the practicability. Moreover, the security analysis and the performance evaluation show that the proposed scheme is robust and efficient.
ISSN:1551-3203
1941-0050
DOI:10.1109/TII.2018.2809672