Optimal Oblivious Priority Queues
Zahra Jafargholi, Kasper Green Larsen, Mark Simkin · Society for Industrial and Applied Mathematics eBooks · 2021
In this work, we present the first asymptotically optimal oblivious priority queue, which matches the lower bound of Jacob, Larsen, and Nielsen (SODA'19). Our construction is conceptually simple and statistically secure. We illustrate the power of our optimal oblivious priority queue by presenting a conceptually equally simple construction of statistically secure offline ORAMs with O(log n) bandwidth overhead.