The Community for Technology Leaders
Green Image
Issue No. 09 - Sept. (2012 vol. 23)
ISSN: 1045-9219
pp: 1621-1631
Xu Li , INRIA Lille - Nord Europe, Lille
Xiaodong Lin , University of Ontario Institute of Technology, Oshawa
Xiaohui Liang , University of Waterloo, Waterloo
Xuemin (Sherman) Shen , University of Waterloo, Waterloo
Rongxing Lu , University of Waterloo, Waterloo
ABSTRACT
The concept of smart grid has emerged as a convergence of traditional power system engineering and information and communication technology. It is vital to the success of next generation of power grid, which is expected to be featuring reliable, efficient, flexible, clean, friendly, and secure characteristics. In this paper, we propose an efficient and privacy-preserving aggregation scheme, named EPPA, for smart grid communications. EPPA uses a superincreasing sequence to structure multidimensional data and encrypt the structured data by the homomorphic Paillier cryptosystem technique. For data communications from user to smart grid operation center, data aggregation is performed directly on ciphertext at local gateways without decryption, and the aggregation result of the original data can be obtained at the operation center. EPPA also adopts the batch verification technique to reduce authentication cost. Through extensive analysis, we demonstrate that EPPA resists various security threats and preserve user privacy, and has significantly less computation and communication overhead than existing competing approaches.
INDEX TERMS
Smart grids, Electricity, Real time systems, Logic gates, Encryption, privacy preserving, Smart grids, Electricity, Real time systems, Logic gates, Encryption, multidimensional aggregation., Smart grid, security
CITATION
Xu Li, Xiaodong Lin, Xiaohui Liang, Xuemin (Sherman) Shen, Rongxing Lu, "EPPA: An Efficient and Privacy-Preserving Aggregation Scheme for Secure Smart Grid Communications", IEEE Transactions on Parallel & Distributed Systems, vol. 23, no. , pp. 1621-1631, Sept. 2012, doi:10.1109/TPDS.2012.86
191 ms
(Ver )