Adaptive Garbled RAM from Laconic Oblivious Transfer
Adaptive Garbled RAM from Laconic Oblivious Transfer
复制标题
来自 Laconic Oblivious Transfer 的自适应乱码 RAM
DOI:
10.1007/978-3-319-96878-0_18
复制
发表时间:
2018
期刊:
影响因子:
--
通讯作者:
Akshayaram Srinivasan
中科院分区:
文献类型:
--
作者:
Sanjam Garg;R. Ostrovsky;Akshayaram Srinivasan
We give a construction of an adaptive garbled RAM scheme. In the adaptive setting, a client first garbles a “large” persistent database which is stored on a server. Next, the client can provide garbling of multiple adaptively and adversarially chosen RAM programs that execute and modify the stored database arbitrarily. The garbled database and the garbled program should reveal nothing more than the running time and the output of the computation. Furthermore, the sizes of the garbled database and the garbled program grow only linearly in the size of the database and the running time of the executed program respectively (up to poly logarithmic factors). The security of our construction is based on the assumption that laconic oblivious transfer (Cho et al., CRYPTO 2017) exists. Previously, such adaptive garbled RAM constructions were only known using indistinguishability obfuscation or in random oracle model. As an additional application, we note that this work yields the first constant round secure computation protocol for persistent RAM programs in the malicious setting from standard assumptions. Prior works did not support persistence in the malicious setting.
DOI:
--
发表时间:
2015
期刊:
Annual Symposium on Foundations of Computer Science
影响因子:
--
作者:
Garg, Sanjam;Lu, Steve;Ostrovsky, Rafail
通讯作者:
Ostrovsky, Rafail
DOI:
10.1007/978-3-319-78375-8_17
发表时间:
2018-04
期刊:
IACR Cryptol. ePrint Arch.
影响因子:
--
作者:
Fabrice Benhamouda;Huijia Lin
通讯作者:
Fabrice Benhamouda;Huijia Lin