Lower Bounds for Oblivious Data Structures

24 Oct 2018 Jacob Riko Larsen Kasper Green Nielsen Jesper Buus

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... (read more)

PDF Abstract
No code implementations yet. Submit your code now

Categories


  • DATA STRUCTURES AND ALGORITHMS
  • CRYPTOGRAPHY AND SECURITY