**Fast Vector Oblivious Linear Evaluation from Ring Learning with Errors**

*Leo de Castro and Chiraag Juvekar and Vinod Vaikuntanathan*

**Abstract: **Oblivious linear evaluation (OLE) is a fundamental building block in multi-party computation protocols. In OLE, a sender holds a description of an affine function $f_{\alpha,\beta}(z)=\alpha z+\beta$, the receiver holds an input $x$, and gets $\alpha x+\beta$ (where all computations are done over some field, or more generally, a ring). Vector OLE (VOLE) is a generalization where the sender has many affine functions and the receiver learns the evaluation of all of these functions on a single point $x$.

The state-of-the-art semi-honest VOLE protocols generally fall into two groups. The first group relies on standard assumptions to achieve security but lacks in concrete efficiency. These constructions are mostly based on additively homomorphic encryption (AHE) and are classified as ``folklore". The second group relies on less standard assumptions, usually properties of sparse, random linear codes, but they manage to achieve concrete practical efficiency.

In this work, we present a conceptually simple VOLE protocol that derives its security from a standard assumption, namely Ring Learning with Errors (RLWE), while still achieving concrete efficiency comparable to the fastest VOLE protocols from non-standard coding assumptions. Furthermore, our protocol admits a natural extension to batch OLE (BOLE), which is yet another variant of OLE that computes many OLEs in parallel.

**Category / Keywords: **cryptographic protocols / implementation, oblivious linear evaluation

**Date: **received 8 Jun 2020

**Contact author: **ldec at mit edu

**Available format(s): **PDF | BibTeX Citation

**Version: **20200609:233844 (All versions of this report)

**Short URL: **ia.cr/2020/685

[ Cryptology ePrint archive ]