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

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

    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 PublicationSwitzerland
    PublisherSpringer
    Pages154-172
    Number of pages19
    ISBN (Electronic)9783319457444
    ISBN (Print)9783319457437
    DOIs
    Publication statusPublished - 15 Sep 2016
    EventEuropean Symposium On Research In Computer Security 2016 - Heraklion, Greece
    Duration: 26 Sep 201630 Sep 2016
    Conference number: 21st

    Publication series

    NameLecture Notes in Computer Science
    Volume9878
    ISSN (Print)0302-9743
    ISSN (Electronic)1611-3349

    Conference

    ConferenceEuropean Symposium On Research In Computer Security 2016
    Abbreviated titleESORICS 2016
    CountryGreece
    CityHeraklion
    Period26/09/1630/09/16

    Keywords

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

    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 (pp. 154-172). (Lecture Notes in Computer Science ; Vol. 9878 ). Switzerland: Springer. https://doi.org/10.1007/978-3-319-45744-4_8
    Sun, Shi-Feng ; Liu, Joseph K. ; Sakzad, Amin ; Steinfeld, Ron ; Yuen, Tsz Hon. / 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. Switzerland : Springer, 2016. pp. 154-172 (Lecture Notes in Computer Science ).
    @inproceedings{6a01218fbe3f4776b9bc8ec2a109d43b,
    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 ‘keyword to prime’ hash function, which may be of independent interest.",
    keywords = "Cloud storage, Searchable encryption, Non-interaction, Multi-client, RSA function",
    author = "Shi-Feng Sun and Liu, {Joseph K.} and Amin Sakzad and Ron Steinfeld and Yuen, {Tsz Hon}",
    year = "2016",
    month = "9",
    day = "15",
    doi = "10.1007/978-3-319-45744-4_8",
    language = "English",
    isbn = "9783319457437",
    series = "Lecture Notes in Computer Science",
    publisher = "Springer",
    pages = "154--172",
    editor = "Ioannis Askoxylakis and Sotiris Ioannidis and Sokratis Katsikas and Catherine Meadows",
    booktitle = "Computer Security - ESORICS 2016",

    }

    Sun, S-F, 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. Lecture Notes in Computer Science , vol. 9878 , Springer, Switzerland, pp. 154-172, European Symposium On Research In Computer Security 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; Steinfeld, Ron; Yuen, Tsz Hon.

    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. Switzerland : Springer, 2016. p. 154-172 (Lecture Notes in Computer Science ; Vol. 9878 ).

    Research output: Chapter in Book/Report/Conference proceedingConference PaperResearchpeer-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/9/15

    Y1 - 2016/9/15

    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 - Searchable encryption

    KW - Non-interaction

    KW - Multi-client

    KW - RSA function

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

    UR - http://link.springer.com/book/10.1007/978-3-319-45744-4

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

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

    M3 - Conference Paper

    SN - 9783319457437

    T3 - Lecture Notes in Computer Science

    SP - 154

    EP - 172

    BT - Computer Security - ESORICS 2016

    A2 - Askoxylakis, Ioannis

    A2 - Ioannidis, Sotiris

    A2 - Katsikas, Sokratis

    A2 - Meadows, Catherine

    PB - Springer

    CY - Switzerland

    ER -

    Sun S-F, 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. Switzerland: Springer. 2016. p. 154-172. (Lecture Notes in Computer Science ). https://doi.org/10.1007/978-3-319-45744-4_8