Database Paper Browser

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
5433
Venue
SIGMOD
Year
2017
Pagerank
4.1945683e-05
Overall Rank
11,792 | 17.97%
DOI
10.1145/3035918.3064057

Incoming Non-self Citations Over Time

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

Authors

Incoming Citations (Sorted by Pagerank)

Showing 2 of 2 citing papers.

Rank Citing Paper Year Venue Pagerank
5,851 GraphOS: Towards Oblivious Graph Processing 2023 VLDB 5.300937e-05
8,539 Efficient Searchable Encryption Through Compression 2018 VLDB 4.4937074e-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
310 The Vertica Analytic Database: C-Store 7 Years Later 2012 VLDB 0.00028132402
459 Processing Analytical Queries over Encrypted Data 2013 VLDB 0.00022627746
4,799 Practical Private Range Search Revisited 2016 SIGMOD 5.9119553e-05
Previous Page 1 / 1 Next

Semantically Similar Papers