Making data structures persistent
Journal of Computer and System Sciences - 18th Annual ACM Symposium on Theory of Computing (STOC), May 28-30, 1986
CIKM '93 Proceedings of the second international conference on Information and knowledge management
Oblivious data structures: applications to cryptography
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Anti-presistence: history independent data structures
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
R-trees: a dynamic index structure for spatial searching
SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
Hilbert R-tree: An Improved R-tree using Fractals
VLDB '94 Proceedings of the 20th International Conference on Very Large Data Bases
SSDBM '01 Proceedings of the 13th International Conference on Scientific and Statistical Database Management
R-Trees: Theory and Applications (Advanced Information and Knowledge Processing)
R-Trees: Theory and Applications (Advanced Information and Knowledge Processing)
Strongly History-Independent Hashing with Applications
FOCS '07 Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science
Uniquely Represented Data Structures for Computational Geometry
SWAT '08 Proceedings of the 11th Scandinavian workshop on Algorithm Theory
History-Independent Cuckoo Hashing
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II
B-Treaps: A Uniquely Represented Alternative to B-Trees
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
HIFS: history independence for file systems
Proceedings of the 2013 ACM SIGSAC conference on Computer & communications security
| Hi-index | 0.00 |
The deterministic tree-based database indexing structures unintentionally retain "additional" information about previous operations records of the index itself and about the database users' past activities. Privacy is jeopardized when a user gains illegitimate access to an indexing structure and accesses this "additional" confidential information from the internal representation of the index. This paper is the first to explore the design of history-independent access methods for spatial and multidimensional databases and proposes the History-Independent R-tree (HIR-tree), an R-tree variant which does not reveal information about the sequence of insertions, deletions and updates that have been applied to it and only reveals the outcome of these historical operations. It differs from the traditional spatial access methods in that the HIR-tree has the additional property of hiding its modification history. This property is achieved through the use of randomization by the update algorithms.