An efficient non-interactive multi-client searchable encryption with support for boolean queries

Shi Feng Sun, Joseph K. Liu*, Amin Sakzad, Ron Steinfeld, Tsz Hon Yuen

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference proceeding contribution

44 Citations (Scopus)

Abstract

Motivated by the recent searchable symmetric encryption protocol of Cash et al., we propose a new multi-client searchable encryption protocol in this work. By tactfully leveraging the RSA-function, our protocol avoids the per-query interaction between the data owner and the client, thus reducing the communication overhead significantly and eliminating the need of the data owner to provide the online services to clients at all times. Furthermore, our protocol manages to protect the query privacy of clients to some extent, meaning that our protocol hides the exact queries from the data owner. In terms of the leakage to server, it is exactly the same as Cash et al., thus achieving the same security against the adversarial server. In addition, by employing attribute-based encryption technique, our protocol also realizes the fine-grained access control on the stored data. To be compatible with our RSA-based approach, we also present a deterministic and memory-efficient ‘keyword to prime’ hash function, which may be of independent interest.

Original languageEnglish
Title of host publicationComputer Security – ESORICS 2016
Subtitle of host publication21st European Symposium on Research in Computer Security, Heraklion, Greece, September 26-30, 2016, Proceedings, Part I
EditorsIoannis Askoxylakis, Sotiris Ioannidis, Sokratis Katsikas, Catherine Meadows
Place of PublicationCham
PublisherSpringer, Springer Nature
Pages154-172
Number of pages19
Volume9878 LNCS
ISBN (Electronic)9783319457444
ISBN (Print)9783319457437
DOIs
Publication statusPublished - 2016
Externally publishedYes
Event21st European Symposium on Research in Computer Security, ESORICS 2016 - Heraklion, Greece
Duration: 26 Sep 201630 Sep 2016

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume9878 LNCS
ISSN (Print)03029743
ISSN (Electronic)16113349

Other

Other21st European Symposium on Research in Computer Security, ESORICS 2016
CountryGreece
CityHeraklion
Period26/09/1630/09/16

Keywords

  • Cloud storage
  • Multi-client
  • Non-interaction
  • RSA function
  • Searchable encryption

Fingerprint Dive into the research topics of 'An efficient non-interactive multi-client searchable encryption with support for boolean queries'. Together they form a unique fingerprint.

  • Cite this

    Sun, S. F., Liu, J. K., Sakzad, A., Steinfeld, R., & Yuen, T. H. (2016). An efficient non-interactive multi-client searchable encryption with support for boolean queries. In I. Askoxylakis, S. Ioannidis, S. Katsikas, & C. Meadows (Eds.), Computer Security – ESORICS 2016: 21st European Symposium on Research in Computer Security, Heraklion, Greece, September 26-30, 2016, Proceedings, Part I (Vol. 9878 LNCS, pp. 154-172). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 9878 LNCS). Cham: Springer, Springer Nature. https://doi.org/10.1007/978-3-319-45744-4_8