1. IO-DSSE: Scaling Dynamic Searchable Encryption to Millions of Indexes By Improving Locality 2017 EncryptedDatabases NDSS SearchableEncryption
    Ian Miers and Payman Mohassel
    [View PDF on ndss-symposium.org]
    [Show BibTex Citation]

    @inproceedings{DBLP:conf/ndss/MiersM17,
    author = {Ian Miers and
    Payman Mohassel},
    title = {{IO-DSSE:} Scaling Dynamic Searchable Encryption to Millions of Indexes
    By Improving Locality},
    booktitle = {24th Annual Network and Distributed System Security Symposium, {NDSS}
    2017, San Diego, California, USA, February 26 - March 1, 2017},
    year = {2017},
    url = {https://www.ndss-symposium.org/ndss2017/ndss-2017-programme/io-dsse-scaling-dynamic-searchable-encryption-millions-indexes-improving-locality/},
    timestamp = {Tue, 16 Jan 2018 15:44:17 +0100},
    biburl = {https://dblp.org/rec/bib/conf/ndss/MiersM17},
    bibsource = {dblp computer science bibliography, https://dblp.org}
    }

Free cloud-based services are powerful candidates for deploying ubiquitous encryption for messaging. In the case of email and increasingly chat, users expect the ability to store and search their messages persistently. Using data from a major mail provider, we confirm that for a searchable encryption scheme to scale to millions of users, it should be highly IO-efficient (locality) and handle a very dynamic message corpi. We observe that existing solutions fail to achieve both properties simultaneously. We then design, build, and evaluate a provably secure Dynamic Searchable Symmetric Encryption (DSSE) scheme with significant reduction in IO cost compared to preceding works when used for email or other highly dynamic material.

  1.