skip to main content
10.1145/2245276.2245279acmconferencesArticle/Chapter ViewAbstractPublication PagessacConference Proceedingsconference-collections
research-article

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

Published: 26 March 2012 Publication History

Abstract

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.

References

[1]
O. Amble and D. Knuth: Ordered hash tables. The Computer Journal, 17(2), pp. 135--142 (1974).
[2]
G. E. Blelloch and D. Golovin: Strongly history-independent hashing with applications. In Proceedings of the IEEE Symp. on Foundations of Computer Science, pp. 272--282 (2007).
[3]
G. E. Blelloch, D. Golovin, and V. Vassilevska: Uniquely represented data structures for computational geometry. In Proceedings of the Scandinavian Workshop on Algorithm Theory (SWAT), LNCS, Vol. 5124, pp. 17--28, Springer, Heidelberg (2008).
[4]
J. R. Driscoll, N. Sarnak, D. D. Sleator, and R. E. Tarjan: Making data structures persistent. J. Comput. Syst. Sci. (JCSS), 38(1), pp. 86--124 (1989).
[5]
D. Golovin: B-treaps: A uniquely represented alternative to B-trees. In Proceedings of the ICALP Conf., pp. 487--499 (2009).
[6]
A. Guttman: R-trees: a dynamic index structure for spatial searching. In ACM SIGMOD Conference, pp. 47--57 (1984).
[7]
J. D. Hartline, E. S. Hong, A. E. Mohr, W. R. Pentney, and E. Rocke: Characterizing history independent data structures. Algorithmica 42(1), pp. 57--74 (2005).
[8]
I. Kamel and C. Faloutsos: On packing R-trees. In Proceedings of the Second International ACM Conference on Information and Knowledge Management (CIKM), pp. 490--499, Washington D.C., (1993).
[9]
I. Kamel and C. Faloutsos: Hilbert R-tree: an improved R-tree using fractals. In Proceedings of the VLDB Conference, pp. 500--509, Santiago, Chile (1994).
[10]
Y. Manolopoulos, A. Nanopoulos, A. Papadopoulos, and Y. Theodoridis: R-trees: theory and applications, Springer-Verlag (2005).
[11]
D. Micciancio: Oblivious data structures: applications to cryptography. In Proceedings of the STOC Conference (1997).
[12]
M. Naor, G. Segev, and U. Wieder: History-independent cuckoo hashing. In Proceedings of the ICALP Conference Part II, LNCS Vol. 5126, pp. 631--642. Heidelberg (2008).
[13]
M. Naor and V. Teague: Anti-persistence: history independent data structures. In Proceedings of the Thirty-Third Annual ACM STOC Symposium, pp. 492--501 (2001).
[14]
Y. Tao and D. Papadias: Efficient historical R-trees. In Proceedings of the SSDBM Conference, pp. 223--232 (2001).
[15]
Wikipedia: 2007 Formula One espionage controversy, Available at http://goo.gl/nj4N5, valid as of November 2011.

Cited By

View all
  • (2024)History-Independent Concurrent ObjectsProceedings of the 43rd ACM Symposium on Principles of Distributed Computing10.1145/3662158.3662814(14-24)Online publication date: 17-Jun-2024
  • (2024)History-Independent Dynamic Partitioning: Operation-Order Privacy in Ordered Data StructuresProceedings of the ACM on Management of Data10.1145/36516092:2(1-27)Online publication date: 14-May-2024
  • (2019)eHIFSProceedings of the 2019 ACM Asia Conference on Computer and Communications Security10.1145/3321705.3329839(573-585)Online publication date: 2-Jul-2019
  • Show More Cited By

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences
SAC '12: Proceedings of the 27th Annual ACM Symposium on Applied Computing
March 2012
2179 pages
ISBN:9781450308571
DOI:10.1145/2245276
  • Conference Chairs:
  • Sascha Ossowski,
  • Paola Lecca
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 26 March 2012

Permissions

Request permissions for this article.

Check for updates

Author Tags

  1. R-tree
  2. access methods
  3. algorithms
  4. history-independence
  5. privacy
  6. spatial and multidimensional databases

Qualifiers

  • Research-article

Conference

SAC 2012
Sponsor:
SAC 2012: ACM Symposium on Applied Computing
March 26 - 30, 2012
Trento, Italy

Acceptance Rates

SAC '12 Paper Acceptance Rate 270 of 1,056 submissions, 26%;
Overall Acceptance Rate 1,650 of 6,669 submissions, 25%

Upcoming Conference

SAC '25
The 40th ACM/SIGAPP Symposium on Applied Computing
March 31 - April 4, 2025
Catania , Italy

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)2
  • Downloads (Last 6 weeks)0
Reflects downloads up to 20 Jan 2025

Other Metrics

Citations

Cited By

View all
  • (2024)History-Independent Concurrent ObjectsProceedings of the 43rd ACM Symposium on Principles of Distributed Computing10.1145/3662158.3662814(14-24)Online publication date: 17-Jun-2024
  • (2024)History-Independent Dynamic Partitioning: Operation-Order Privacy in Ordered Data StructuresProceedings of the ACM on Management of Data10.1145/36516092:2(1-27)Online publication date: 14-May-2024
  • (2019)eHIFSProceedings of the 2019 ACM Asia Conference on Computer and Communications Security10.1145/3321705.3329839(573-585)Online publication date: 2-Jul-2019
  • (2016)Anti-Persistence on Persistent StorageProceedings of the 35th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems10.1145/2902251.2902276(289-302)Online publication date: 15-Jun-2016
  • (2013)HIFSProceedings of the 2013 ACM SIGSAC conference on Computer & communications security10.1145/2508859.2516724(1285-1296)Online publication date: 4-Nov-2013

View Options

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media