Yes, There is an Oblivious RAM Lower Bound!
Yes, There is an Oblivious RAM Lower Bound!
复制标题
是的，有一个不经意的 RAM 下界！
DOI：
--
复制
发表时间：
2018
期刊：
影响因子：
--
通讯作者：
J. Nielsen
中科院分区：
文献类型：
--
作者：
Kasper Green Larsen;J. Nielsen
Goldreich和Ostrovsky [JACM'96]引入的RAM（ORAM）是（可能是随机的）RAM，对此，内存访问模式没有揭示有关执行操作的信息。也就是说，必须访问其在第二篇论文中隐藏的乘法因子。摊销\（\ varomega（\ lg n）\）带宽开销的下限，用于内存大小为n，其下限非常强。提前操作。
An Oblivious RAM (ORAM) introduced by Goldreich and Ostrovsky [JACM’96] is a (possibly randomized) RAM, for which the memory access pattern reveals no information about the operations performed. The main performance metric of an ORAM is the bandwidth overhead, i.e., the multiplicative factor extra memory blocks that must be accessed to hide the operation sequence. In their seminal paper introducing the ORAM, Goldreich and Ostrovsky proved an amortized \(\varOmega (\lg n)\) bandwidth overhead lower bound for ORAMs with memory size n. Their lower bound is very strong in the sense that it applies to the “offline” setting in which the ORAM knows the entire sequence of operations ahead of time.
黑盒乱码RAM
DOI：
--
发表时间：
2015
期刊：
Annual Symposium on Foundations of Computer Science
影响因子：
--
作者：
Garg, Sanjam;Lu, Steve;Ostrovsky, Rafail
通讯作者：
Ostrovsky, Rafail