Choi, Katz, Kumaresan, and Cid put forward the conception of multiclient noninteractive verifiable computation (MVC), enabling a group of clients to outsource computation of a function of . CKKC’s MVC is impractical due to their dependence on fully homomorphic encryption (FHE) and garbled circuits (GCs). In this paper, with the goal of satisfying practical requirements, a general transform is presented from the homomorphic proxy re-authenticator (HPRA) of Deler, Ramacher, and Slamanig to MVC schemes. MVC constructions in this particular study tend to be more efficient once the underlying HPRA avoids introducing FHE and GCs. By deploying the transform to DRS’s HPRA scheme, a specific MVC scheme for calculating the linear combinations of vectors has been proposed. It can be understood that it is the first feasible and implementable MVC scheme so far, and the instantiation solution has a great advantage in efficiency compared with related works.

中文翻译：

---

基于HPRA的高效多客户端可验证计算：转换和实例化

Choi，Katz，Kumaresan和Cid提出了多客户端非交互式可验证计算（MVC）的概念，从而使一组客户端可以外包的功能。由于CKKC依赖于完全同态加密（FHE）和乱码电路（GC），因此MVC不切实际。在本文中，为了满足实际需求，提出了从Deler，Ramacher和Slamanig的同态代理重新认证器（HPRA）到MVC方案的通用转换。一旦基本的HPRA避免引入FHE和GC，此特定研究中的MVC构造往往会更有效。通过将变换部署到DRS的HPRA方案，提出了一种用于计算矢量线性组合的特定MVC方案。可以理解，这是迄今为止第一个可行且可实现的MVC方案，与相关工作相比，实例化解决方案在效率上具有很大的优势。