A provably secure free-pairing certificateless searchable encryption scheme

Mohammed Raouf Senouci (), Ilyas Benkhaddra (), Abdelkader Senouci () and Fagen Li ()
Additional contact information
Mohammed Raouf Senouci: University of Electronic Science and Technology of China
Ilyas Benkhaddra: University of Electronic Science and Technology of China
Abdelkader Senouci: Northumbria University
Fagen Li: University of Electronic Science and Technology of China

Telecommunication Systems: Modelling, Analysis, Design and Management, 2022, vol. 80, issue 3, No 6, 383-395

Abstract: Abstract The protection of user data and privacy is becoming more critical because they mainly come from different sources, such as the Internet of Things. The searchable encryption (SE) primitive is a potential candidate who can guarantee data privacy while maintaining the search capability. The majority of known SE methods rely on the bilinear pairing operation, which is an expensive operation compared to other cryptographic operations. Therefore, bilinear-based SE may not be suitable for deployment on constraint devices with limited processing power. In addition, most of the schemes presented in the literature were vulnerable to different types of attacks, such as keyword guessing attacks. We tackle these issues by presenting a pairing-free public key encryption with keyword search and does not require a secure channel. The proposed scheme is proven in the random oracle model to be secure against various keyword guessing attacks, based on the hardness of solving the discrete logarithm and the computational Diffie–Hellman problems. These results are concluded by thoroughly analyzing the proposed scheme and five other state-of-the-art schemes recently presented in the literature. Finally, based of the performance analysis, where the experiments are conducted using three different sets of parameters for the elliptic curve, combined with three hash functions that were advised by NIST to satisfy the different security requirements, we observe that the proposed scheme does not require much communication costs and is somewhat fast in executing the different algorithms. Moreover, the proposed scheme guarantees the security requirements and makes it semantically ciphertext-indistinguishability, trapdoor-indistinguishability secure, and resilient to online and offline keyword guessing attacks.

Keywords: Certificateless; Searchable encryption; Bilinear pairing; Keyword guessing attack; Constraint devices (search for similar items in EconPapers)
Date: 2022
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s11235-022-00912-3 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:telsys:v:80:y:2022:i:3:d:10.1007_s11235-022-00912-3

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/11235

DOI: 10.1007/s11235-022-00912-3

Access Statistics for this article

Telecommunication Systems: Modelling, Analysis, Design and Management is currently edited by Muhammad Khan

More articles in Telecommunication Systems: Modelling, Analysis, Design and Management from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().