• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文会议>Applied cryptography and network security >SCRAPE: Scalable Randomness Attested by Public Entities
【24h】

SCRAPE: Scalable Randomness Attested by Public Entities

机译：SCRAPE：公共实体证明的可扩展随机性

获取原文
获取原文并翻译 | 示例
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

Uniform randomness beacons whose output can be publicly attested to be unbiased are required in several cryptographic protocols. A common approach to building such beacons is having a number parties run a coin tossing protocol with guaranteed output delivery (so that adversaries cannot simply keep honest parties from obtaining randomness, consequently halting protocols that rely on it). However, current constructions face serious scalability issues due to high computational and communication overheads. We present a coin tossing protocol for an honest majority that allows for any entity to verify that an output was honestly generated by observing publicly available information (even after the execution is complete), while achieving both guaranteed output delivery and scalability. The main building block of our construction is the first Publicly Verifiable Secret Sharing scheme for threshold access structures that requires only O(n) exponentiations. Previous schemes required 0(nt) exponentiations (where t is the threshold) from each of the parties involved, making them unfit for scalable distributed randomness generation, which requires t = n/2 and thus 0(n2) exponentiations.
机译：在几种加密协议中都需要使用统一的随机信标，其输出可以公开证明是无偏的。构建此类信标的一种常见方法是让多个参与方运行具有保证输出交付的投币协议（这样，对手就不能简单地阻止诚实方获得随机性，因此终止依赖它的协议）。但是，由于高的计算和通信开销，当前的结构面临严重的可伸缩性问题。我们针对诚实多数提出了一种抛硬币协议，该协议允许任何实体通过观察公开可用的信息（甚至在执行完成之后）验证输出是诚实生成的，同时实现保证的输出交付和可伸缩性。我们构建的主要组成部分是第一个仅需要O（n）幂运算的阈值访问结构的公共可验证秘密共享方案。先前的方案需要每个参与方的0（nt）幂（其中t是阈值），使其不适合可伸缩的分布式随机性生成，这需要t = n / 2，因此需要0（n2）幂。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号