【24h】

Sequentially Composable Rational Proofs

机译:顺序可组合的有理证明

获取原文

摘要

We show that Rational Proofs do not satisfy basic compositional properties in the case where a large number of "computation problems" are outsourced. We show that a "fast" incorrect answer is more remunerable for the prover, by allowing him to solve more problems and collect more rewards. We present an enhanced definition of Rational Proofs that removes the economic incentive for this strategy and we present a protocol that achieves it for some uniform bounded-depth circuits.
机译:我们证明,在大量“计算问题”被外包的情况下,Rational Proofs不满足基本的成分性质。我们证明,通过允许证明者解决更多的问题并获得更多的奖励,对于证明者而言,“快速”的错误答案更有可能获得回报。我们提出了对Rational Proofs的增强定义,该定义消除了该策略的经济诱因,并且我们提出了一种协议,该协议针对某些统一的边界深度电路实现了这一目标。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号