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

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...

Full description

Bibliographic Details

Published in:	Proceedings of the ACM on management of data 2025-03, Vol.2 (2), p.1-27, Article 108
Main Authors:	Bender, Michael A., Farach-Colton, Martín, Goodrich, Michael T., Komlós, Hanna
Format:	Article
Language:	English
Subjects:	Data structures and algorithms for data management Data structures design and analysis Database and storage security Database theory Design and analysis of algorithms File system security Online algorithms Randomness, geometry and discrete structures Security and privacy Systems security Theory and algorithms for application domains Theory of computation Theory of database privacy and security
Citations:	Items that this one cites
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!