Oblivious data structure

An oblivious data structure is a data structure that will give nothing about the sequence or pattern of the operations that have been applied except… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1997-2015
02419972015

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
We present a new oblivious RAM that supports variable-sized storage blocks (vORAM), which is the first ORAM to allow varying… (More)
  • figure 2
  • figure 3
  • figure 4
  • figure 5
  • figure 6
Is this relevant?
2009
2009
We consider a number of range reporting problems in two and three dimensions and prove lower bounds on the amount of space… (More)
  • table 1
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
2007
2007
We develop an optimal cache-oblivious priority queue data structure, supporting insertion, deletion, and delete-min operations in… (More)
  • table 1
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
2006
2006
We present static cache-oblivious dictionary structures for strings which provide analogues of tries and suffix trees in the… (More)
  • figure 1
  • figure 2
  • figure 4
Is this relevant?
2005
2005
We present the first cache-oblivious data structure for planar orthogonal range counting, and improve on previous results for… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 6
Is this relevant?
2005
2005
We develop a cache-oblivious data structure for storing a set S of N axis-aligned rectangles in the plane, such that all… (More)
  • figure 1
  • figure 2
  • figure 4
  • figure 3
  • figure 5
Is this relevant?
Highly Cited
2002
Highly Cited
2002
(MATH) In this paper we develop an optimal cache-oblivious priority queue data structure, supporting insertion, deletion, and… (More)
  • figure 1
  • figure 2
Is this relevant?
Highly Cited
2002
Highly Cited
2002
This paper presents a simple dictionary structure designed for a hierarchical memory. The proposed data structure is <i>cache… (More)
  • table 1
  • table 2
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
Highly Cited
1997
Highly Cited
1997
We introduce the notion of oblivious data structure, motivated by the use of data structuresin cryptography. Informally, an… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
1997
1997
We introduce the notion of oblivious data structure, motivated by the use of data structures in cryptography. Informally, an… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?