1. SoK: Cryptographically Protected Database Search 2017 EncryptedDatabases Oakland SOK
    Benjamin Fuller, Mayank Varia, Arkady Yerukhimovich, Emily Shen, Ariel Hamlin, Vijay Gadepally, Richard Shay, John Darby Mitchell, and Robert K. Cunningham
    [View PDF on arxiv.org]
    [Show BibTex Citation]

    @article{Fuller_2017,
    title={SoK: Cryptographically Protected Database Search},
    ISBN={9781509055333},
    url={http://dx.doi.org/10.1109/SP.2017.10},
    DOI={10.1109/sp.2017.10},
    journal={2017 IEEE Symposium on Security and Privacy (SP)},
    publisher={IEEE},
    author={Fuller, Benjamin and Varia, Mayank and Yerukhimovich, Arkady and Shen, Emily and Hamlin, Ariel and Gadepally, Vijay and Shay, Richard and Mitchell, John Darby and Cunningham, Robert K.},
    year={2017},
    month={May}
    }

Protected database search systems cryptographically isolate the roles of reading from, writing to, and administering the database. This separation limits unnecessary administrator access and protects data in the case of system breaches. Since protected search was introduced in 2000, the area has grown rapidly; systems are offered by academia, start-ups, and established companies. However, there is no best protected search system or set of techniques. Design of such systems is a balancing act between security, functionality, performance, and usability. This challenge is made more difficult by ongoing database specialization, as some users will want the functionality of SQL, NoSQL, or NewSQL databases. This database evolution will continue, and the protected search community should be able to quickly provide functionality consistent with newly invented databases. At the same time, the community must accurately and clearly characterize the tradeoffs between different approaches. To address these challenges, we provide the following contributions:

  1. An identification of the important primitive operations across database paradigms. We find there are a small number of base operations that can be used and combined to support a large number of database paradigms.
  2. An evaluation of the current state of protected search systems in implementing these base operations. This evaluation describes the main approaches and tradeoffs for each base operation. Furthermore, it puts protected search in the context of unprotected search, identifying key gaps in functionality.
  3. An analysis of attacks against protected search for different base queries.
  4. A roadmap and tools for transforming a protected search system into a protected database, including an open-source performance evaluation platform and initial user opinions of protected search.
  1.