Towards multi-user searchable encryption supporting boolean query and fast decryption

Yunling Wang, Jianfeng Wang, Shi-Feng Sun, Joseph K. Liu, Willy Susilo, Xiaofeng Chen

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

    Abstract

    The single-writer/multi-reader searchable encryption (SMSE) allows an arbitrary authorized user to submit a valid search token and get the corresponding encrypted identifiers. In order to achieve fine-grained access control, the identifiers are encrypted by the attribute-based encryption. In this case, the user can decrypt a ciphertext only when the access policy in it matches the user’s attribute set. However, the server unable to determine whether the user can decrypt a certain ciphertext without the knowledge of the user’s attribute set. As a result, all the ciphertexts based on a search token have to be returned to the user, which causes unnecessary communication and decryption costs. In this paper, we propose a new SMSE scheme, in which the server just needs to return the ones which can be decrypted by the user rather than the whole search results. In order to achieve this goal, we present a server-side match technique with which the server can test whether the user can decrypt a ciphertext without knowing the user’s attribute set. Furthermore, the decryption computation is very efficient, irrespective of the structure of access policy. Therefore, both the communication and decryption overheads are dramatically reduced in our scheme.

    Original languageEnglish
    Title of host publicationProvable Security
    Subtitle of host publication11th International Conference, ProvSec 2017, 2017, Xi'an, China, October 23-25, 2017
    EditorsTatsuaki Okamoto, Yong Yu, Man Ho Ao , Yannan Li
    Place of PublicationCham Switzerland
    PublisherSpringer
    Pages24-38
    Number of pages15
    Volume10592
    ISBN (Electronic)9783319686370
    ISBN (Print)9783319686363
    DOIs
    Publication statusPublished - 2017
    EventInternational Conference on Provable Security 2017 - Xi'an, China
    Duration: 23 Oct 201725 Oct 2017
    Conference number: 11th

    Publication series

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

    Conference

    ConferenceInternational Conference on Provable Security 2017
    Abbreviated titleProvSec 2017
    CountryChina
    CityXi'an
    Period23/10/1725/10/17

    Keywords

    • Cloud computing
    • Fast decryption
    • Multi-client
    • Searchable encryption

    Cite this

    Wang, Y., Wang, J., Sun, S-F., Liu, J. K., Susilo, W., & Chen, X. (2017). Towards multi-user searchable encryption supporting boolean query and fast decryption. In T. Okamoto, Y. Yu, M. H. Ao , & Y. Li (Eds.), Provable Security: 11th International Conference, ProvSec 2017, 2017, Xi'an, China, October 23-25, 2017 (Vol. 10592 , pp. 24-38). (Lecture Notes in Computer Science ; Vol. 10592 ). Cham Switzerland: Springer. https://doi.org/10.1007/978-3-319-68637-0_2
    Wang, Yunling ; Wang, Jianfeng ; Sun, Shi-Feng ; Liu, Joseph K. ; Susilo, Willy ; Chen, Xiaofeng. / Towards multi-user searchable encryption supporting boolean query and fast decryption. Provable Security: 11th International Conference, ProvSec 2017, 2017, Xi'an, China, October 23-25, 2017. editor / Tatsuaki Okamoto ; Yong Yu ; Man Ho Ao ; Yannan Li. Vol. 10592 Cham Switzerland : Springer, 2017. pp. 24-38 (Lecture Notes in Computer Science ).
    @inproceedings{ebc53512d16347ab8053efacf33a1ac4,
    title = "Towards multi-user searchable encryption supporting boolean query and fast decryption",
    abstract = "The single-writer/multi-reader searchable encryption (SMSE) allows an arbitrary authorized user to submit a valid search token and get the corresponding encrypted identifiers. In order to achieve fine-grained access control, the identifiers are encrypted by the attribute-based encryption. In this case, the user can decrypt a ciphertext only when the access policy in it matches the user’s attribute set. However, the server unable to determine whether the user can decrypt a certain ciphertext without the knowledge of the user’s attribute set. As a result, all the ciphertexts based on a search token have to be returned to the user, which causes unnecessary communication and decryption costs. In this paper, we propose a new SMSE scheme, in which the server just needs to return the ones which can be decrypted by the user rather than the whole search results. In order to achieve this goal, we present a server-side match technique with which the server can test whether the user can decrypt a ciphertext without knowing the user’s attribute set. Furthermore, the decryption computation is very efficient, irrespective of the structure of access policy. Therefore, both the communication and decryption overheads are dramatically reduced in our scheme.",
    keywords = "Cloud computing, Fast decryption, Multi-client, Searchable encryption",
    author = "Yunling Wang and Jianfeng Wang and Shi-Feng Sun and Liu, {Joseph K.} and Willy Susilo and Xiaofeng Chen",
    year = "2017",
    doi = "10.1007/978-3-319-68637-0_2",
    language = "English",
    isbn = "9783319686363",
    volume = "10592",
    series = "Lecture Notes in Computer Science",
    publisher = "Springer",
    pages = "24--38",
    editor = "Tatsuaki Okamoto and Yong Yu and {Ao }, {Man Ho} and Yannan Li",
    booktitle = "Provable Security",

    }

    Wang, Y, Wang, J, Sun, S-F, Liu, JK, Susilo, W & Chen, X 2017, Towards multi-user searchable encryption supporting boolean query and fast decryption. in T Okamoto, Y Yu, MH Ao & Y Li (eds), Provable Security: 11th International Conference, ProvSec 2017, 2017, Xi'an, China, October 23-25, 2017. vol. 10592 , Lecture Notes in Computer Science , vol. 10592 , Springer, Cham Switzerland, pp. 24-38, International Conference on Provable Security 2017, Xi'an, China, 23/10/17. https://doi.org/10.1007/978-3-319-68637-0_2

    Towards multi-user searchable encryption supporting boolean query and fast decryption. / Wang, Yunling; Wang, Jianfeng; Sun, Shi-Feng; Liu, Joseph K.; Susilo, Willy; Chen, Xiaofeng.

    Provable Security: 11th International Conference, ProvSec 2017, 2017, Xi'an, China, October 23-25, 2017. ed. / Tatsuaki Okamoto; Yong Yu; Man Ho Ao ; Yannan Li. Vol. 10592 Cham Switzerland : Springer, 2017. p. 24-38 (Lecture Notes in Computer Science ; Vol. 10592 ).

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

    TY - GEN

    T1 - Towards multi-user searchable encryption supporting boolean query and fast decryption

    AU - Wang, Yunling

    AU - Wang, Jianfeng

    AU - Sun, Shi-Feng

    AU - Liu, Joseph K.

    AU - Susilo, Willy

    AU - Chen, Xiaofeng

    PY - 2017

    Y1 - 2017

    N2 - The single-writer/multi-reader searchable encryption (SMSE) allows an arbitrary authorized user to submit a valid search token and get the corresponding encrypted identifiers. In order to achieve fine-grained access control, the identifiers are encrypted by the attribute-based encryption. In this case, the user can decrypt a ciphertext only when the access policy in it matches the user’s attribute set. However, the server unable to determine whether the user can decrypt a certain ciphertext without the knowledge of the user’s attribute set. As a result, all the ciphertexts based on a search token have to be returned to the user, which causes unnecessary communication and decryption costs. In this paper, we propose a new SMSE scheme, in which the server just needs to return the ones which can be decrypted by the user rather than the whole search results. In order to achieve this goal, we present a server-side match technique with which the server can test whether the user can decrypt a ciphertext without knowing the user’s attribute set. Furthermore, the decryption computation is very efficient, irrespective of the structure of access policy. Therefore, both the communication and decryption overheads are dramatically reduced in our scheme.

    AB - The single-writer/multi-reader searchable encryption (SMSE) allows an arbitrary authorized user to submit a valid search token and get the corresponding encrypted identifiers. In order to achieve fine-grained access control, the identifiers are encrypted by the attribute-based encryption. In this case, the user can decrypt a ciphertext only when the access policy in it matches the user’s attribute set. However, the server unable to determine whether the user can decrypt a certain ciphertext without the knowledge of the user’s attribute set. As a result, all the ciphertexts based on a search token have to be returned to the user, which causes unnecessary communication and decryption costs. In this paper, we propose a new SMSE scheme, in which the server just needs to return the ones which can be decrypted by the user rather than the whole search results. In order to achieve this goal, we present a server-side match technique with which the server can test whether the user can decrypt a ciphertext without knowing the user’s attribute set. Furthermore, the decryption computation is very efficient, irrespective of the structure of access policy. Therefore, both the communication and decryption overheads are dramatically reduced in our scheme.

    KW - Cloud computing

    KW - Fast decryption

    KW - Multi-client

    KW - Searchable encryption

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

    U2 - 10.1007/978-3-319-68637-0_2

    DO - 10.1007/978-3-319-68637-0_2

    M3 - Conference Paper

    SN - 9783319686363

    VL - 10592

    T3 - Lecture Notes in Computer Science

    SP - 24

    EP - 38

    BT - Provable Security

    A2 - Okamoto, Tatsuaki

    A2 - Yu, Yong

    A2 - Ao , Man Ho

    A2 - Li, Yannan

    PB - Springer

    CY - Cham Switzerland

    ER -

    Wang Y, Wang J, Sun S-F, Liu JK, Susilo W, Chen X. Towards multi-user searchable encryption supporting boolean query and fast decryption. In Okamoto T, Yu Y, Ao MH, Li Y, editors, Provable Security: 11th International Conference, ProvSec 2017, 2017, Xi'an, China, October 23-25, 2017. Vol. 10592 . Cham Switzerland: Springer. 2017. p. 24-38. (Lecture Notes in Computer Science ). https://doi.org/10.1007/978-3-319-68637-0_2