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

通过多个随机信标增强信任

Trust enhancement by multiple random beacons

Charles H. Bennett, John A. Smolin

摘要:

随机信标--信息源,它广播一个任何人事先都不知道的随机数字流--对于各种加密目的都很有用。但是,这种信标可以很容易地和不可检测地破坏,使他们的输出是事先知道的一个不诚实的一方,谁可以使用这些信息来击败密码协议理应保护的信标。我们探索一种策略,以减少这种危险,通过将输出从几个非相互作用(如空间分离)信标XOR它们在一起,产生一个单一的数字流,这是更值得信赖的比任何单个信标,随机和不可预测的,如果至少有一个贡献的信标是诚实的。如果贡献信标不是空间分离的,使得不诚实的信标可以偷听并适应其他信标的早期输出,则信标的可信度仍然可以通过分时策略在较小程度上增强。指出了基于单向散列函数的信任放大方法的不足。

英文摘要:

Random beacons-information sources that broadcast a stream of random digits unknown by anyone beforehand-are useful for various cryptographic purposes. But such beacons can be easily and undetectably sabotaged, so that their output is known beforehand by a dishonest party, who can use this information to defeat the cryptographic protocols supposedly protected by the beacon. We explore a strategy to reduce this hazard by combining the outputs from several noninteracting (eg spacelike-separated) beacons by XORing them together to produce a single digit stream which is more trustworthy than any individual beacon, being random and unpredictable if at least one of the contributing beacons is honest. If the contributing beacons are not spacelike separated, so that a dishonest beacon can overhear and adapt to earlier outputs of other beacons, the beacons' trustworthiness can still be enhanced to a lesser extent by a time sharing strategy. We point out some disadvantages of alternative trust amplification methods based on one-way hash functions.

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

↑