Dynamic Searchable Encryption in Very-Large Databases: Data Structures and Implementation
Rutgers, The State University of New Jersey · University of California, San Diego · +2 more institutions
Abstract
We design and implement dynamic symmetric searchable encryption schemes that efficiently and privately search server-held encrypted databases with tens of billions of record-keyword pairs.Our basic theoretical construction supports single-keyword searches and offers asymptotically optimal server index size, fully parallel searching, and minimal leakage.Our implementation effort brought to the fore several factors ignored by earlier coarse-grained theoretical performance analyses, including lowlevel space utilization, I/O parallelism and goodput.We accordingly introduce several optimizations to our theoretically optimal construction that model the prototype's characteristics designed to overcome these…
Citation impact
- FWCI
- 79.06
- Percentile
- 100%
- References
- 23
Authors
7Topics & keywords
- Computer science
- Encryption
- Database
- Information retrieval
- Computer security