Lower Bounds for Oblivious Data Structures

Riko Jacob, Kasper Green Larsen, Jesper Buus Nielsen

Publikation: Konference artikel i Proceeding eller bog/rapport kapitelKonferencebidrag i proceedingsForskningpeer review


An oblivious data structure is a data structure where the memory access patterns reveals no information about the operations performed on it. Such data structures were introduced by Wang et al. [ACM SIGSAC’14] and are intended for situations where one wishes to store the data structure at an untrusted server. One way to obtain an oblivious data structure is simply to run a classic data structure on an oblivious RAM (ORAM). Until very recently, this resulted in an overhead of ω(lg n) for the most natural setting of parameters. Moreover, a recent lower bound for ORAMs by Larsen and Nielsen [CRYPTO’18] show that they always incur an overhead of at least Ω(lg n) if used in a black box manner. To circumvent the ω(lg n) overhead, researchers have instead studied classic data structure problems more directly and have obtained efficient solutions for many such problems such as stacks, queues, deques, priority queues and search trees. However, none of these data structures process operations faster than Θ(lg n), leaving open the question of whether even faster solutions exist. In this paper, we rule out this possibility by proving Ω(lg n) lower bounds for oblivious stacks, queues, deques, priority queues and search trees.
TitelProceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms
ForlagSociety for Industrial and Applied Mathematics
Publikationsdato6 jan. 2019
ISBN (Elektronisk) 978-1-61197-548-2
StatusUdgivet - 6 jan. 2019
BegivenhedThirtieth Annual ACM-SIAM Symposium on Discrete Algorithms - San Diego, USA
Varighed: 6 jan. 20199 jan. 2019


KonferenceThirtieth Annual ACM-SIAM Symposium on Discrete Algorithms
BySan Diego


Dyk ned i forskningsemnerne om 'Lower Bounds for Oblivious Data Structures'. Sammen danner de et unikt fingeraftryk.