如何用有理网络验证计算
How to verify computation with a rational network
摘要：
本文介绍了一个实用的协议，可证明安全，外包计算。我们的协议最大限度地减少了验证的开销，要求解决方案，以承受一个证明者和挑战者之间的互动游戏。对于优化问题，所有提交的解决方案中的最佳或接近最佳的解决方案将被这种方法所接受。为了克服假冒参与者的问题，使用了财政奖励和押金。
英文摘要：
The present paper introduces a practical protocol for provably secure, outsourced computation. Our protocol minimizes overhead for verification by requiring solutions to withstand an interactive game between a prover and challenger. For optimization problems, the best or nearly best of all submitted solutions is expected to be accepted by this approach. Financial incentives and deposits are used in order to overcome the problem of fake participants.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
