Short Paper: Probabilistically Almost-Oblivious Computation
Short Paper: Probabilistically Almost-Oblivious Computation
复制标题
短论文:概率上几乎不经意的计算
DOI:
10.1145/3411506.3417598
复制
发表时间:
2020
期刊:
影响因子:
--
通讯作者:
Hicks, Michael
中科院分区:
文献类型:
--
作者:
Sweet, Ian;Darais, David;Hicks, Michael
Memory-trace Obliviousness (MTO) is a noninterference property: programs that enjoy it have neither explicit nor implicit information leaks, even when the adversary can observe the program counter and the address trace of memory accesses. Probabilistic MTO relaxes MTO to accept probabilistic programs. In prior work, we developed λobliv, whose type system aims to enforce PMTO [2]. We showed that λobliv could typecheck (recursive) Tree ORAM [6], a sophisticated algorithm that implements a probabilistically oblivious key-value store. We conjectured that λobliv ought to be able to typecheck more optimized oblivious data structures (ODSs)[8], but that its type system was as yet too weak.In this short paper we show we were wrong: ODSs cannot be implemented in λobliv because they are not actually PMTO, due to the possibility of overflow, which occurs when a oram_write silently fails due to a local lack of space. This was surprising to us because Tree ORAM can also overflow but is still PMTO. The paper explains what is going on and sketches the task of adapting the PMTO property, and λobliv's type system, to characterize ODS security.
DOI:
10.1109/sp.2007.22
发表时间:
2007
期刊:
2007 IEEE Symposium on Security and Privacy (SP '07)
影响因子:
--
作者:
Aslan Askarov;A. Sabelfeld
通讯作者:
A. Sabelfeld
DOI:
10.1145/3177872
发表时间:
2018
期刊:
Journal of the ACM (JACM)
影响因子:
--
作者:
Emil Stefanov;Marten van Dijk;Elaine Shi;T.;Christopher W. Fletcher;Ling Ren;Xiangyao Yu;Srinivas Devadas
通讯作者:
Srinivas Devadas