Multi-user cloud-based secure keyword search

Shabnam Kasra Kermanshahi, Joseph K. Liu, Ron Steinfeld

    Research output: Chapter in Book/Report/Conference proceedingConference PaperResearch

    Abstract

    We propose a multi-user Symmetric Searchable Encryption (SSE) scheme based on the single-user Oblivious Cross Tags (OXT) protocol (Cash et al., CRYPTO 2013). The scheme allows any user to perform a search query by interacting with the server and any θ−1 ‘helping’ users, and preserves the privacy of database content against the server even assuming leakage of up to θ − 1 users’ keys to the server (for a threshold parameter θ), while hiding the query from the θ − 1 ‘helping users’. To achieve the latter query privacy property, we design a new distributed key-homomorphic pseudorandom function (PRF) that hides the PRF input (search keyword) from the ‘helping’ key share holders. By distributing the utilized keys among the users, the need of constant online presence of the data owner to provide services to the users is eliminated, while providing resilience against user key exposure.

    Original languageEnglish
    Title of host publicationInformation Security and Privacy
    Subtitle of host publication22nd Australasian Conference, ACISP 2017, Auckland, New Zealand, July 3–5, 2017, Proceedings, Part I
    EditorsJosef Pieprzyk, Suriadi Suriadi
    Place of PublicationCham, Switzerland
    PublisherSpringer
    Pages227-247
    Number of pages21
    ISBN (Electronic)9783319600550
    ISBN (Print)9783319600543
    DOIs
    Publication statusPublished - 2017
    EventAustralasian Conference on Information Security and Privacy 2017 - Massey University, Auckland, New Zealand
    Duration: 3 Jul 20175 Jul 2017
    Conference number: 22
    http://acisp.massey.ac.nz/
    http://acisp.massey.ac.nz/

    Publication series

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

    Conference

    ConferenceAustralasian Conference on Information Security and Privacy 2017
    Abbreviated titleACISP 2017
    CountryNew Zealand
    CityAuckland
    Period3/07/175/07/17
    OtherThe 22nd Australasian Conference on Information Security and Privacy (ACISP) will be held in Auckland New Zealand on 3-5 July 2017, organised by Massey University in collaboration with other New Zealand universities. ACISP has been running annually since 1996. Now in its 22nd year, is an established key forum for international researchers and industry experts to present and discuss the latest research, trends, breakthroughs, and challenges in the domain of information security and privacy.
    Internet address

    Keywords

    • Cloud storage
    • Multi-user
    • Query privacy
    • Searchable encryption

    Cite this

    Kasra Kermanshahi, S., Liu, J. K., & Steinfeld, R. (2017). Multi-user cloud-based secure keyword search. In J. Pieprzyk, & S. Suriadi (Eds.), Information Security and Privacy: 22nd Australasian Conference, ACISP 2017, Auckland, New Zealand, July 3–5, 2017, Proceedings, Part I (pp. 227-247). (Lecture Notes in Computer Science ; Vol. 10342). Cham, Switzerland: Springer. https://doi.org/10.1007/978-3-319-60055-0_12
    Kasra Kermanshahi, Shabnam ; Liu, Joseph K. ; Steinfeld, Ron. / Multi-user cloud-based secure keyword search. Information Security and Privacy: 22nd Australasian Conference, ACISP 2017, Auckland, New Zealand, July 3–5, 2017, Proceedings, Part I. editor / Josef Pieprzyk ; Suriadi Suriadi. Cham, Switzerland : Springer, 2017. pp. 227-247 (Lecture Notes in Computer Science ).
    @inproceedings{f1d5ce04b51a4ba2953b45f554850daf,
    title = "Multi-user cloud-based secure keyword search",
    abstract = "We propose a multi-user Symmetric Searchable Encryption (SSE) scheme based on the single-user Oblivious Cross Tags (OXT) protocol (Cash et al., CRYPTO 2013). The scheme allows any user to perform a search query by interacting with the server and any θ−1 ‘helping’ users, and preserves the privacy of database content against the server even assuming leakage of up to θ − 1 users’ keys to the server (for a threshold parameter θ), while hiding the query from the θ − 1 ‘helping users’. To achieve the latter query privacy property, we design a new distributed key-homomorphic pseudorandom function (PRF) that hides the PRF input (search keyword) from the ‘helping’ key share holders. By distributing the utilized keys among the users, the need of constant online presence of the data owner to provide services to the users is eliminated, while providing resilience against user key exposure.",
    keywords = "Cloud storage, Multi-user, Query privacy, Searchable encryption",
    author = "{Kasra Kermanshahi}, Shabnam and Liu, {Joseph K.} and Ron Steinfeld",
    year = "2017",
    doi = "10.1007/978-3-319-60055-0_12",
    language = "English",
    isbn = "9783319600543",
    series = "Lecture Notes in Computer Science",
    publisher = "Springer",
    pages = "227--247",
    editor = "Josef Pieprzyk and Suriadi, {Suriadi }",
    booktitle = "Information Security and Privacy",

    }

    Kasra Kermanshahi, S, Liu, JK & Steinfeld, R 2017, Multi-user cloud-based secure keyword search. in J Pieprzyk & S Suriadi (eds), Information Security and Privacy: 22nd Australasian Conference, ACISP 2017, Auckland, New Zealand, July 3–5, 2017, Proceedings, Part I. Lecture Notes in Computer Science , vol. 10342, Springer, Cham, Switzerland, pp. 227-247, Australasian Conference on Information Security and Privacy 2017, Auckland, New Zealand, 3/07/17. https://doi.org/10.1007/978-3-319-60055-0_12

    Multi-user cloud-based secure keyword search. / Kasra Kermanshahi, Shabnam; Liu, Joseph K.; Steinfeld, Ron.

    Information Security and Privacy: 22nd Australasian Conference, ACISP 2017, Auckland, New Zealand, July 3–5, 2017, Proceedings, Part I. ed. / Josef Pieprzyk; Suriadi Suriadi. Cham, Switzerland : Springer, 2017. p. 227-247 (Lecture Notes in Computer Science ; Vol. 10342).

    Research output: Chapter in Book/Report/Conference proceedingConference PaperResearch

    TY - GEN

    T1 - Multi-user cloud-based secure keyword search

    AU - Kasra Kermanshahi, Shabnam

    AU - Liu, Joseph K.

    AU - Steinfeld, Ron

    PY - 2017

    Y1 - 2017

    N2 - We propose a multi-user Symmetric Searchable Encryption (SSE) scheme based on the single-user Oblivious Cross Tags (OXT) protocol (Cash et al., CRYPTO 2013). The scheme allows any user to perform a search query by interacting with the server and any θ−1 ‘helping’ users, and preserves the privacy of database content against the server even assuming leakage of up to θ − 1 users’ keys to the server (for a threshold parameter θ), while hiding the query from the θ − 1 ‘helping users’. To achieve the latter query privacy property, we design a new distributed key-homomorphic pseudorandom function (PRF) that hides the PRF input (search keyword) from the ‘helping’ key share holders. By distributing the utilized keys among the users, the need of constant online presence of the data owner to provide services to the users is eliminated, while providing resilience against user key exposure.

    AB - We propose a multi-user Symmetric Searchable Encryption (SSE) scheme based on the single-user Oblivious Cross Tags (OXT) protocol (Cash et al., CRYPTO 2013). The scheme allows any user to perform a search query by interacting with the server and any θ−1 ‘helping’ users, and preserves the privacy of database content against the server even assuming leakage of up to θ − 1 users’ keys to the server (for a threshold parameter θ), while hiding the query from the θ − 1 ‘helping users’. To achieve the latter query privacy property, we design a new distributed key-homomorphic pseudorandom function (PRF) that hides the PRF input (search keyword) from the ‘helping’ key share holders. By distributing the utilized keys among the users, the need of constant online presence of the data owner to provide services to the users is eliminated, while providing resilience against user key exposure.

    KW - Cloud storage

    KW - Multi-user

    KW - Query privacy

    KW - Searchable encryption

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

    U2 - 10.1007/978-3-319-60055-0_12

    DO - 10.1007/978-3-319-60055-0_12

    M3 - Conference Paper

    SN - 9783319600543

    T3 - Lecture Notes in Computer Science

    SP - 227

    EP - 247

    BT - Information Security and Privacy

    A2 - Pieprzyk, Josef

    A2 - Suriadi, Suriadi

    PB - Springer

    CY - Cham, Switzerland

    ER -

    Kasra Kermanshahi S, Liu JK, Steinfeld R. Multi-user cloud-based secure keyword search. In Pieprzyk J, Suriadi S, editors, Information Security and Privacy: 22nd Australasian Conference, ACISP 2017, Auckland, New Zealand, July 3–5, 2017, Proceedings, Part I. Cham, Switzerland: Springer. 2017. p. 227-247. (Lecture Notes in Computer Science ). https://doi.org/10.1007/978-3-319-60055-0_12