1. Efficient No-dictionary Verifiable SSE 2017 FinancialCryptography SearchableEncryption
    Wakaha Ogata, Kaoru Kurosawa
    [View PDF on fc17.ifca.ai]
    [Show BibTex Citation]

    @inproceedings{DBLP:conf/fc/OgataK17,
    author = {Wakaha Ogata and
    Kaoru Kurosawa},
    editor = {Aggelos Kiayias},
    title = {Efficient No-dictionary Verifiable Searchable Symmetric Encryption},
    booktitle = {Financial Cryptography and Data Security - 21st International Conference,
    {FC} 2017, Sliema, Malta, April 3-7, 2017, Revised Selected Papers},
    series = {Lecture Notes in Computer Science},
    volume = {10322},
    pages = {498--516},
    publisher = {Springer},
    year = {2017},
    url = {https://doi.org/10.1007/978-3-319-70972-7\_28},
    doi = {10.1007/978-3-319-70972-7\_28},
    timestamp = {Tue, 14 May 2019 10:00:38 +0200},
    biburl = {https://dblp.org/rec/bib/conf/fc/OgataK17},
    bibsource = {dblp computer science bibliography, https://dblp.org}
    }

In the model of “no-dictionary” verifiable searchable symmetric encryption (SSE) scheme, a client does not need to keep the set of keywords W in the search phase, where W is called a dictionary. Still a malicious server cannot cheat the client by saying that ``your search word w does not exist in the dictionary W” when it exists. In the previous such schemes, it takes O(logm) time for the server to prove that w∉W, where m=|W| is the number of keywords. In this paper, we show a generic method to transform any SSE scheme (that is only secure against passive adversaries) to a no-dictionary verifiable SSE scheme. In the transformed scheme, it takes only O(1) time for the server to prove that w∉W.

  1.