Range Search over Encrypted Multi-Attribute Data

Summary: First systematic framework for multi-attribute range search on symmetrically encrypted outsourced DBs, adapting geometric structures (range trees, quadtrees) to operate on encrypted data with formal security guarantees. Six parallelizable schemes provide tunable efficiency–security tradeoffs and are validated via complexity/security analyses, a prototype, and experiments on real datasets. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID: 13314
Venue: VLDB
Year: 2023
Pagerank: 5.0670573e-05
Overall Rank: 6,424 | 55.32%
DOI: 10.14778/3574245.3574247

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 2 of 2 citing papers.

Rank	Citing Paper	Year	Venue	Pagerank
10,746	OasisDB: An Oblivious and Scalable System for Relational Data	2025	VLDB	4.1945683e-05
10,869	Towards Practical Oblivious Map	2025	VLDB	4.1945683e-05

Outgoing Citations (Sorted by Pagerank)

Showing 13 of 13 cited papers.

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

Rank	Cited Paper	Year	Venue	Pagerank
2	R-Trees: A Dynamic Index Structure For Spatial Searching	1984	SIGMOD	0.0032169493
6	The R*-tree: An Efficient and Robust Access Method for Points and Rectangles	1990	SIGMOD	0.0016162015
102	The Case for Learned Index Structures	2018	SIGMOD	0.00049545203
324	Order Preserving Encryption for Numeric Data	2004	SIGMOD	0.00027444645
1,460	Benchmarking Learned Indexes	2021	VLDB	0.00011887068
1,859	The Tao of Inference in Privacy-Protected Databases	2018	VLDB	0.0001029011
2,246	Parallel R-trees	1992	SIGMOD	9.2075292e-05
2,678	Effectively Learning Spatial Indices	2020	VLDB	8.3252088e-05
3,650	The Priority R-Tree: A Practically Efficient and Worst-Case Optimal R-Tree	2004	SIGMOD	6.8783391e-05
4,799	Practical Private Range Search Revisited	2016	SIGMOD	5.9119553e-05
5,278	A Comparative Evaluation of Order-Revealing Encryption Schemes and Secure Range-Query Protocols	2019	VLDB	5.5903398e-05
5,367	Fast Range Query Processing with Strong Privacy Protection for Cloud Computing	2014	VLDB	5.5457837e-05
7,054	Theoretically Optimal and Empirically Efficient R-trees with Strong Parallelizability	2018	VLDB	4.8496866e-05

Semantically Similar Papers

Overall Rank	Paper	Year	Venue	Pagerank
1,386	A Privacy-Preserving Index for Range Queries	2004	VLDB	0.00012261809
6,962	Efficient Secure Query Evaluation over Encrypted XML Databases	2006	VLDB	4.883323e-05
8,539	Efficient Searchable Encryption Through Compression	2018	VLDB	4.4937074e-05
5,278	A Comparative Evaluation of Order-Revealing Encryption Schemes and Secure Range-Query Protocols	2019	VLDB	5.5903398e-05
5,367	Fast Range Query Processing with Strong Privacy Protection for Cloud Computing	2014	VLDB	5.5457837e-05
8,537	Practical and Secure Substring Search	2018	SIGMOD	4.4937074e-05
8,297	Adaptive Indexing over Encrypted Numeric Data	2016	SIGMOD	4.5435639e-05
11,792	Fast Searchable Encryption With Tunable Locality	2017	SIGMOD	4.1945683e-05
10,312	A Workload-Aware Encrypted Index for Efficient Privacy-Preserving Range Queries	2026	VLDB	4.1945683e-05
4,799	Practical Private Range Search Revisited	2016	SIGMOD	5.9119553e-05