DBScholar

Back to papers

Fast Searchable Encryption With Tunable Locality

Summary: First SE scheme with tunable locality and linear space; achieves optimal locality and up to 2.5 orders of magnitude faster read efficiency than prior work. Provides bounded-locality variants with the same leakage, enabling up to 60× faster end-to-end search and flexible space/read/locality/parallelism/communication trade-offs. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
5495
Venue
SIGMOD
Year
2017
Pagerank
5.093636e-05
Overall Rank
11,996 | 17.70%
DOI
10.1145/3035918.3064057

Incoming Non-self Citations Over Time

No non-self incoming citations found for this paper in this database.

Authors

BibTeX Citation

@inproceedings{demertzis_sigmod17,
        title = {{Fast Searchable Encryption With Tunable Locality}},
        author = {Demertzis, Ioannis and Papamanthou, Charalampos},
        series = {{SIGMOD} '17},
        booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
        publisher = {Association for Computing Machinery},
        doi = {10.1145/3035918.3064057},
        url = {https://dl.acm.org/doi/10.1145/3035918.3064057},
        year = {2017}
}

Incoming Citations (Sorted by Pagerank)

Showing 2 of 2 citing papers.

Rank Citing Paper Year Venue Pagerank
5,299 GraphOS: Towards Oblivious Graph Processing 2023 VLDB 6.2767341e-05
6,797 Efficient Searchable Encryption Through Compression 2018 VLDB 5.7707661e-05
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 3 of 3 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Rank Cited Paper Year Venue Pagerank
186 The Vertica Analytic Database: C-Store 7 Years Later 2012 VLDB 0.00026182534
412 Processing Analytical Queries over Encrypted Data 2013 VLDB 0.00018901853
4,625 Practical Private Range Search Revisited 2016 SIGMOD 6.5989597e-05
Previous Page 1 / 1 Next

Semantically Similar Papers