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

doi:10.1007/978-3-319-45744-4_8

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 proceeding › Conference proceeding contribution › peer-review

115 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 language	English
Title of host publication	Computer Security – ESORICS 2016
Subtitle of host publication	21st European Symposium on Research in Computer Security, Heraklion, Greece, September 26-30, 2016, Proceedings, Part I
Editors	Ioannis Askoxylakis, Sotiris Ioannidis, Sokratis Katsikas, Catherine Meadows
Place of Publication	Cham
Publisher	Springer, Springer Nature
Pages	154-172
Number of pages	19
Volume	9878 LNCS
ISBN (Electronic)	9783319457444
ISBN (Print)	9783319457437
DOIs	https://doi.org/10.1007/978-3-319-45744-4_8
Publication status	Published - 2016
Externally published	Yes
Event	21st European Symposium on Research in Computer Security, ESORICS 2016 - Heraklion, Greece Duration: 26 Sept 2016 → 30 Sept 2016

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	9878 LNCS
ISSN (Print)	03029743
ISSN (Electronic)	16113349

Other

Other	21st European Symposium on Research in Computer Security, ESORICS 2016
Country/Territory	Greece
City	Heraklion
Period	26/09/16 → 30/09/16

Keywords

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

Access to Document

10.1007/978-3-319-45744-4_8

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). Springer, Springer Nature. https://doi.org/10.1007/978-3-319-45744-4_8

Sun, Shi Feng ; Liu, Joseph K. ; Sakzad, Amin et al. / An efficient non-interactive multi-client searchable encryption with support for boolean queries. Computer Security – ESORICS 2016: 21st European Symposium on Research in Computer Security, Heraklion, Greece, September 26-30, 2016, Proceedings, Part I. editor / Ioannis Askoxylakis ; Sotiris Ioannidis ; Sokratis Katsikas ; Catherine Meadows. Vol. 9878 LNCS Cham : Springer, Springer Nature, 2016. pp. 154-172 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{7cd7ab49a0184f848d990199fea804ab,

title = "An efficient non-interactive multi-client searchable encryption with support for boolean queries",

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 {\textquoteleft}keyword to prime{\textquoteright} hash function, which may be of independent interest.",

keywords = "Cloud storage, Multi-client, Non-interaction, RSA function, Searchable encryption",

author = "Sun, {Shi Feng} and Liu, {Joseph K.} and Amin Sakzad and Ron Steinfeld and Yuen, {Tsz Hon}",

year = "2016",

doi = "10.1007/978-3-319-45744-4_8",

language = "English",

isbn = "9783319457437",

volume = "9878 LNCS",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer, Springer Nature",

pages = "154--172",

editor = "Ioannis Askoxylakis and Sotiris Ioannidis and Sokratis Katsikas and Catherine Meadows",

booktitle = "Computer Security – ESORICS 2016",

address = "United States",

note = "21st European Symposium on Research in Computer Security, ESORICS 2016 ; Conference date: 26-09-2016 Through 30-09-2016",

}

Sun, SF, Liu, JK, Sakzad, A, Steinfeld, R & Yuen, TH 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, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 9878 LNCS, Springer, Springer Nature, Cham, pp. 154-172, 21st European Symposium on Research in Computer Security, ESORICS 2016, Heraklion, Greece, 26/09/16. https://doi.org/10.1007/978-3-319-45744-4_8

An efficient non-interactive multi-client searchable encryption with support for boolean queries. / Sun, Shi Feng; Liu, Joseph K.; Sakzad, Amin et al.
Computer Security – ESORICS 2016: 21st European Symposium on Research in Computer Security, Heraklion, Greece, September 26-30, 2016, Proceedings, Part I. ed. / Ioannis Askoxylakis; Sotiris Ioannidis; Sokratis Katsikas; Catherine Meadows. Vol. 9878 LNCS Cham: Springer, Springer Nature, 2016. p. 154-172 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 9878 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference proceeding contribution › peer-review

TY - GEN

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

AU - Sun, Shi Feng

AU - Liu, Joseph K.

AU - Sakzad, Amin

AU - Steinfeld, Ron

AU - Yuen, Tsz Hon

PY - 2016

Y1 - 2016

N2 - 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.

AB - 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.

KW - Cloud storage

KW - Multi-client

KW - Non-interaction

KW - RSA function

KW - Searchable encryption

UR - http://www.scopus.com/inward/record.url?scp=84990032713&partnerID=8YFLogxK

U2 - 10.1007/978-3-319-45744-4_8

DO - 10.1007/978-3-319-45744-4_8

M3 - Conference proceeding contribution

AN - SCOPUS:84990032713

SN - 9783319457437

VL - 9878 LNCS

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 154

EP - 172

BT - Computer Security – ESORICS 2016

A2 - Askoxylakis, Ioannis

A2 - Ioannidis, Sotiris

A2 - Katsikas, Sokratis

A2 - Meadows, Catherine

PB - Springer, Springer Nature

CY - Cham

T2 - 21st European Symposium on Research in Computer Security, ESORICS 2016

Y2 - 26 September 2016 through 30 September 2016

ER -

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

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

Abstract

Publication series

Other

Keywords

Access to Document

Other files and links

Fingerprint

Cite this