# Research on Embedded Security Control for Smart Home Based on Improved IBE Algorithm

Authors: Siyuan Zhang
Journal: Security and Communication Networks
 (2022)

---

## Abstract

A smart home control system is a comprehensive control system that cross-fuses electronic technology, etc. In the process of data communication in smart home systems, a communication security system based on the upgraded IBE algorithm is created to address network security issues such as hostile assaults, privacy leaks, and identity theft. The system adopts the IBE algorithm for the encryption design, which can effectively resist security threats such as static password loss and pseudo-server attacks, improve system confidentiality, and make data transmission in the smart home system more secure. The key management, it can be argued, is the foundation of cryptographic security and plays an essential role in encryption behavior.


---

## Body

## 1. Introduction

The sensing node device itself in the IoT environment has great limitations, such as single function and small storage space, and other features lead to limited resources and low-security protection, so some malicious attackers are able to easily intercept the node itself and tamper with the private data information causing a bad impact [1]. The identity-based IBE encryption algorithm adopts elliptic curve ECC. Compared with RSA, under the same security, the specific data of ECC key length is 163 bytes, and the RSA key length is 1024 bytes. It can be seen that ECC is about 84% shorter than RSA alone. Therefore, using ECC encryption will save resources [2]. Therefore, using ECC encryption will save a lot of storage time [3]. Hence, it is of far-reaching significance to improve the security of the IBE algorithm and apply it in restricted IoT sensor networks and RFID devices [4].The security of the IoT information network depends on the applied encryption mechanism, i.e., on the designed encryption algorithm method [5]. An important approach in cryptography is to treat the key confidentially, i.e., to guarantee the secure management of the key. In practical applications, improper key management, such as key corruption or loss, can prevent legitimate usage from completing encryption and decryption, while key leakage can lead to malicious data theft and system damage by attackers [6]. It can be said that key management plays an indispensable role in encryption behavior and is the basis of cryptographic security, which has a particularly profound impact on various application solutions [7].Because keys are very important in cryptography, one of the cornerstones of encryption techniques is secure key management, which is more secure than other types of data; therefore, one of the study areas of this work is to secure the key and fill the vulnerability of key trust. Therefore, a research direction is identified in this article, which is to secure keys and fill the loopholes of key management. Based on this identity encryption scheme, we study key management problems in the IoT sensing layer nodes with the solution logic of the key escrow problem [8].On the other hand, for example, if a hacker attacks a normal person and obtains the corresponding encrypted message, whether it is possible to unlock the ciphertext from the actual recipient is another hot topic of research [9]. Therefore, in order to protect the private data of the receiver's identity, to avoid disclosing the receiver’s identity information to the attacker, and to increase the ciphertext security, we provide the following information in this article [10]. Another aspect of this article is to increase the difficulty of ciphertext deciphering. The IBE encryption scheme is also called the anonymous IBE scheme.Since the identity-based encryption algorithm designed in this article solves the key escrow problem, the decryption algorithm divides the ciphertext C into two steps for calculation. The anonymous encryption algorithm is designed to strengthen the security of the algorithm. Even if the attacker steals the ciphertext, it is difficult to crack the data information of the receiver’s identity from the ciphertext, so the improved identity-based encryption algorithm will be proposed in this article. This study proposes a communication security system based on the improved IBE algorithm to address network security issues such as malicious assaults, privacy leakage, and identity theft in the process of data transmission in smart home systems.The article arrangements are as follows: Section2 designates the related work; Section 3 discusses the smart home control system design; Section 4 describes the improvement solutions; Section 5 analyzes the experiment analysis; Section 6 concludes the article.


## 2. Related Work

At the end of the twentieth century, the study in [11] analyzed the concept of identity-based cryptosystem (IBC), in which the user’s identity is represented by a string that uniquely identifies the user’s identity, such as IP address and e-mail address, and is computed based on the identity information using publicly available cryptographic algorithms. The public key data of the user is obtained for subsequent cryptographic calculation, and the private key data of the user is generated by the trusted private key generation (PKG) center.The study in [12] distills the core concept of IBE encryption, which is the first identity-based encryption (IBE) algorithm based on user identity information. The IBE algorithm excludes the complicated phase of public key certificate management and eliminates the link of public-key authentication. The PKG, the private-key generation center, obtains the identity information of the user who accesses the system and calculates the user’s private key based on it. Thus, the IBE algorithm is a good alternative to the certificate-based cryptographic algorithm when used in limited environments. Another important and time-consuming operation in the IBE algorithm is the bilinear pairing operation [13]. The study in [14] constructed an IBE encryption algorithm scheme under the standard model with adaptive security. The algorithm utilizes the mathematical knowledge of bilinear pairing and the hash function AHF (admissible hash function), but the key used for decryption and the size of the encrypted ciphertext are larger in their constructed scheme. The study in [15] used the mathematical basis of bilinear pairing to construct a more efficient IBE algorithm, which also has adaptive security. The study in [16] constructed an encryption algorithm scheme for selecting ciphertext security based on the IBE encryption scheme. The study in [17] proposed CLPKC (certificateless public key cryptosystem) for solving the security problem of key management and gave the algorithm for its formal definition. The study in [18] proposed the CLPKC encryption scheme and also gave its security model based on IBE. [19] used modulo exponential operations to give another certificateless public key cryptosystem called the BSS encryption scheme and also gave a security proof of the BSS scheme under the random prediction model. Later, on the basis of the BSS encryption scheme, the study in [20] proposed a new certificateless public key cryptographic scheme called the LK scheme, and at present, when studying the certificateless public key encryption algorithm, the public key encryption algorithm of AP is still mainly used.


## 3. Smart Home Control System Design

In this section, the total smart home control designs are described and the smart home control system’s network architecture is defined. The data transmission security software architecture is examined.


### 3.1. Overall Design Scheme

The smart home control system generally includes core controller, ZigBee coordinator, intelligent terminal, and control object. It mainly realizes the remote control of household appliances and the monitoring and alarm of home security, temperature and humidity, gas leakage, etc. The overall design scheme of the smart home control system is shown in Figure1. It shows the complete smart home control system, i.e., light control node and temperature humidity node.Figure 1
verall design plan of the smart home control system.


### 3.2. Network Architecture

The smart home control system’s network architecture is shown in Figure2. The external and the internal home networks are connected through the embedded gateway, and the internal home network primarily uses ZigBee wireless sensing technology for networking, allowing intelligent terminal devices to be controlled. Users mainly use smartphones and other devices to achieve remote control of home equipment with Wi-Fi, and the embedded gateway plays a role in the whole process. Users access the home embedded gateway with the help of remote control terminals and log in through the Internet, and the embedded gateway is connected to the coordinator wirelessly.Figure 2
System network architecture diagram.


### 3.3. Data Transmission Security Software Architecture

The data transmission security software architecture is shown in Figure3. The authentication server is the core of authentication, and it is the link between the authentication system and the data encryption system. The user’s access to the internal home network through login is generally controlled by the user authentication server, and when it receives the connection request from the client, it completes the interactive authentication with the client and generates the dynamic key at the same time.Figure 3
Data transmission security software architecture.


## 3.1. Overall Design Scheme

The smart home control system generally includes core controller, ZigBee coordinator, intelligent terminal, and control object. It mainly realizes the remote control of household appliances and the monitoring and alarm of home security, temperature and humidity, gas leakage, etc. The overall design scheme of the smart home control system is shown in Figure1. It shows the complete smart home control system, i.e., light control node and temperature humidity node.Figure 1
verall design plan of the smart home control system.


## 3.2. Network Architecture

The smart home control system’s network architecture is shown in Figure2. The external and the internal home networks are connected through the embedded gateway, and the internal home network primarily uses ZigBee wireless sensing technology for networking, allowing intelligent terminal devices to be controlled. Users mainly use smartphones and other devices to achieve remote control of home equipment with Wi-Fi, and the embedded gateway plays a role in the whole process. Users access the home embedded gateway with the help of remote control terminals and log in through the Internet, and the embedded gateway is connected to the coordinator wirelessly.Figure 2
System network architecture diagram.


## 3.3. Data Transmission Security Software Architecture

The data transmission security software architecture is shown in Figure3. The authentication server is the core of authentication, and it is the link between the authentication system and the data encryption system. The user’s access to the internal home network through login is generally controlled by the user authentication server, and when it receives the connection request from the client, it completes the interactive authentication with the client and generates the dynamic key at the same time.Figure 3
Data transmission security software architecture.


## 4. Improvement Solutions

The first problem is how to protect the master key of the PKG; the second problem is how to prove one’s identity to the PKG; the third problem is how to provide the user’s private key to the user securely. For the aforementioned problems, this article proposes a solution of the private key distribution protocol based on the intermediate public key and threshold function.The solution of this scheme is to share the PKG master keyS by n equally trusted third parties, and each PKG has a one-to-one corresponding subkey Si. Any tPKGs can obtain the master key S (any t less than tPKGs will not be able to obtain the master key S), and when the user needs to apply for a private key, he needs to obtain a part of the private key information about himself from tPKGsQr.LetSi be the master key part of each PKGi with master key S0=∑Si, where P is the system public parameter and public key P0=∑SiP, and the protocol is implemented as follows:(1)
Select the master keyXID∈Zq∗ identified by the ID (selection follows randomness), and then, calculate the public key relative to the selected master key:(1)PIDi=XID,YIDi=xIDP,xIDSPi.Send messagePIDi,ID to PKGi.(2)
PKGi calculates PIDi by ID to check the user identity, then calculates the public key DID′i=SiQID=SiHID,PIDi, and sends the calculation result to the corresponding user.(3)
The user calculates the private key：DID=∑xIDDID′i.In this way, the user can securely obtain the public and private keys, and the process is illustrated in Figure4.Figure 4
Improved IBE schematic diagram.The improved certificate system is used as the infrastructure of the security application system to ensure the integrity, security, nonrepudiation, and confidentiality of the security application system. The scheme ensures security by encrypting random symmetric keys with asymmetric keys and encrypting information that needs to be kept secret by performing signature and hashing operations on the confidential information [21, 22]. The processing flow of the sender is as follows: (1) encrypt the original text using the symmetric key generated by a random number so that the original text generates the ciphertext; (2) encrypt the symmetric key using the public key of the receiver so that it generates the packing key; (3) generate the original text into a digest using the hash function; and (4) obtain the sender's private key from the trusted third party using the protocol. The final result generated by the above process is sent to the receiver, as shown in Figure 5.Figure 5
Diagram of the results.


## 5. Experimental Analysis

The following experiments are conducted to analyze the computation time of the anonymous CIBE encryption algorithm proposed in this article and the key-improvement CIBE algorithm proposed in the previous study. The amount of computation time for encryption and decryption in the encryption and decryption phases of the key-improvement CIBE algorithm proposed in this study is analyzed.


### 5.1. Encryption Algorithm Testing

In the CIBE encryption stage, dissimilar bytes of plaintext messages are simulated and the running time of the encryption algorithm is recorded using “System. Current Time Millis ().” In the CIBE encryption stage, we record the running time of the encryption algorithm using “System. Current Time Millis ()” and experiment with the CIBE encryption algorithm with an upgraded key and the anonymous CIBE encryption algorithm in this study, respectively [23].The experimental procedure is similar to the experimental procedure in the previous study, and three groups of experiments are conducted for the two algorithms, CIBE with an improved key in Section 3 and CIBE with anonymity in this section. The time used for the calculation of the encryption phase and the average value of the three groups of data are counted, with three decimal places retained, to obtain the data shown in Table1.Table 1
Encryption time of key-improvement CIBE and anonymous CIBE.
Bytes50.00100.10150.00200.00250.20300.30350.10400.30Key-improvement CIBE (ms)Group 1330.00337.20330.10336.10345.00336.10340.20343.40Group 2332.90331.80339.10341.20330.10343.10347.90348.10Group 3332.00335.30338.20343.00351.10340.20337.10350.00Average value331.60334.60335.60340.00342.00339.60341.60347.00Anonymous CIBE (ms)Group 1340.10339.00335.00341.20340.20342.90347.70349.20Group 2333.20334.20342.20342.10356.40340.30342.00346.10Group 3320.00330.30329.30338.00330.90339.00337.20349.00Average value331.00334.30335.30340.30342.30340.60342.30348.00The average data is input into MATLAB to obtain Figure6, where the horizontal coordinate represents the number of plaintext bytes in bytes and the encryption time in ms, the black line represents the key-improvement CIBE encryption algorithm, and the red line represents the anonymous CIBE encryption algorithm.Figure 6
Encryption time trends for key-improvement CIBE and anonymous CIBE algorithms.From Figure6, it can be seen that the difference between the CIBE algorithm with anonymity and the former is smaller when the number of plaintext bytes is less than 150 bytes and the time difference is slightly caused by the instability of the encryption time of the system when the number of plaintext bytes is small. When the number of plaintext bytes is more than 150 bytes, the overall disadvantage of the anonymous CIBE algorithm is caused by the increase in the number of cycles involved in the initialization of the anonymous CIBE algorithm, but the time difference between the two CIBE encryption algorithms is small; so, it can be said that the anonymous CIBE algorithm does not increase the computational burden in terms of encryption time.


### 5.2. Decryption Algorithm Testing

Different bytes of plaintext information are simulated and turned into plaintext in the CIBE decryption phase, and the time spent for decryption of the two CIBE algorithms is recorded. The experimental procedure is the same as in the previous section, and three groups of experiments are conducted for the two CIBE algorithms. The time used in the decryption phase and the average of the three groups of data are counted, with three decimal places retained, to obtain the data shown in Table2.Table 2
Decryption time of key-improvement CIBE and anonymous CIBE.
Bytes50.00100.10149.90200.00250.40300.10350.10400.10Key-improvement CIBE (ms)Group 1310.10330.10323.20320.10309.10320.10332.30313.00Group 2304.00310.00321.80310.00311.00310.00318.10330.30Group 3315.00308.20303.30311.10333.30332.20318.00332.20Average value309.60316.00316.00313.60317.60320.70322.70325.00Anonymous CIBE (ms)Group 1307.10329.00319.40320.00315.30317.30322.20320.00Group 2312.00312.20320.00314.10314.40320.00320.00329.20Group 3308.00309.00311.10318.00324.00320.10324.10333.30Average value309.00316.60316.70317.30317.70319.00322.00327.30The average data is input into MATLAB to obtain the values in Figure7, where the horizontal coordinate represents the number of plaintext bytes, the red line represents the anonymous CIBE encryption algorithm, and the black line represents the key-improvement CIBE encryption algorithm.Figure 7
Trend of the decryption time for key-improvement CIBE and anonymous CIBE algorithms.The decryption time difference between the two encryption algorithms reaches 3.666 ms when the number of plaintext bytes is 200 bytes as shown in Figure7 due to the small set of measurement values counted in the actual operation of the key-improvement CIBE algorithm, which is an occasional condition and can be ignored. When the number of plaintext bytes is less than 350 bytes, the difference between the anonymous CIBE algorithm and the key-improvement CIBE is small and the time difference is still caused by the instability of the system decryption operation. When the number of plaintext bytes is greater than 350 bytes, the anonymous CIBE algorithm grows at a disadvantage caused by the increase in the number of cyclic groups involved in its operation. Since the difference in the time required for decryption between the two CIBE encryption algorithms is small, it can be assumed that the anonymous CIBE algorithm does not increase the computational burden in terms of decryption time.


## 5.1. Encryption Algorithm Testing

In the CIBE encryption stage, dissimilar bytes of plaintext messages are simulated and the running time of the encryption algorithm is recorded using “System. Current Time Millis ().” In the CIBE encryption stage, we record the running time of the encryption algorithm using “System. Current Time Millis ()” and experiment with the CIBE encryption algorithm with an upgraded key and the anonymous CIBE encryption algorithm in this study, respectively [23].The experimental procedure is similar to the experimental procedure in the previous study, and three groups of experiments are conducted for the two algorithms, CIBE with an improved key in Section 3 and CIBE with anonymity in this section. The time used for the calculation of the encryption phase and the average value of the three groups of data are counted, with three decimal places retained, to obtain the data shown in Table1.Table 1
Encryption time of key-improvement CIBE and anonymous CIBE.
Bytes50.00100.10150.00200.00250.20300.30350.10400.30Key-improvement CIBE (ms)Group 1330.00337.20330.10336.10345.00336.10340.20343.40Group 2332.90331.80339.10341.20330.10343.10347.90348.10Group 3332.00335.30338.20343.00351.10340.20337.10350.00Average value331.60334.60335.60340.00342.00339.60341.60347.00Anonymous CIBE (ms)Group 1340.10339.00335.00341.20340.20342.90347.70349.20Group 2333.20334.20342.20342.10356.40340.30342.00346.10Group 3320.00330.30329.30338.00330.90339.00337.20349.00Average value331.00334.30335.30340.30342.30340.60342.30348.00The average data is input into MATLAB to obtain Figure6, where the horizontal coordinate represents the number of plaintext bytes in bytes and the encryption time in ms, the black line represents the key-improvement CIBE encryption algorithm, and the red line represents the anonymous CIBE encryption algorithm.Figure 6
Encryption time trends for key-improvement CIBE and anonymous CIBE algorithms.From Figure6, it can be seen that the difference between the CIBE algorithm with anonymity and the former is smaller when the number of plaintext bytes is less than 150 bytes and the time difference is slightly caused by the instability of the encryption time of the system when the number of plaintext bytes is small. When the number of plaintext bytes is more than 150 bytes, the overall disadvantage of the anonymous CIBE algorithm is caused by the increase in the number of cycles involved in the initialization of the anonymous CIBE algorithm, but the time difference between the two CIBE encryption algorithms is small; so, it can be said that the anonymous CIBE algorithm does not increase the computational burden in terms of encryption time.


## 5.2. Decryption Algorithm Testing

Different bytes of plaintext information are simulated and turned into plaintext in the CIBE decryption phase, and the time spent for decryption of the two CIBE algorithms is recorded. The experimental procedure is the same as in the previous section, and three groups of experiments are conducted for the two CIBE algorithms. The time used in the decryption phase and the average of the three groups of data are counted, with three decimal places retained, to obtain the data shown in Table2.Table 2
Decryption time of key-improvement CIBE and anonymous CIBE.
Bytes50.00100.10149.90200.00250.40300.10350.10400.10Key-improvement CIBE (ms)Group 1310.10330.10323.20320.10309.10320.10332.30313.00Group 2304.00310.00321.80310.00311.00310.00318.10330.30Group 3315.00308.20303.30311.10333.30332.20318.00332.20Average value309.60316.00316.00313.60317.60320.70322.70325.00Anonymous CIBE (ms)Group 1307.10329.00319.40320.00315.30317.30322.20320.00Group 2312.00312.20320.00314.10314.40320.00320.00329.20Group 3308.00309.00311.10318.00324.00320.10324.10333.30Average value309.00316.60316.70317.30317.70319.00322.00327.30The average data is input into MATLAB to obtain the values in Figure7, where the horizontal coordinate represents the number of plaintext bytes, the red line represents the anonymous CIBE encryption algorithm, and the black line represents the key-improvement CIBE encryption algorithm.Figure 7
Trend of the decryption time for key-improvement CIBE and anonymous CIBE algorithms.The decryption time difference between the two encryption algorithms reaches 3.666 ms when the number of plaintext bytes is 200 bytes as shown in Figure7 due to the small set of measurement values counted in the actual operation of the key-improvement CIBE algorithm, which is an occasional condition and can be ignored. When the number of plaintext bytes is less than 350 bytes, the difference between the anonymous CIBE algorithm and the key-improvement CIBE is small and the time difference is still caused by the instability of the system decryption operation. When the number of plaintext bytes is greater than 350 bytes, the anonymous CIBE algorithm grows at a disadvantage caused by the increase in the number of cyclic groups involved in its operation. Since the difference in the time required for decryption between the two CIBE encryption algorithms is small, it can be assumed that the anonymous CIBE algorithm does not increase the computational burden in terms of decryption time.


## 6. Conclusion

In order to solve network security problems such as malicious attacks, privacy leakage, and identity theft in the process of data communication of smart home systems, this article designs a communication security system based on an improved IBE algorithm. For encryption, the system uses the IBE algorithm, which can effectively withstand security threats including static password loss and pseudo-server assaults. The IBE encryption algorithm proposed in this article maintains the same performance advantage as the traditional IBE encryption algorithm in terms of encryption and decryption efficiency, and the overall computational effort of the encryption algorithm is better than that of the AP encryption algorithm.



---

*Source: 4066761-2022-05-20.xml*