Privacy-Preserving And Latency Minimization Of Data Sharing In Edge-Based Smart Grid

In smart grid network,the smart meters generate a huge amount of data,resulting in the explosive growth of power consumption data.With the support edge nodes,massive data from different smart meters can be processed and stored at the edge of the network.There-fore,edge computing has improved the efficiency of smart grid performance by collecting and analyzing their data and process information near the source as opposed to the cloud.Edge computing also provides real-time information,which allows companies to make data-driven decisions.However,since the data are handled over at the edge servers for processing and storage,the data will be out of control from data owners/consumers.At the same time,the energy consumption data that is collected by the smart meters are sensitive consumer’s information.If the user’s data is not well protected,sensitive information such as user power consumption,phone number,and home address will be leaked,and will also lead to security issues of the grid data and also imposes risks to users’ privacy.To achieve secure and efficient data sharing for edge-based smart grid,we propose Data privacy protection and latency minimization for edge storage based smart grid.Hence,we apply the method of CP-ABE(Ciphertext Policy Attribute-Based Encryption).Specifically,the CP-ABE scheme protects data security and privacy by sharing data among a group of privileged data users,who is believed to be a very desirable candidate for accomplishing scalable access control over data items in encrypted forms.In this thesis,we proposed a dynamic policy update multi-authority CP-ABE scheme,which preserves the consumer’s data privacy in the edge-based smart grid system.In the proposed scheme,we removed central authority(CA),and each authority monitors a set of attributes and issues secret keys to users accordingly.Besides,the model also takes advantage of the low-latency of edge nodes to achieve efficient communication and improve security.Moreover,an efficient dynamic policy updating method is also developed,which updates the access policy online without wasting the network bandwidth.The security and privacy analysis show that our scheme achieves communication confidentiality,data integrity,and privacy preservation against any probabilistic polynomial-time honest-but-curious internal adversaries and malicious external adversaries.