Strongly History-Independent Storage Allocation: New Upper and Lower Bounds

Kuszmaul, William

doi:10.1109/focs57990.2023.00111

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2023

2024

Publication Types

Select...

Other1

Article1

Relationship

Self Cite0

Independent2

Authors

Journals

Cited by 2 publications

References 32 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

Tight Cell-Probe Lower Bounds for Dynamic Succinct Dictionaries

Li,

Liang,

et al. 2023

2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS)

View full text Add to dashboard Cite

Tight Cell-Probe Lower Bounds for Dynamic Succinct Dictionaries

Li,

Liang,

et al. 2023

2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS)

View full text Add to dashboard Cite

History-Independent Dynamic Partitioning: Operation-Order Privacy in Ordered Data Structures

Bender,

Farach-Colton,

Goodrich

et al. 2024

Proc. ACM Manag. Data

View full text Add to dashboard Cite

A data structure is history independent if its internal representation reveals nothing about the history of operations beyond what can be determined from the current contents of the data structure. History independence is typically viewed as a security or privacy guarantee, with the intent being to minimize risks incurred by a security breach or audit. Despite widespread advances in history independence, there is an important data-structural primitive that previous work has been unable to replace with an equivalent history-independent alternative---dynamic partitioning. In dynamic partitioning, we are given a dynamic set S of ordered elements and a size-parameter B, and the objective is to maintain a partition of S into ordered groups, each of size Θ(B). Dynamic partitioning is important throughout computer science, with applications to B-tree rebalancing, write-optimized dictionaries, log-structured merge trees, other external-memory indexes, geometric and spatial data structures, cache-oblivious data structures, and order-maintenance data structures. The lack of a history-independent dynamic-partitioning primitive has meant that designers of history-independent data structures have had to resort to complex alternatives. In this paper, we achieve history-independent dynamic partitioning. Our algorithm runs asymptotically optimally against an oblivious adversary, processing each insert/delete with O(1) operations in expectation and O(B log N/loglog N) with high probability in set size N.

show abstract

Strongly History-Independent Storage Allocation: New Upper and Lower Bounds

Cited by 2 publications

References 32 publications

Tight Cell-Probe Lower Bounds for Dynamic Succinct Dictionaries

Tight Cell-Probe Lower Bounds for Dynamic Succinct Dictionaries

History-Independent Dynamic Partitioning: Operation-Order Privacy in Ordered Data Structures

Contact Info

Product

Resources

About