An efficient secure channel free searchable encryption scheme with multiple keywords

Tingting Wang, Man Ho Allen Au, Wei Wu

Research output: Chapter in book / Conference proceedingConference article published in proceeding or bookAcademic researchpeer-review

13 Citations (Scopus)


Pubilc Key Encrytion with Keyword Search (PEKS) scheme allows users to search encrypted messages by using a particular keyword without leaking any information. Practically, users might need to relate multiple keywords to one message. To effectively encrypt multiple keywords, Baek et al. first presented a PEKS scheme with multiple keywords (MPEKS). In this paper, we come up with a new efficient secure channel free PEKS scheme with multiple keywords named SCF-MPEKS. We give formal definitions and a concrete construction of SCF-MPEKS. The proposed SCF-MPEKS scheme is secure in the presented models of indistinguishability for SCF-MPEKS. Our scheme removes the secure channel assumption between the server and the receiver, which has much better performance in terms of both computational and communication overhead than Baek et al.’s MPEKS scheme for building a secure channel is very costly.
Original languageEnglish
Title of host publicationNetwork and System Security - 10th International Conference, NSS 2016, Proceedings
PublisherSpringer Verlag
Number of pages15
ISBN (Print)9783319462974
Publication statusPublished - 1 Jan 2016
Event10th International Conference on Network and System Security, NSS 2016 - Taipei, Taiwan
Duration: 28 Sep 201630 Sep 2016

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume9955 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Conference10th International Conference on Network and System Security, NSS 2016


  • Multiple
  • Pubilc key encrytion
  • Search
  • Secure channel free

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Cite this