Scalable Distributed Encrypted Search

Proofpoint, Inc. Mathematics, 2014-15

Liaison(s): Anand Somani, Amir Harush
Advisor(s): Andrew Bernoff
Students(s): Nathan Hall (PM), Nicole Wein, Teo Asinari, Xiuyuan Lu

As cloud storage becomes more prevalent, greater demands for security and accessibility are placed on searchable databases. The goal of our project is to develop a scalable, efficient strategy for searching distributed, encrypted databases. Popular existing approaches were not designed with encryption in mind, leading to prohibitive overhead. We provide a proof of concept (via a well-documented API) of a sublinear encrypted search architecture by implementing and benchmarking our solution.