Distributed Vector-OLE: Improved Constructions and Implementation
Distributed Vector-OLE: Improved Constructions and Implementation
复制标题
DOI：
10.1145/3319535.3363228
复制
发表时间：
2019-11
期刊：
影响因子：
--
通讯作者：
Phillipp Schoppmann;Adrià Gascón;Leonie Reichert;Mariana Raykova
中科院分区：
文献类型：
--
作者：
Phillipp Schoppmann;Adrià Gascón;Leonie Reichert;Mariana Raykova
我们研究了具体有效的分布式不经意向量线性求值协议(向量-OLE)。博伊尔等人。(CCS 2018)提出了一种使用次线下通信的安全分布式伪随机向量-OLE生成协议，但他们没有提供实现。它们的构造基于LPN假设的变体，并假设了用于单点函数秘密共享(FSS)的分布式密钥生成协议以及用于获得多点FSS的高效批处理方案。我们证明了这一要求可以放宽，从而导致FSS的一个较弱的变体，我们给出了一个有效的协议。这允许我们使用有效的概率批次代码，这些代码最近也被Angel等人用于批次PIR。(S&P2018)。我们根据我们的协议构造了一个完整的向量-OLE生成器，并将其与其他方法进行了实验比较。我们的实现具有很好的并行性，并且在实践中具有较低的通信开销。对于生成一个大小为$2^20$的OLE，我们的实现在32个内核上只需要$0.52$S。
We investigate concretely efficient protocols for distributed oblivious linear evaluation over vectors (Vector-OLE). Boyle et al. (CCS 2018) proposed a protocol for secure distributed pseudorandom Vector-OLE generation using sublinearcommunication, but they did not provide an implementation. Their construction is based on a variant of the LPN assumption and assumes a distributed key generation protocol for single-point Function Secret Sharing (FSS), as well as an efficient batching scheme to obtain multi-point FSS. We show that this requirement can be relaxed, resulting in a weaker variant of FSS, for which we give an efficient protocol. This allows us to use efficient probabilistic batch codes that were also recently used for batched PIR by Angel et al. (S&P 2018). We construct a full Vector-OLE generator from our protocols, and compare it experimentally with alternative approaches. Our implementation parallelizes very well, and has low communication overhead in practice. For generating a VOLE of size $2^20 $, our implementation only takes $0.52$s on 32 cores.