A Pairing-Based Certificateless Authenticated Searchable Encryption with MTI Guarantees

Mohammed Raouf Senouci*, Abdelkader Senouci, Fagen Li

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review


Nowadays, users prefer to encrypt their sensitive data before outsourcing it to the cloud. although, performing the encryption assures the data privacy, but it jeopardizes the search functionality. Public key encryption with keyword search (PEKS) is a potential solution for addressing this problem. However, most PEKS schemes are either inefficient, or susceptible to some type of attack(s) (i.e. inside keyword guessing attack, outside keyword guessing attack,..etc.). Therefore, we propose a sustainable certificateless authenticated encryption system with keyword search scheme. To the best of our knowledge, the proposed scheme considers the multi-trapdoor indistinguishability in the certificateless primitive. Moreover, a thorough security analysis shows that our scheme also guarantees the security against both online and offline keyword guessing attacks. Finally, based on the performance analysis results, we find that the suggested scheme is efficient and outperforms the other schemes.

Original languageEnglish
Title of host publicationFrontiers in Cyber Security - 6th International Conference, FCS 2023, Revised Selected Papers
EditorsHaomiao Yang, Rongxing Lu
Place of PublicationSingapore
Number of pages16
ISBN (Print)9789819993307
Publication statusPublished - 4 Jan 2024
Externally publishedYes
Event6th International Conference on Frontiers in Cyber Security, FCS 2023 - Chengdu, China
Duration: 21 Aug 202323 Aug 2023

Publication series

NameCommunications in Computer and Information Science
ISSN (Print)1865-0929
ISSN (Electronic)1865-0937


Conference6th International Conference on Frontiers in Cyber Security, FCS 2023

Cite this