Efficient 3-Party Distributed ORAM

Efficient 3-Party Distributed ORAM
复制标题

高效的三方分布式ORAM

DOI:
--
复制
发表时间:
2018
期刊:
IACR Cryptology ePrint Archive
影响因子:
--
通讯作者:
R. Ostrovsky
R. Ostrovsky
中科院分区:
--
文献类型:
--
作者:
Paul Bunn;Jonathan Katz;E. Kushilevitz;R. Ostrovsky

文献摘要

被引文献

相似文献

.分布式不经意RAM(DORAM)协议是RAM模型中安全计算协议的基本组成部分,在该协议中,各方不经意地访问共享阵列中的共享位置。我们在这里展示了一个高效的,3方DORAM协议,具有半诚实的安全性。据我们所知,我们的协议是这种设置的第一个协议,它在恒定的回合中运行,需要次线性通信和线性工作,并且只使用黑箱加密原语。我们相信我们的协议也比现有的解决方案更有效。作为独立兴趣的构建块,我们构造了一个3服务器分布式点函数,该函数具有对两个合谋服务器的安全性,比以前的工作更简单,具有更好的具体效率。
. Distributed Oblivious RAM (DORAM) protocols—in which parties obliviously access a shared location in a shared array—are a fundamental component of secure-computation protocols in the RAM model. We show here an efficient, 3-party DORAM protocol with semi-honest security for a single corrupted party. To the best of our knowledge, ours is the first protocol for this setting that runs in constant rounds, requires sublinear communication and linear work, and makes only black-box use of cryptographic primitives. We believe our protocol is also concretely more efficient than existing solutions. As a building block of independent interest, we construct a 3-server distributed point function with security against two colluding servers that is simpler and has better concrete efficiency than prior work.