Mar 8, 2019 · We identify a particular graph property that can be efficiently tested and that all access graphs of ORAM computation must satisfy with high ...
Abstract. Oblivious RAM (ORAM), introduced in the context of software protection by Goldreich and Os- trovsky [JACM'96], aims at obfuscating the memory ...
Nov 22, 2019 · The first general lower bound for bandwidth overhead in online ORAM (i.e., where the ORAM must process sequentially the operations it has to ...
Sep 23, 2019 · In this work, we revisit the lower bound of Larsen and Nielsen, which was proved under the assumption that the adversarial server knows exactly ...
The results rule out a broader class of constructions and imply that obfuscating the boundaries between the input operations does not help in building a ...
Dec 1, 2019 · We give an lower bound for the bandwidth overhead of any online ORAM even when the adversary has no access to this information. For many known ...
In this work, we revisit the lower bound of Nielsen and Larsen, which was proved under an assumption about the format of the memory access pattern of the ORAM.
Duration: 33:36
Posted: Jul 30, 2019
Posted: Jul 30, 2019
Seminar Talk by Kasper Green Larsen: Stronger Lower Bounds for Online ... They argued that most known ORAM constructions work in the online setting as well.
Ajtai, M.: Oblivious RAMs without cryptographic assumptions. In: Proceedings of the 42nd ACM Symposium on Theory of Computing, STOC 2010, Cambridge, ...