# IIBE: An Improved Identity-Based Encryption Algorithm for WSN Security

Authors: ChunHua Cao; YaNa Tang; DeYan Huang; WeiMin Gan; Chunjiong Zhang
Journal: Security and Communication Networks
 (2021)

---

## Abstract

Wireless sensor networks (WSN) have problems such as limited power, weak computing power, poor communication ability, and vulnerability to attack. However, the existing encryption methods cannot effectively solve the above problems when applied to WSN. To this end, according to WSN’s characteristics and based on the identity-based encryption idea, an improved identity-based encryption algorithm (IIBE) is proposed, which can effectively simplify the key generation process, reduce the network traffic, and improve the network security. The design idea of this algorithm lies between the traditional public key encryption and identity-based public tweezers’ encryption. Compared with the traditional public key encryption, the algorithm does not need a public key certificate and avoids the management of the certificate. Compared with identity-based public key encryption, the algorithm addresses the key escrow and key revocation problems. The results of the actual network distribution experiments demonstrate that IIBE has low energy consumption and high security, which are suitable for application in WSN with high requirements on security.


---

## Body

## 1. Introduction

WSN is a wireless network composed of sensor nodes in the form of self-organization, which collects and processes the relevant information of monitored objects in the target area and sends it to the observer [1–10].As early as the middle of the last century, there appeared a network which combined sensors with wireless transmitters and carried out real-time data acquisition, which was the prototype of WSN. WSN began to mature, following the technical progress and the deepening of related research [11–14]. The application field of WSN has gradually developed from the military field to all walks of life, such as agricultural production, environmental monitoring, cultural relics protection, and medical care [15]. Information encryption is the most core and basic technical method to protect information security [16–18]. The encryption process of data is to use encryption key and encryption algorithm to convert plaintext into ciphertext form that other users cannot understand, while decryption is the reverse process, using decryption key and decryption algorithm to recover the ciphertext into plaintext. Encrypted text is transmitted between users, and only the user with the decryption key can decrypt the encrypted text to obtain the plaintext [19–21]. In general, cryptosystems are divided into two types: one is symmetric cryptosystems and the other is public key cryptosystems.Since WSN is usually deployed in an unattended environment, besides eavesdropping attacks, denial of service attacks, and other attacks faced by ordinary networks, it also faces the problems that WSN nodes are easy to be captured and counterfeited, and transmitted data are easy to be eavesdropped and tampered [22–24]. Currently, WSN has mediocre solution when facing the above security problems. Before these problems are solved, users cannot easily accept and deploy a WSN with security and data protection, which greatly limits WSN practical application.In order to address the challenge of WSN security, IIBE is proposed. The main contributions of this paper are as follows:(1)
Compared with the traditional public key encryption, this algorithm does not need a public key certificate and avoids the management of certificates(2)
Compared with other existing identity-based encryption algorithms, this algorithm solves the problem of key escrow and key revocationThe rest of the paper is organized as follows. In Section2, a literature review is studied in detail, while Section 3 provides the detailed methodology. Section 4 provides detailed results and discussion. Finally, the paper is concluded in Section 5.


## 2. Literature Review

At present, scholars have studied the improvement of symmetric/asymmetric encryption algorithms, the combination of various encryption algorithms, and some innovative encryption ideas.Mostafaei et al. [22] provided a solution to the flooding attack in WSN through message digest algorithm combined with public key encryption, which improved the network’s ability to detect data packet transmission. NS2 simulation results show that this method is effective in preventing flooding attacks. However, this method only signs the data transmitted by nodes to prevent flooding attacks and has limited preventive effect on data eavesdropping attacks, so it needs to be combined with other encryption methods in practical applications.Rachkidy et al. [23] proposed a method of data storage combined with homomorphic encryption for some wireless sensor networks with insensitive real-time data, which is called DIOS. In some WSN (such as underwater sensor networks), people are more concerned about the whole data, rather than the data at a certain time. In view of this situation and considering that a large amount of data may cause loss to the sensor nodes if it is transmitted for a long time and a long distance, this literature puts forward that the data should be stored in a relay node in advance and preprocessed, so as to avoid the scattered and uninterrupted transmission of data. At the same time, homomorphic encryption is adopted to ensure security. This method is effective in some occasions, saving energy, and data can be stored safely. However, it is not suitable for most net-laying environments and has certain limitations.Daniela and Giovanni [24] improved the application of AES in WSN, put forward the encryption idea of seven rounds of encryption, and combined with the table lookup method to optimize each round of operation. The results of simulation test show that the algorithm has greatly improved operation efficiency, and the speed is 13 times higher than that of common AES algorithm with less than 1 KB storage space. Although the security is lower than the traditional AES encryption algorithm, it is still suitable for WSN with limited energy.All the above methods have defects, which cannot fully meet the needs of practical application of wireless sensor networks. To solve the above problems, according to the characteristics of WSN and based on the idea of identity-based encryption, an improved identity-based encryption algorithm (IIBE) is proposed, which can effectively simplify the key generation process, reduce the network traffic, and improve the network security.


## 3. Methodology

### 3.1. Analysis of WSN Network Topology and Its Security Problems

According to ZigBee protocol, WSN has three topologies: star topology, tree topology, and mesh topology, as shown in Figure1.Figure 1
Three topologies of ZigBee network.The network specified by ZIGBEE protocol is composed of main coordinator nodes, router nodes, and terminal nodes, and there is only one main coordinator network. Every device in the network, including master device and slave device, has a unique 64-bit long address (IEEE address) built in at the factory. After the network is built, each slave device will be randomly assigned to a unique 16-bit short address code in the network by the master coordinator. The long address code is an absolute address, while the short address code is a relative address. Based on a large amount of data and practical operation experience of wireless sensor networks, it can be concluded that the existing wireless sensor networks have problems such as limited energy, limited computing and storage capacity, periodicity of data collection, asymmetry of data flow, and limited communication channel width.Taking the WSN network designed by ZIGBEE protocol as an example, the more serious attack forms are (1) black hole attack, (2) flooding attack, (3) data eavesdropping attack, and (4) server key escrow problem. Although the common asymmetric encryption algorithm can be used for identity authentication, because the authentication process is complicated and the key distribution is very inconvenient, people have been looking for an alternative method with efficient authentication capability.


### 3.2. Traditional IBE Encryption Algorithm

In 1984, Shamir et al. first proposed the concept of identity-based encryption (IBE), but in 2001, IBE was realized by Boneh et al. using bilinear pairings on elliptic curves [25]. However, the current IBE algorithm still has some problems, such as too complicated operation and key escrow. How to improve IBE algorithm and make it really applied in WSN is a hot research topic at present.The common IBE scheme usually consists of four processes: initialization, private key generation and distribution, encryption, and decryption [26]. Among them, the private key needs to be assigned to the user in advance through the secure channel, while the public key can be generated according to the public information of the user. The workflow of IBE mechanism is shown in Figure 2.Figure 2
Schematic diagram of IBE workflow.The core of traditional IBE encryption algorithm is bilinear pairing operation, which needs to go through multiple rounds of polynomial iterative process, and the computational complexity is extremely high.


### 3.3. Improved Identity-Based Encryption Algorithm lIBE

On the basis of studying the encryption structure of traditional IBE algorithm, a scheme IIBE is proposed to solve the above key escrow and revocation problems. The design idea is as follows: the user’s private key in the system is divided into two parts, one part is controlled by private key generator (PKG), and the other part is controlled by users themselves. When decrypting, PKG firstly decrypts the received ciphertext with a partial private key and gives the result to the user, and then, the user decrypts it with his own partial private key to obtain the final decrypted plaintext. If a user’s key needs to be revoked, PKG does not help the user to decrypt it preliminarily. Because PKG does not master all the private keys, it can avoid the key escrow problem.IIBE consists of five processes: system initialization, key extraction, public key extraction, encryption, and decryption.(1)
System initialization: the algorithm takes security parameterk as input and returns system parameters params and master-key. System parameters include the description of plaintext space M and ciphertext space C. The algorithm is run by PKG, params can be made public, and master-key is only known by PKG.(2)
Key extraction: the algorithm takesparams and a user’s ID as input and returns the secret value xID of ID and the key XSID. The algorithm can be run by user ID or PKG, and the secret value and key are not disclosed after being generated.(3)
Public key extraction: the algorithm takesparams and the secret value xID of the user ID as input and returns the public key PID of the user ID. The algorithm is run by user ID, and the generated public key PID is made public.(4)
Encryption: the algorithm takesparams, plaintext M ∈ M, and public key PID of user ID as input. The ciphertext C ∈ C corresponding to M or the termination symbol “⊥” indicates encryption failure, and encryption failure only occurs when the form of public key PID is incorrect.(5)
Decryption: the algorithm takesparams, ciphertext C, private key DID, and key XSID of user ID as input and returns plaintext M corresponding to C or termination symbol “⊥” to indicate decryption failure.If ciphertextC is obtained by encryption algorithm (with params, PID, and plaintext M as input), then running decryption algorithm (with params, DID, XSID, and ciphertext C as input) will definitely get correct plaintext M.The specific operation process of IIBE encryption algorithm initialization and encryption and decryption is shown in Figure3.Figure 3
Initialization and encryption and decryption process of IIBE encryption algorithm.The parameter design of IIBE encryption algorithm is shown in Table1.Table 1
Parameter design of IIBE algorithm.
Common parametersPrimitive elementPublic informationPublic keyRandom parameterHash functionNode private keyMapping functionOriginal plaintextNumber of parameters111112121Elemental symbolsPQbobQrHashEfDThe functions of each parameter are(1)
Public parameters: the public parameter is randomly generated by the server, not disclosed, only reserved by the server, and used to issue the node private key. However, participates in all encryption, decryption, and authentication operations thereafter [27].(2)
Primitive elementP: primitive element belongs to a point in the finite field of elliptic curve, but it plays an extremely important role in IIBE algorithm, so it is an element alone. All points of finite fields can be generated by p.(3)
Public informationQbob: it is some traceable and unchangeable information of nodes.(4)
Public keyQ: it is generated by public information Qbob, which is a point on the elliptic curve finite field, and can be generated by the node itself or other nodes according to the public information.(5)
Random parameterr: it is randomly generated by nodes, participating in the ciphertext generation process and participating in the decryption process in the form of rP.(6)
Hash functionHash: map a string to a certain point in a finite field [28, 29].(7)
Mapping function numberf: convert the string into the corresponding binary code string.(8)
Node private keyE: it is generated by the server and assigned to the node.(9)
Original plaintextD: it needs to be mapped to binary code string for encryption and decryption.


### 3.4. Comparative Analysis of Complexity

We compare IIBE, AES, IBE, and DIOS from two aspects of key security and computational complexity. The comparison results of key security are shown in Table2.Table 2
Comparison of key security.
Dataset nameForward security of keyBackward security of keyHelp device key leakIBE√AES√DIOS√√IIBE√√√It can be seen from Table2 that the key security of the proposed IIBE algorithm is the highest. Then, compare the computational complexity of different algorithms, as shown in Table 3.Table 3
Comparison of computational complexity.
Different stagesIBEAESDIOSIIBESystem initializationO (log N)O (log N)O (1)O (1)Help device key updateO (log N)O (log N)O (1)O (1)User key updateO (log N)O (log N)O (1)O (1)Help device key refreshO (log N)O (log N)O (log N)O (1)User key refreshO (log N)O (log N)O (log N)O (1)EncryptionO (log N)O (log N)O (log N)O (log N)DecodeO (log N)O (log N)O (log N)O (log N)It can be seen from Table3 that, compared with other algorithms, the computational complexity of the proposed IIBE algorithm in system initialization, helping device, and user key update is reduced from O (log N) to o (1), which means that the complexity of the proposed IIBE algorithm is the lowest.


## 3.1. Analysis of WSN Network Topology and Its Security Problems

According to ZigBee protocol, WSN has three topologies: star topology, tree topology, and mesh topology, as shown in Figure1.Figure 1
Three topologies of ZigBee network.The network specified by ZIGBEE protocol is composed of main coordinator nodes, router nodes, and terminal nodes, and there is only one main coordinator network. Every device in the network, including master device and slave device, has a unique 64-bit long address (IEEE address) built in at the factory. After the network is built, each slave device will be randomly assigned to a unique 16-bit short address code in the network by the master coordinator. The long address code is an absolute address, while the short address code is a relative address. Based on a large amount of data and practical operation experience of wireless sensor networks, it can be concluded that the existing wireless sensor networks have problems such as limited energy, limited computing and storage capacity, periodicity of data collection, asymmetry of data flow, and limited communication channel width.Taking the WSN network designed by ZIGBEE protocol as an example, the more serious attack forms are (1) black hole attack, (2) flooding attack, (3) data eavesdropping attack, and (4) server key escrow problem. Although the common asymmetric encryption algorithm can be used for identity authentication, because the authentication process is complicated and the key distribution is very inconvenient, people have been looking for an alternative method with efficient authentication capability.


## 3.2. Traditional IBE Encryption Algorithm

In 1984, Shamir et al. first proposed the concept of identity-based encryption (IBE), but in 2001, IBE was realized by Boneh et al. using bilinear pairings on elliptic curves [25]. However, the current IBE algorithm still has some problems, such as too complicated operation and key escrow. How to improve IBE algorithm and make it really applied in WSN is a hot research topic at present.The common IBE scheme usually consists of four processes: initialization, private key generation and distribution, encryption, and decryption [26]. Among them, the private key needs to be assigned to the user in advance through the secure channel, while the public key can be generated according to the public information of the user. The workflow of IBE mechanism is shown in Figure 2.Figure 2
Schematic diagram of IBE workflow.The core of traditional IBE encryption algorithm is bilinear pairing operation, which needs to go through multiple rounds of polynomial iterative process, and the computational complexity is extremely high.


## 3.3. Improved Identity-Based Encryption Algorithm lIBE

On the basis of studying the encryption structure of traditional IBE algorithm, a scheme IIBE is proposed to solve the above key escrow and revocation problems. The design idea is as follows: the user’s private key in the system is divided into two parts, one part is controlled by private key generator (PKG), and the other part is controlled by users themselves. When decrypting, PKG firstly decrypts the received ciphertext with a partial private key and gives the result to the user, and then, the user decrypts it with his own partial private key to obtain the final decrypted plaintext. If a user’s key needs to be revoked, PKG does not help the user to decrypt it preliminarily. Because PKG does not master all the private keys, it can avoid the key escrow problem.IIBE consists of five processes: system initialization, key extraction, public key extraction, encryption, and decryption.(1)
System initialization: the algorithm takes security parameterk as input and returns system parameters params and master-key. System parameters include the description of plaintext space M and ciphertext space C. The algorithm is run by PKG, params can be made public, and master-key is only known by PKG.(2)
Key extraction: the algorithm takesparams and a user’s ID as input and returns the secret value xID of ID and the key XSID. The algorithm can be run by user ID or PKG, and the secret value and key are not disclosed after being generated.(3)
Public key extraction: the algorithm takesparams and the secret value xID of the user ID as input and returns the public key PID of the user ID. The algorithm is run by user ID, and the generated public key PID is made public.(4)
Encryption: the algorithm takesparams, plaintext M ∈ M, and public key PID of user ID as input. The ciphertext C ∈ C corresponding to M or the termination symbol “⊥” indicates encryption failure, and encryption failure only occurs when the form of public key PID is incorrect.(5)
Decryption: the algorithm takesparams, ciphertext C, private key DID, and key XSID of user ID as input and returns plaintext M corresponding to C or termination symbol “⊥” to indicate decryption failure.If ciphertextC is obtained by encryption algorithm (with params, PID, and plaintext M as input), then running decryption algorithm (with params, DID, XSID, and ciphertext C as input) will definitely get correct plaintext M.The specific operation process of IIBE encryption algorithm initialization and encryption and decryption is shown in Figure3.Figure 3
Initialization and encryption and decryption process of IIBE encryption algorithm.The parameter design of IIBE encryption algorithm is shown in Table1.Table 1
Parameter design of IIBE algorithm.
Common parametersPrimitive elementPublic informationPublic keyRandom parameterHash functionNode private keyMapping functionOriginal plaintextNumber of parameters111112121Elemental symbolsPQbobQrHashEfDThe functions of each parameter are(1)
Public parameters: the public parameter is randomly generated by the server, not disclosed, only reserved by the server, and used to issue the node private key. However, participates in all encryption, decryption, and authentication operations thereafter [27].(2)
Primitive elementP: primitive element belongs to a point in the finite field of elliptic curve, but it plays an extremely important role in IIBE algorithm, so it is an element alone. All points of finite fields can be generated by p.(3)
Public informationQbob: it is some traceable and unchangeable information of nodes.(4)
Public keyQ: it is generated by public information Qbob, which is a point on the elliptic curve finite field, and can be generated by the node itself or other nodes according to the public information.(5)
Random parameterr: it is randomly generated by nodes, participating in the ciphertext generation process and participating in the decryption process in the form of rP.(6)
Hash functionHash: map a string to a certain point in a finite field [28, 29].(7)
Mapping function numberf: convert the string into the corresponding binary code string.(8)
Node private keyE: it is generated by the server and assigned to the node.(9)
Original plaintextD: it needs to be mapped to binary code string for encryption and decryption.


## 3.4. Comparative Analysis of Complexity

We compare IIBE, AES, IBE, and DIOS from two aspects of key security and computational complexity. The comparison results of key security are shown in Table2.Table 2
Comparison of key security.
Dataset nameForward security of keyBackward security of keyHelp device key leakIBE√AES√DIOS√√IIBE√√√It can be seen from Table2 that the key security of the proposed IIBE algorithm is the highest. Then, compare the computational complexity of different algorithms, as shown in Table 3.Table 3
Comparison of computational complexity.
Different stagesIBEAESDIOSIIBESystem initializationO (log N)O (log N)O (1)O (1)Help device key updateO (log N)O (log N)O (1)O (1)User key updateO (log N)O (log N)O (1)O (1)Help device key refreshO (log N)O (log N)O (log N)O (1)User key refreshO (log N)O (log N)O (log N)O (1)EncryptionO (log N)O (log N)O (log N)O (log N)DecodeO (log N)O (log N)O (log N)O (log N)It can be seen from Table3 that, compared with other algorithms, the computational complexity of the proposed IIBE algorithm in system initialization, helping device, and user key update is reduced from O (log N) to o (1), which means that the complexity of the proposed IIBE algorithm is the lowest.


## 4. Experimental Results and Analysis

### 4.1. Experimental Setup

In the experiment, the WSN node adopts CC2530 sensor network node of TI (Texas instruments) company [30], which has an enhanced C51 single chip microcomputer and 8k RAM storage space, and is powered by two No.5 batteries [31, 32]. WSN nodes are shown in Figure 4. The actual network topology of IIBE is shown in Figure 5. Settings of WSN network parameters are shown in Table 4.Figure 4
WSN node equipment used in experiment.Figure 5
Actual network topology of IIBE.Table 4
WSN network parameter setting.
Mesh areaTransmission frequencyInitial voltage (V)Network topologyLongest packet sent in a single time (bit)Arrangement modeKey length (bit)Dormancy1 km × 1 kmRandom (0–60 s)3.2Net structure120Random30NoTen CC2530 nodes are used for network deployment, and all IIBE nodes in WSN are not set to sleep. All collected data are stored in the MySql database on the server side. Then, it will be tested from three aspects: energy consumption, network communication capability, and security capability.


### 4.2. Energy Consumption Test

Firstly, the energy consumption of several encryption algorithms is tested. The IIBE algorithm performs node authentication every 30 minutes and key update every two hours in order to approach the actual network deployment situation as much as possible. A total of about 100,000 pieces of actual data were collected by the experimental WSN network, and the fitting curve obtained by sorting out is shown in Figure6.Figure 6
Average voltage trend of WSN nodes.The ordinate of Figure6 shows the average voltage of nodes in the actual distribution network, in volts. The abscissa is the network running time in hours. It can be seen that when the key length is 30 bits, AES encryption supported by CC2530 hardware has the longest duration, and the actual duration of IIBE encryption is about 83 hours, which is more than 10 hours shorter than AES encryption. However, considering that IIBE here sets up internode authentication every half hour, which is different from AES’s simple encryption and decryption operation, it can be considered that IIBE can meet the energy consumption requirements when the key length is 30 bits. Generally speaking, the energy consumption of IIBE algorithm is weaker than that of AES, but it can still last for a long time and basically meet the design goals.


### 4.3. Communication Performance Test

In the experiment, the data that can be effectively counted are the amount of data sent by WSN nodes and received by the server, so compared with the concept of packet loss rate, the concept of data reception rate can describe the actual experiment more accurately. The calculation method of data reception rate [33] is as follows:(1)Pr=∑i=0nnireceive∑i=0nnisend,where nireceive represents the number of data received by the server from ith node and b represents the number of data sent by ith node.On CC2530 WSN node, the data receiving rates of several methods with 30-bit key are tested, and about 40,000 experimental data are obtained. The statistical fitting curve of the results is shown in Figure7.Figure 7
Comparison of network reception rate.It can be seen from Figure7 that when the network scale increases, the trend of traffic not only depends on the algorithm itself but also is greatly affected by the network layout. The random distribution method adopted in the experiment makes some nodes close to the coordinator consume more energy and die faster, and the death of these nodes also affects the communication between other nodes and the coordinator. Because IIBE has a key exchange process in the initial stage, there is a large amount of communication in the initial stage. With the steady state of the network, the traffic volume of IIBE network is gradually stable. The algorithms such as DIOS and IBE, which have a large amount of communication, have a low reception rate, while the reception rate of IIBE and AES is higher than that of DIOS, so the reception rate of IIBE algorithm is basically acceptable.


## 4.1. Experimental Setup

In the experiment, the WSN node adopts CC2530 sensor network node of TI (Texas instruments) company [30], which has an enhanced C51 single chip microcomputer and 8k RAM storage space, and is powered by two No.5 batteries [31, 32]. WSN nodes are shown in Figure 4. The actual network topology of IIBE is shown in Figure 5. Settings of WSN network parameters are shown in Table 4.Figure 4
WSN node equipment used in experiment.Figure 5
Actual network topology of IIBE.Table 4
WSN network parameter setting.
Mesh areaTransmission frequencyInitial voltage (V)Network topologyLongest packet sent in a single time (bit)Arrangement modeKey length (bit)Dormancy1 km × 1 kmRandom (0–60 s)3.2Net structure120Random30NoTen CC2530 nodes are used for network deployment, and all IIBE nodes in WSN are not set to sleep. All collected data are stored in the MySql database on the server side. Then, it will be tested from three aspects: energy consumption, network communication capability, and security capability.


## 4.2. Energy Consumption Test

Firstly, the energy consumption of several encryption algorithms is tested. The IIBE algorithm performs node authentication every 30 minutes and key update every two hours in order to approach the actual network deployment situation as much as possible. A total of about 100,000 pieces of actual data were collected by the experimental WSN network, and the fitting curve obtained by sorting out is shown in Figure6.Figure 6
Average voltage trend of WSN nodes.The ordinate of Figure6 shows the average voltage of nodes in the actual distribution network, in volts. The abscissa is the network running time in hours. It can be seen that when the key length is 30 bits, AES encryption supported by CC2530 hardware has the longest duration, and the actual duration of IIBE encryption is about 83 hours, which is more than 10 hours shorter than AES encryption. However, considering that IIBE here sets up internode authentication every half hour, which is different from AES’s simple encryption and decryption operation, it can be considered that IIBE can meet the energy consumption requirements when the key length is 30 bits. Generally speaking, the energy consumption of IIBE algorithm is weaker than that of AES, but it can still last for a long time and basically meet the design goals.


## 4.3. Communication Performance Test

In the experiment, the data that can be effectively counted are the amount of data sent by WSN nodes and received by the server, so compared with the concept of packet loss rate, the concept of data reception rate can describe the actual experiment more accurately. The calculation method of data reception rate [33] is as follows:(1)Pr=∑i=0nnireceive∑i=0nnisend,where nireceive represents the number of data received by the server from ith node and b represents the number of data sent by ith node.On CC2530 WSN node, the data receiving rates of several methods with 30-bit key are tested, and about 40,000 experimental data are obtained. The statistical fitting curve of the results is shown in Figure7.Figure 7
Comparison of network reception rate.It can be seen from Figure7 that when the network scale increases, the trend of traffic not only depends on the algorithm itself but also is greatly affected by the network layout. The random distribution method adopted in the experiment makes some nodes close to the coordinator consume more energy and die faster, and the death of these nodes also affects the communication between other nodes and the coordinator. Because IIBE has a key exchange process in the initial stage, there is a large amount of communication in the initial stage. With the steady state of the network, the traffic volume of IIBE network is gradually stable. The algorithms such as DIOS and IBE, which have a large amount of communication, have a low reception rate, while the reception rate of IIBE and AES is higher than that of DIOS, so the reception rate of IIBE algorithm is basically acceptable.


## 5. Conclusion

Based on the encryption structure of traditional IBE algorithm, this paper proposes a scheme IIBE to solve the above key escrow and revocation problems. The design idea is as follows; the user’s private key in the system is divided into two parts: one part is controlled by PKG and the other part is controlled by users themselves. Compared with the traditional public key encryption, this algorithm does not need public key certificates and avoids the management of certificates. Compared with identity-based public key encryption, this algorithm solves the problems of key escrow and key revocation. The whole system test shows that compared with traditional encryption algorithm, the proposed IIBE algorithm has the characteristics of low energy consumption, high encryption strength, and strong authentication capability and is suitable for WSN deployment environment with high security requirements. In the future, the performance of IIBE encryption algorithm will be tested in a larger area of WSN network, and the security of various attacks will be analyzed.



---

*Source: 8527068-2021-09-20.xml*