Efficient Techniques for Publicly Verifiable Delegation of Computation
Efficient Techniques for Publicly Verifiable Delegation of Computation
复制标题
DOI：
10.1145/2897845.2897910
复制
发表时间：
2016-05
期刊：
影响因子：
--
通讯作者：
K. Elkhiyaoui;Melek Önen;Monir Azraoui;R. Molva
中科院分区：
文献类型：
--
作者：
K. Elkhiyaoui;Melek Önen;Monir Azraoui;R. Molva
随着云计算的出现，个人和公司都在寻找利用云资源的机会，不仅用于存储，还用于计算。然而，依赖云来执行计算提出了一个不可避免的挑战，即如何确保委托计算的正确性。在这方面，我们引入了两种用于公开可验证计算的加密协议，它们允许轻量级客户端安全地将高度单变量多项式的评估和大型矩阵的乘法外包给云服务器。与现有工作类似，我们的协议遵循平摊可验证计算方法。此外，通过利用多项式和矩阵的数学性质，它们更有效，并让位于公共可委托性。最后，除了效率之外，我们的协议在经过充分研究的假设下是可证明的安全的。
With the advent of cloud computing, individuals and companies alike are looking for opportunities to leverage cloud resources not only for storage but also for computation. Nevertheless, the reliance on the cloud to perform computation raises the unavoidable challenge of how to assure the correctness of the delegated computation. In this regard, we introduce two cryptographic protocols for publicly verifiable computation that allow a lightweight client to securely outsource to a cloud server the evaluation of high-degree univariate polynomials and the multiplication of large matrices. Similarly to existing work, our protocols follow the amortized verifiable computation approach. Furthermore, by exploiting the mathematical properties of polynomials and matrices, they are more efficient and give way to public delegatability. Finally, besides their efficiency, our protocols are provably secure under well-studied assumptions.