A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is
In Sect. 2, we introduce the research on succinct data structures for oblivious RAMs (ORAMs), which are used for hiding access patterns. ... In 1987, Goldreich proposed a seminal concept called ORAM, or Oblivious RAM (Random Access Memory), which can theoretically hide the content of data and their access patterns [28, 29] . ...doi:10.1007/s12626-019-00045-1 fatcat:ylrs6drx25gpri4n23mpchoy4m
Shi, “Optorama: Optimal oblivious ram”, Advances in Cryptology– results our system is ... Gupta, based Oblivious RAM”, Proceedings of the 20th International "ThinORAM: Towards Practical Oblivious Data Access in Fog Conference on Architectural Support for ...doi:10.14569/ijacsa.2021.0121162 fatcat:solh26mwynf3jlmba2vy3cnspq
One way to obtain an oblivious data structure is simply to run a classic data structure on an oblivious RAM (ORAM). ... In this paper, we rule out this possibility by proving Ω( n) lower bounds for oblivious stacks, queues, deques, priority queues and search trees. ... The canonical oblivious data structure is the oblivious RAM (ORAM), which is just an ODS for the array data structure. ...arXiv:1810.10635v1 fatcat:t25mdslcuzgjlcxroohax57pji
Similarly, Oblivious Parallel RAM (OPRAM) compiles a parallel RAM program to an oblivious counterpart. ... Oblivious RAM (ORAM) is a technique for compiling any RAM program to an oblivious counterpart, i.e., one whose access patterns do not leak information about the secret inputs. ... algorithms [36, 32, 4, 5] including notably, the recent OptORAMa work  that constructed an optimal ORAM. ...doi:10.4230/lipics.itc.2021.8 fatcat:3ifbmgvqfrh2ne7bvjb5jhqrfu
These lower bounds target two kinds of schemes: schemes hiding the repetition of search queries, and forward-private dynamic schemes, for which updates are oblivious. ... Using Oblivious RAM (ORAM) [GO96] , or Garbled RAM programs [LO13] would help, but these tools also suffer from an inherent cost, either in terms of computation or of communication, poly-logarithmic ... This does not change the asymptotic complexity of the oblivious map, and this is the oblivious map instantiation that we will use here. ...doi:10.2478/popets-2019-0062 dblp:journals/popets/BostF19 fatcat:75qkqxl4mffkdgj3qp5udrkjki