History-Independent Dynamic Partitioning: Achieving Operation-Order Privacy in Ordered Data Structures
Summary: History-independent dynamic partitioning for ordered sets S achieved, enabling operation-order privacy with groups of size Theta(B) in partition-based indexes. Against an oblivious adversary, inserts/deletes run in O(1) expected time; high-probability bound is O(B log N / log log N). (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
No non-self incoming citations found for this paper in this database.
Authors
- 1. Michael A. Bender (RelationalAI; State University of New York at Stony Brook)
- 2. Martín Farach-Colton (New York University)
- 3. Michael T. Goodrich (University of California Irvine)
- 4. Hanna Komlós (New York University)
BibTeX Citation
@inproceedings{bender_pods24,
address = {New York, NY, USA},
series = {{PODS} '24},
title = {{History-Independent Dynamic Partitioning: Achieving Operation-Order Privacy in Ordered Data Structures}},
url = {https://dl.acm.org/doi/10.1145/3651609},
doi = {10.1145/3651609},
booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
publisher = {Association for Computing Machinery},
author = {Bender, Michael A. and Farach-Colton, Martín and Goodrich, Michael T. and Komlós, Hanna},
year = {2024}
}Incoming Citations (Sorted by Pagerank)
Showing 0 of 0 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|
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 |
|---|---|---|---|---|
| 1,112 | Cache-Oblivious String B-trees | 2006 | PODS | 0.00012125766 |
| 2,843 | Rose: Compressed, log-structured replication | 2008 | VLDB | 8.0617003e-05 |
| 12,025 | Anti-Persistence on Persistent Storage: History-Independent Sparse Tables and Dictionaries | 2016 | PODS | 5.093636e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 1,310 | A Privacy-Preserving Index for Range Queries | 2004 | VLDB |
| 2 | 10,824 | Efficient Concurrent Updates to Persistent Randomized Binary Search Trees | 2025 | VLDB |
| 3 | 8,937 | Dynamic Indexability and Lower Bounds for Dynamic One-Dimensional Range Query Indexes | 2009 | PODS |
| 4 | 5,102 | Fast Range Query Processing with Strong Privacy Protection for Cloud Computing | 2014 | VLDB |
| 5 | 11,632 | Data-Independent Space Partitionings for Summaries | 2021 | PODS |
| 6 | 6,793 | What Storage Access Privacy is Achievable with Small Overhead? | 2019 | PODS |
| 7 | 2,992 | Pan-private Algorithms Via Statistics on Sketches | 2011 | PODS |
| 8 | 10,642 | Differentially Private Substring and Document Counting | 2025 | PODS |
| 9 | 4,914 | A General Solution of the n-dimensional B-tree Problem | 1995 | SIGMOD |
| 10 | 12,025 | Anti-Persistence on Persistent Storage: History-Independent Sparse Tables and Dictionaries | 2016 | PODS |