Path ORAM
Path ORAM
复制标题
路径ORAM
DOI：
10.1145/3177872
复制
发表时间：
2018
期刊：
影响因子：
--
通讯作者：
Srinivas Devadas
中科院分区：
文献类型：
--
作者：
Emil Stefanov;Marten van Dijk;Elaine Shi;T.;Christopher W. Fletcher;Ling Ren;Xiangyao Yu;Srinivas Devadas
我们提出了Oram，这是一种非常简单的RAM协议，其量很少，部分是由于其简单性，Oram是迄今为止最实用的Oram方案。 （log n）大小b =ω（log2 n）位的带宽成本。小客户存储由于其实践，因此在安全处理器的设计中采用了路径。
We present Path ORAM, an extremely simple Oblivious RAM protocol with a small amount of client storage. Partly due to its simplicity, Path ORAM is the most practical ORAM scheme known to date with small client storage. We formally prove that Path ORAM has a O(log N) bandwidth cost for blocks of size B = Ω (log2 N) bits. For such block sizes, Path ORAM is asymptotically better than the best-known ORAM schemes with small client storage. Due to its practicality, Path ORAM has been adopted in the design of secure processors since its proposal.
黑盒乱码RAM
DOI：
--
发表时间：
2015
期刊：
Annual Symposium on Foundations of Computer Science
影响因子：
--
作者：
Garg, Sanjam;Lu, Steve;Ostrovsky, Rafail
通讯作者：
Ostrovsky, Rafail