Is There an Oblivious RAM Lower Bound for Online Reads?

Mor Weiss, Daniel Wichs. Is There an Oblivious RAM Lower Bound for Online Reads?. In Amos Beimel, Stefan Dziembowski, editors, Theory of Cryptography - 16th International Conference, TCC 2018, Panaji, India, November 11-14, 2018, Proceedings, Part II. Volume 11240 of Lecture Notes in Computer Science, pages 603-635, Springer, 2018. [doi]

Abstract

Abstract is missing.