This article is about data structures that are secure against attacks that could reveal their access history. For data structures that are I/O efficient for arbitrary cache sizes, see cache-oblivious algorithm.
In computer science, an oblivious data structure is a data structure that gives no information about the sequence or pattern of the operations that have been applied except for the final result of the operations.[1]
In most conditions, even if the data is encrypted, the access pattern can be achieved, and this pattern can leak some important information such as encryption keys. And in the outsourcing of cloud data, this leakage of access pattern is still very serious. An access pattern is a specification of an access mode for every attribute of a relation schema. For example, the sequences of user read or write the data in the cloud are access patterns.
We say a machine is oblivious if the sequence in which it accesses is equivalent for any two inputs with the same running time. So the data access pattern is independent from the input.
Applications:
Cloud data outsourcing: When writing or reading data from a cloud server, oblivious data structures are useful. And modern databases rely on data structures heavily, so oblivious data structures come in handy.
Secure processor: Tamper-resilient secure processors are used for defense against physical attacks or the malicious intruders access the users’ computer platforms. The existing secure processors designed in academia and industry include AEGIS and Intel SGX. But the memory addresses are still transferred in the clear on the memory bus. So the research finds that this memory buses can give out the information about encryption keys. With the Oblivious data structure comes in practical, the secure processor can obfuscate memory access pattern in a provably secure manner.
Secure computation: Traditionally people used circuit-model to do the secure computation, but the model is not enough for the security when the amount of data is getting big. RAM-model secure computation was proposed as an alternative to the traditional circuit model, and oblivious data structure is used to prevent information access behavioral being stolen.
^Cite error: The named reference Wang was invoked but never defined (see the help page).
and 19 Related for: Oblivious data structure information
In computer science, an obliviousdatastructure is a datastructure that gives no information about the sequence or pattern of the operations that have...
It defines the DNS protocol, a detailed specification of the datastructures and data communication exchanges used in the DNS, as part of the Internet...
Retrieved 2011-01-17. "Cache Oblivious B-trees". State University of New York (SUNY) at Stony Brook. Retrieved 2011-01-17. "Big Data is Creating The Future...
version, but unlike that algorithm, the recursive algorithm is cache-oblivious: there is no tuning parameter required to get optimal cache performance...
rather than the three of TMR, but has been used commercially. Failure-oblivious computing is a technique that enables computer programs to continue executing...
adjacent datastructures with identical structure and size, accessing mutually corresponding elements of each structure rather than each entire structure. This...
hardware-maintained structure can utilize to manage a cache of information. Caching improves performance by keeping recent or often-used data items in memory...
Demaine, Erik (2002). Cache-Oblivious Algorithms and DataStructures (PDF). Lecture Notes from the EEF Summer School on Massive Data Sets. Aarhus: BRICS. NASA...
picture, and they learn relationships between pixels that humans are oblivious to, but that still correlate with images of certain types of real objects...
along the n1 direction. More generally, an asymptotically optimal cache-oblivious algorithm consists of recursively dividing the dimensions into two groups...
steps can be performed by an oblivious two-tape Turing machine in O(nlogn){\displaystyle O(n\log n)} steps. Oblivious machines correspond in a step-wise...
Naor, Moni; Reingold, Omer; Rosen, Alon (2005). "On Robust Combiners for Oblivious Transfer and Other Primitives". Advances in Cryptology – EUROCRYPT 2005...
likely meaningless or misleading. Most traders who use Profiles seem oblivious to the requirement for normality. 2. Even in overall equilibrium markets...
the idea was that the passer-by in neighbouring streets would be nearly oblivious to the tower's existence until directly underneath it.[citation needed]...
subjected to. She's doesn't want to tell him because her parents are oblivious to the fact that she's a Brawler. Juno then proceeds to hack into Mia's...
memory transfers between internal and external memory. Like their cache-oblivious counterparts, asymptotically optimal external sorting algorithms achieve...
morning, at 01:23 local time, went about their usual business, completely oblivious to what had just happened. However, within a few hours of the explosion...
Global Information