arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2104.14851cs.CR
收藏

多矩阵可验证计算

Multi-Matrix Verifiable Computation

Yan He, Liang Feng Zhang

摘要:

近年来,将计算安全地外包给云服务器的问题吸引了大量的关注。Gennaro,Gentry,Parno(Crypto'10)的可验证计算允许客户端验证服务器对函数的计算,其时间比从头开始执行外包计算少得多。在可验证计算的多函数模型(Parno,Raykova,Vaikuntanathan; TCC'12)中,编码函数的过程和准备输入的过程是解耦的,使得任何客户端都可以在其输入上自由地提交计算请求,而不必预先生成函数的编码。在本文中,我们提出了一个多矩阵可验证的计算方案,允许在有限域上的矩阵功能的安全外包。我们的计划可以外包。当它被用来外包$m$线性函数,该计划是大约$m$倍快,并具有更少的通信成本比以前最有名的方案由Fiore和Gennaro(CCS'12),在客户端计算和服务器端计算。我们还展示了成本节约与详细的实施。

英文摘要:

The problem of securely outsourcing computation to cloud servers has attracted a large amount of attention in recent years. The verifiable computation of Gennaro, Gentry, Parno (Crypto'10) allows a client to verify the server's computation of a function with substantially less time than performing the outsourced computation from scratch. In a multi-function model (Parno, Raykova, Vaikuntanathan; TCC'12) of verifiable computation, the process of encoding function and the process of preparing input are decoupled such that any client can freely submit a computation request on its input, without having to generate an encoding of the function in advance. In this paper, we propose a multi-matrix verifiable computation scheme that allows the secure outsourcing of the matrix functions over a finite field. Our scheme is outsourceable. When it is used to outsource $m$ linear functions, the scheme is roughly $m$ times faster and has less communication cost than the previously best known scheme by Fiore and Gennaro (CCS'12), both in the client-side computation and in the server-side computation. We also show the cost saving with detailed implementations.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑