arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1809.04174cs.CR
收藏

类RAM运行时间的可验证计算

Verifiable Computations with RAM-like Running Times

Tahsin Civan Mert Dönmez

摘要:

当前和新兴的趋势,如云计算,雾计算,以及最近的多访问边缘计算(MEC),增加了寻找可验证计算问题的解决方案的兴趣。此外,由于物联网的不断实现,近年来计算能力较弱的设备的数量急剧增加。这项工作提出了一个解决方案,它享有以下两个理想的属性:(1)输入准备和验证的成本是非常低的(低到足以允许可验证的外包计算资源受限的设备上的约束网络);(2)可验证的计算的运行时间是RAM的。

英文摘要:

Current and emerging trends such as cloud computing, fog computing, and more recently, multi-access edge computing (MEC) increase the interest in finding solutions to the verifiable computation problem. Furthermore, the number of computationally weak devices have increased drastically in recent years due to the ongoing realization of the Internet of Things. This work proposes a solution which enjoys the following two desirable properties: (1) cost of input preparation and verification is very low (low enough to allow verifiable outsourcing of computations by resource-constrained devices on constrained networks); (2) the running time of the verifiable computation is RAM-like.

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

↑