Gilad Asharov, Moni Naor, Gil Segev, Ido Shahaf. Searchable symmetric encryption: optimal locality in linear space via two-dimensional balanced allocations. In Daniel Wichs, Yishay Mansour, editors, Proceedings of the 48th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2016, Cambridge, MA, USA, June 18-21, 2016. pages 1101-1114, ACM, 2016. [doi]
@inproceedings{AsharovNSS16-0, title = {Searchable symmetric encryption: optimal locality in linear space via two-dimensional balanced allocations}, author = {Gilad Asharov and Moni Naor and Gil Segev and Ido Shahaf}, year = {2016}, doi = {10.1145/2897518.2897562}, url = {http://doi.acm.org/10.1145/2897518.2897562}, researchr = {https://researchr.org/publication/AsharovNSS16-0}, cites = {0}, citedby = {0}, pages = {1101-1114}, booktitle = {Proceedings of the 48th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2016, Cambridge, MA, USA, June 18-21, 2016}, editor = {Daniel Wichs and Yishay Mansour}, publisher = {ACM}, isbn = {978-1-4503-4132-5}, }