# American Institute of Mathematical Sciences

February  2018, 1(1): 77-100. doi: 10.3934/mfc.2018005

## CP_ABSC: An attribute-based signcryption scheme to secure multicast communications in smart grids

 1 Key Laboratory of Dependable Service Computing in Cyber Physical Society, Ministry of Education, Chongqing University, China 2 School of Software Engineering, Chongqing University, China 3 School of Information Science and Engineering, Qufu Normal University, China 4 Department of Computer Science, The George Washington University, USA 5 Electrical & Computer Engineering Department, George Mason University, USA 6 Electrical & Computer Engineering Department, Florida International University, USA 7 Beijing Key Laboratory of IOT Information Security Technology, Institute of Information Engineering, Chinese Academy of Sciences (CAS), China

*Corresponding author: Chunqiang Hu

The preliminary version of this paper appears in [16]

Received  September 2017 Revised  November 2017 Published  February 2018

Fund Project: This research was partially supported by the National Natural Science Foundation of China under grants 61702062,61373027 and 61472418, and the National Science Foundation of the US under grants CCF-1442642, IIS-1343976, CNS-1318872, and CNS-1550313.

In this paper, we present a signcryption scheme called CP_ABSC based on Ciphertext-Policy Attribute Based Encryption (CP_ABE) [7] to secure the multicast communications in smart grids that require access control, data encryption, and authentication to ensure message integrity and confidentiality. CP_ABSC provides algorithms for key management, signcryption, and designcryption. It can be used to signcrypt a message based on the access rights specified by the message itself. A user can designcrypt a ciphertext if and only if it possesses the attributes required by the access structure of the data. Thus CP_ABSC effectively defines a multicast group based on the access rights of the data specified by the data itself, which differs significantly from the traditional Internet based multicast where the destination group is predetermined and must be known by the data source. CP_ABSC provides collusion attack resistance, message authentication, forgery prevention, and confidentiality. It can be easily applied in smart grids to secure the instructions/commands broadcast from a utility company to multiple smart meters (push-based multicast) and the data retrieved from a smart meter to multiple destinations (pull-based multicast). Compared to CP_ABE, CP_ABSC combines encryption with signature at a lower computational cost for signcryption and a slightly higher cost in designcryption for signature verification. We also consider the adoption of attribute-based signature (ABS), and conclude that CP_ABSC has a much lower computational cost than ABS.

Citation: Chunqiang Hu, Jiguo Yu, Xiuzhen Cheng, Zhi Tian, Kemal Akkaya, and Limin Sun. CP_ABSC: An attribute-based signcryption scheme to secure multicast communications in smart grids. Mathematical Foundations of Computing, 2018, 1 (1) : 77-100. doi: 10.3934/mfc.2018005
##### References:

show all references

##### References:
A communication architecture in smart grid systems
An access control tree structure
An example access control structure in Smart Grid
Key generation time
Encryption time
Decryption time
ABS signature running-time
ABS verification running-time
The Computational Cost of Different Functions and Operations between CP_ABE and our scheme
 CP_ABE [7] CP_ABSC Key Generation $n{{\mathbb{G}}_{1}} + (n+2){{\mathbb{G}}_{2}} + nH_{{{\mathbb{G}}_{2}}}$ $(2n+5){{\mathbb{G}}_{2}}$ Encryption $(k+1){{\mathbb{G}}_{1}} + k{{\mathbb{G}}_{2}} + 1{{\mathbb{G}}_{3}} + kH_{{{\mathbb{G}}_{2}}}$ $2((k+1){{\mathbb{G}}_{1}} +{{\mathbb{G}}_{2}}+{{\mathbb{G}}_{3}})+2$ (pairings) Decryption $(2k^\prime + 1)$ (pairings) $1{{\mathbb{G}}_{3}} + (2k^\prime+3)$ (pairings) Notes: ${{\mathbb{G}}_{1}}$ in the table means an exponentiation operation in ${{\mathbb{G}}_{1}}$ group; ${{\mathbb{G}}_{2}}$ and ${{\mathbb{G}}_{3}}$ are defined similarly. $H_{{{\mathbb{G}}_{1}}}$ means hashing an attribute string or a message into an element in ${{\mathbb{G}}_{1}}$; $H_{{{\mathbb{G}}_{2}}}$ is defined similarly.
 CP_ABE [7] CP_ABSC Key Generation $n{{\mathbb{G}}_{1}} + (n+2){{\mathbb{G}}_{2}} + nH_{{{\mathbb{G}}_{2}}}$ $(2n+5){{\mathbb{G}}_{2}}$ Encryption $(k+1){{\mathbb{G}}_{1}} + k{{\mathbb{G}}_{2}} + 1{{\mathbb{G}}_{3}} + kH_{{{\mathbb{G}}_{2}}}$ $2((k+1){{\mathbb{G}}_{1}} +{{\mathbb{G}}_{2}}+{{\mathbb{G}}_{3}})+2$ (pairings) Decryption $(2k^\prime + 1)$ (pairings) $1{{\mathbb{G}}_{3}} + (2k^\prime+3)$ (pairings) Notes: ${{\mathbb{G}}_{1}}$ in the table means an exponentiation operation in ${{\mathbb{G}}_{1}}$ group; ${{\mathbb{G}}_{2}}$ and ${{\mathbb{G}}_{3}}$ are defined similarly. $H_{{{\mathbb{G}}_{1}}}$ means hashing an attribute string or a message into an element in ${{\mathbb{G}}_{1}}$; $H_{{{\mathbb{G}}_{2}}}$ is defined similarly.
The Computational Cost of Different Operations in Charm Library
 Group ${{\mathbb{G}}_{1}}$ ${{\mathbb{G}}_{2}}$ ${{\mathbb{G}}_{3}}$ (pairings) $H_{{{\mathbb{G}}_{1}}}$ $H_{{{\mathbb{G}}_{2}}}$ SS512 3.73 3.70 0.48 3.92 8.34 8.39 MNT159 1.12 9.84 2.62 8.42 0.10 34.82 Notes: Time is in ms. The result in this table is the average of 1000 runs.
 Group ${{\mathbb{G}}_{1}}$ ${{\mathbb{G}}_{2}}$ ${{\mathbb{G}}_{3}}$ (pairings) $H_{{{\mathbb{G}}_{1}}}$ $H_{{{\mathbb{G}}_{2}}}$ SS512 3.73 3.70 0.48 3.92 8.34 8.39 MNT159 1.12 9.84 2.62 8.42 0.10 34.82 Notes: Time is in ms. The result in this table is the average of 1000 runs.
Comparison between CP_ABE and CP_ABSC
 The scheme System Initial. KeyGeneration Encryption Decryption CP_ABE [7] symmetric groups private key encryption decryption CP_ABSC asymmetric groups (sign+verify) key signcrypt. decrypt.&verify.
 The scheme System Initial. KeyGeneration Encryption Decryption CP_ABE [7] symmetric groups private key encryption decryption CP_ABSC asymmetric groups (sign+verify) key signcrypt. decrypt.&verify.
Number of operations in the Maji's ABS scheme
 TSetup() 1${{\mathbb{G}}_{1}}$ /user AttrGen() 1${{\mathbb{G}}_{1}}$ / attribute Sign() 2${{\mathbb{G}}_{1}}$+3($\ell_r$)${{\mathbb{G}}_{1}}$+2($\ell - \ell_r$)${{\mathbb{G}}_{1}}$ + 2($\ell \cdot t$)${{\mathbb{G}}_{2}}$ Verify() 1${{\mathbb{G}}_{1}}$+2($\ell \cdot t + t$)${{\mathbb{G}}_{2}}$+($\ell+4$)(pairings)
 TSetup() 1${{\mathbb{G}}_{1}}$ /user AttrGen() 1${{\mathbb{G}}_{1}}$ / attribute Sign() 2${{\mathbb{G}}_{1}}$+3($\ell_r$)${{\mathbb{G}}_{1}}$+2($\ell - \ell_r$)${{\mathbb{G}}_{1}}$ + 2($\ell \cdot t$)${{\mathbb{G}}_{2}}$ Verify() 1${{\mathbb{G}}_{1}}$+2($\ell \cdot t + t$)${{\mathbb{G}}_{2}}$+($\ell+4$)(pairings)
Key generation per attribute of the Maji's ABS scheme
 SS512 MNT159 MNT159.S BN.S 3.67 ms 9.72 ms 1.13 ms 2.30 ms
 SS512 MNT159 MNT159.S BN.S 3.67 ms 9.72 ms 1.13 ms 2.30 ms
 [1] María J. Garrido-Atienza, Bohdan Maslowski, Jana  Šnupárková. Semilinear stochastic equations with bilinear fractional noise. Discrete & Continuous Dynamical Systems - B, 2016, 21 (9) : 3075-3094. doi: 10.3934/dcdsb.2016088 [2] Demetres D. Kouvatsos, Jumma S. Alanazi, Kevin Smith. A unified ME algorithm for arbitrary open QNMs with mixed blocking mechanisms. Numerical Algebra, Control & Optimization, 2011, 1 (4) : 781-816. doi: 10.3934/naco.2011.1.781 [3] M. R. S. Kulenović, J. Marcotte, O. Merino. Properties of basins of attraction for planar discrete cooperative maps. Discrete & Continuous Dynamical Systems - B, 2021, 26 (5) : 2721-2737. doi: 10.3934/dcdsb.2020202 [4] Carlos Gutierrez, Nguyen Van Chau. A remark on an eigenvalue condition for the global injectivity of differentiable maps of $R^2$. Discrete & Continuous Dynamical Systems - A, 2007, 17 (2) : 397-402. doi: 10.3934/dcds.2007.17.397 [5] Fumihiko Nakamura. Asymptotic behavior of non-expanding piecewise linear maps in the presence of random noise. Discrete & Continuous Dynamical Systems - B, 2018, 23 (6) : 2457-2473. doi: 10.3934/dcdsb.2018055 [6] Yves Dumont, Frederic Chiroleu. Vector control for the Chikungunya disease. Mathematical Biosciences & Engineering, 2010, 7 (2) : 313-345. doi: 10.3934/mbe.2010.7.313 [7] Tobias Geiger, Daniel Wachsmuth, Gerd Wachsmuth. Optimal control of ODEs with state suprema. Mathematical Control & Related Fields, 2021  doi: 10.3934/mcrf.2021012 [8] J. Frédéric Bonnans, Justina Gianatti, Francisco J. Silva. On the convergence of the Sakawa-Shindo algorithm in stochastic control. Mathematical Control & Related Fields, 2016, 6 (3) : 391-406. doi: 10.3934/mcrf.2016008 [9] Diana Keller. Optimal control of a linear stochastic Schrödinger equation. Conference Publications, 2013, 2013 (special) : 437-446. doi: 10.3934/proc.2013.2013.437 [10] Alberto Bressan, Ke Han, Franco Rampazzo. On the control of non holonomic systems by active constraints. Discrete & Continuous Dynamical Systems - A, 2013, 33 (8) : 3329-3353. doi: 10.3934/dcds.2013.33.3329 [11] Lorenzo Freddi. Optimal control of the transmission rate in compartmental epidemics. Mathematical Control & Related Fields, 2021  doi: 10.3934/mcrf.2021007 [12] Marzia Bisi, Maria Groppi, Giorgio Martalò, Romina Travaglini. Optimal control of leachate recirculation for anaerobic processes in landfills. Discrete & Continuous Dynamical Systems - B, 2021, 26 (6) : 2957-2976. doi: 10.3934/dcdsb.2020215 [13] Paula A. González-Parra, Sunmi Lee, Leticia Velázquez, Carlos Castillo-Chavez. A note on the use of optimal control on a discrete time model of influenza dynamics. Mathematical Biosciences & Engineering, 2011, 8 (1) : 183-197. doi: 10.3934/mbe.2011.8.183 [14] Guirong Jiang, Qishao Lu. The dynamics of a Prey-Predator model with impulsive state feedback control. Discrete & Continuous Dynamical Systems - B, 2006, 6 (6) : 1301-1320. doi: 10.3934/dcdsb.2006.6.1301 [15] A. K. Misra, Anupama Sharma, Jia Li. A mathematical model for control of vector borne diseases through media campaigns. Discrete & Continuous Dynamical Systems - B, 2013, 18 (7) : 1909-1927. doi: 10.3934/dcdsb.2013.18.1909 [16] Luke Finlay, Vladimir Gaitsgory, Ivan Lebedev. Linear programming solutions of periodic optimization problems: approximation of the optimal control. Journal of Industrial & Management Optimization, 2007, 3 (2) : 399-413. doi: 10.3934/jimo.2007.3.399 [17] Xiaohong Li, Mingxin Sun, Zhaohua Gong, Enmin Feng. Multistage optimal control for microbial fed-batch fermentation process. Journal of Industrial & Management Optimization, 2021  doi: 10.3934/jimo.2021040 [18] John T. Betts, Stephen Campbell, Claire Digirolamo. Examination of solving optimal control problems with delays using GPOPS-Ⅱ. Numerical Algebra, Control & Optimization, 2021, 11 (2) : 283-305. doi: 10.3934/naco.2020026 [19] Livia Betz, Irwin Yousept. Optimal control of elliptic variational inequalities with bounded and unbounded operators. Mathematical Control & Related Fields, 2021  doi: 10.3934/mcrf.2021009 [20] Mohamed Ouzahra. Approximate controllability of the semilinear reaction-diffusion equation governed by a multiplicative control. Discrete & Continuous Dynamical Systems - B, 2021  doi: 10.3934/dcdsb.2021081

Impact Factor: