An Efficient Privacy-preserving Join-Aggregation Scheme in Smart Grids

被引:0
作者
Zhou, Peng [1 ]
Qi, Weiqiang [1 ]
Sun, Jiasai [1 ]
Xu, Zichao [1 ]
机构
[1] State Grid Zhejiang Elect Power Corp Informat & T, Hangzhou, Peoples R China
来源
2023 IEEE 9TH INTL CONFERENCE ON BIG DATA SECURITY ON CLOUD, BIGDATASECURITY, IEEE INTL CONFERENCE ON HIGH PERFORMANCE AND SMART COMPUTING, HPSC AND IEEE INTL CONFERENCE ON INTELLIGENT DATA AND SECURITY, IDS | 2023年
关键词
Secure multi-party computation; Smart grid; Data aggregation; Homomorphic encryption; Semi-honest Security; ENERGY MINIMIZATION; SECURE; ALGORITHM; SYSTEM;
D O I
10.1109/BigDataSecurity-HPSC-IDS58521.2023.00038
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Data aggregation is a common technique used in the Internet of Things (IoT) to combine fine-grained data from different sources. With increasing demands for data privacy, it has become a hot research topic. How to perform data aggregation without privacy leakage is a challenge. In smart grids, power data often has the characteristics of large volume and high sensitivity, while the limited computing resources of power bureaus can lead to corresponding delays and decreased service quality. This paper proposes an efficient and lightweight privacy-preserving scheme for data aggregation with the background of smart grid data aggregation. The proposed scheme ensures the privacy and security of sensitive data when processing join-aggregation task. The security of the scheme in the semi-honest model is proved using the Real-Ideal paradigm. Finally, the computational and communication costs of the proposed scheme are analyzed and compared, which shows that the total number of homomorphic operations is fewer than that of other related literature. The communication cost of the proposed scheme is four rounds, which is communication friendly.
引用
收藏
页码:169 / 174
页数:6
相关论文
共 50 条
[41]   A secure ECC-based privacy preserving data aggregation scheme for smart grids [J].
Vahedi, Erfaneh ;
Bayat, Majid ;
Pakravan, Mohammad Reza ;
Aref, Mohammad Reza .
COMPUTER NETWORKS, 2017, 129 :28-36
[42]   Privacy-Preserving Outsourcing Algorithms for Multidimensional Data Encryption in Smart Grids [J].
Zhai, Feng ;
Yang, Ting ;
Zhao, Bing ;
Chen, Hao .
SENSORS, 2022, 22 (12)
[43]   An Efficient Anonymous Authentication Scheme for Privacy-preserving in Smart Grid [J].
Xia, Xueya ;
Ji, Sai .
2021 IEEE CONFERENCE ON DEPENDABLE AND SECURE COMPUTING (DSC), 2021,
[44]   PPPA: A Practical Privacy-Preserving Aggregation Scheme for Smart Grid Communications [J].
Lu, Min ;
Shi, Zhiguo ;
Lu, Rongxing ;
Sun, Ruixue ;
Shen, Xuemin .
2013 IEEE/CIC INTERNATIONAL CONFERENCE ON COMMUNICATIONS IN CHINA (ICCC), 2013, :692-697
[45]   A robust, distributed, and privacy-preserving aggregation scheme for smart grid communications [J].
Shen, Gang ;
Su, Yixin ;
Zhang, Danhong ;
Zhang, Cheng ;
Zhang, Mingwu .
JOURNAL OF THE CHINESE INSTITUTE OF ENGINEERS, 2019, 42 (01) :54-65
[46]   A Novel Privacy-Preserving Set Aggregation Scheme for Smart Grid Communications [J].
Lu, Rongxing ;
Alharbi, Khalid ;
Lin, Xiaodong ;
Huang, Cheng .
2015 IEEE GLOBAL COMMUNICATIONS CONFERENCE (GLOBECOM), 2015,
[47]   LPDA: A Lightweight Privacy-preserving Data Aggregation Scheme for Smart Grid [J].
Alharbi, Khalid ;
Lin, Xiaodong .
2012 INTERNATIONAL CONFERENCE ON WIRELESS COMMUNICATIONS AND SIGNAL PROCESSING (WCSP 2012), 2012,
[48]   Storage-Saving Bi-Dimensional Privacy-Preserving Data Aggregation in Smart Grids [J].
Fan, Chun-, I ;
Tseng, Yi-Fan ;
Lin, Yi-Hui ;
Zhang, Fangguo .
JOURNAL OF INTERNET TECHNOLOGY, 2019, 20 (03) :955-962
[49]   A Lightweight and Privacy-Preserving Data Aggregation for Dynamic Pricing-based Billing in Smart Grids [J].
Gope, Prosanta ;
Sikdar, Biplab .
2018 IEEE PES INNOVATIVE SMART GRID TECHNOLOGIES CONFERENCE EUROPE (ISGT-EUROPE), 2018,
[50]   Comments on "Enabling Verifiable Privacy-Preserving Multi-Type Data Aggregation in Smart Grids" [J].
Liu, Hang ;
Ming, Yang ;
Wang, Chenhao ;
Zhao, Yi ;
Li, Yabin .
IEEE TRANSACTIONS ON DEPENDABLE AND SECURE COMPUTING, 2024, 21 (06) :5308-5310