4.2 Article

An efficient certificateless public key cryptography with authorized equality test in IIoT

Journal

Publisher

SPRINGER HEIDELBERG
DOI: 10.1007/s12652-019-01365-4

Keywords

Industrial Internet of Things (IIoT); Cloud; Certificatless public key cryptography with equality test; Authorization

Funding

  1. 13th FiveYear Plan of National Cryptography Development Fund for Cryptographic Theory of China [MMJJ20170204]
  2. Fundamental Research Funds for the Central Universities [ZYGX2016J091]
  3. Guangxi Colleges and Universities Key Laboratory of Cloud Computing and Complex Systems
  4. Natural Science Foundation of China [U1401257, 61472064, 61602096]

Ask authors/readers for more resources

Current time organizations have moved from the conventional industries to smart industries by embracing the approach of Industrial Internet of Things (IIoT), which has provided an avenue for the integration of smart devices and communication technologies. IIoT offers reduction of costs on services and technologies since it counts on the flexibility, availability and real-time data processing capabilities of the cloud server. And even with the untrusted nature of the cloud, the privacy and confidentiality of the data outsourced to the cloud has been able to be guaranteed. This has been achieved through encryption techniques apply to the data before outsourcing. This has made it feasible to have the data in the cloud secured. However, the limitation of data recovery due to it having the innate all-or-nothing decryption characteristic, results in a challenge in the search functionality for the encrypted data. In order to deal with this challenge, this paper nominates a Certificateless Public Key Cryptography with Authorized Equivalent Test (CL-PKC-AET). Whereby, a cloud server is given authority to actuate if two encryptions consist of the equivalent messages. Furthermore, the extra providence of a fine-grained testing capability to the cloud server makes the CL-PKC-AET scheme adaptable. We define our scheme basing on bilinear pairing and further advocate within the random oracle model its security, based on the Bilinear Diffie-Hellman assumption. Basing on comparison with existing work, our scheme proves to be more effective.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.2
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available