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

    7 Citations (Scopus)


    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
    Number of pages15
    ISBN (Electronic)9783319686370
    ISBN (Print)9783319686363
    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
    ISSN (Print)0302-9743
    ISSN (Electronic)1611-3349


    ConferenceInternational Conference on Provable Security 2017
    Abbreviated titleProvSec 2017
    Internet address


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

    Cite this