Dynamic Searchable Encryption in Very-Large Databases: Data Structures and Implementation
No ratings
Presented at NDSS 2014 by
This paper give constructions of symmetric searchable encryption with scalable performance, enabling private searching on server-held encrypted databases with tens of billions of record/keyword pairs. Our constructions are asymptotically optimal in several respects including index size and full parallelism during searching, and also demonstrate practical efficiency in our implementation.