History-independence: a fresh look at the case of R-trees

@inproceedings{Tzouramanis2012HistoryindependenceAF,
  title={History-independence: a fresh look at the case of R-trees},
  author={Theodoros Tzouramanis},
  booktitle={SAC},
  year={2012}
}
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… CONTINUE READING

From This Paper

Figures, tables, and topics from this paper.

Citations

Publications citing this paper.
Showing 1-3 of 3 extracted citations

References

Publications referenced by this paper.
Showing 1-2 of 2 references

B-Treaps: A Uniquely Represented Alternative to B-Trees

ICALP • 2009
View 6 Excerpts
Highly Influenced

Strongly History-Independent Hashing with Applications

48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07) • 2007
View 6 Excerpts
Highly Influenced

Similar Papers

Loading similar papers…