首页> 外文会议>Progress in Cryptology - AFRICACRYPT 2008 >An (Almost) Constant-Effort Solution-Verification Proof-of-Work Protocol Based on Merkle Trees
【24h】

An (Almost) Constant-Effort Solution-Verification Proof-of-Work Protocol Based on Merkle Trees

机译:基于默克尔树的(几乎)恒定工作量解决方案验证工作量证明协议

获取原文
获取原文并翻译 | 示例

摘要

Proof-of-work schemes are economic measures to deter denial-of-service attacks: service requesters compute moderately hard functions the results of which are easy to check by the provider. We present such a new scheme for solution-verification protocols. Although most schemes to date are probabilistic unbounded iterative processes with high variance of the requester effort, our Merkle tree scheme is deterministic with an almost constant effort and null variance, and is computation-optimal.
机译:工作量证明方案是阻止拒绝服务攻击的经济措施:服务请求者计算中等难度的功能,其结果易于由提供者检查。我们提出了一种解决方案验证协议的新方案。尽管迄今为止,大多数方案都是请求者工作量具有很大方差的概率无界迭代过程,但我们的Merkle树方案是具有几乎恒定的工作量和空方差的确定性方法,并且计算最优。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号