arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1507.00239quant-phcs.CR
收藏

超长相对论位承诺

Arbitrarily long relativistic bit commitment

Kaushik Chakraborty, André Chailloux, Anthony Leverrier

备注：
In an independent and concurrent work, Fehr and Fillinger [FF15] proved a general composition theorem for two-prover commitments which implies a similar bound on the security of the Lunghi et al. protocol than the one derived here
发表信息：
Phys. Rev. Lett. 115, 250501 (2015)
阅读 PDF
arXiv 页面 ↗HTML 原文 ↗

摘要：

我们认为最近的相对论位承诺协议介绍了Lunghi等人。2015]并提出针对经典攻击的新安全分析。特别是，虽然该协议的初始复杂度与承诺时间呈双指数关系，但我们的分析表明，正确的依赖性仅是线性的。这在实现方面具有戏剧性的影响：特别是，承诺时间可以很容易地任意长，只需要双方进行经典通信和执行有效的经典计算。

英文摘要：

We consider the recent relativistic bit commitment protocol introduced by Lunghi et al. [Phys. Rev. Lett. 2015] and present a new security analysis against classical attacks. In particular, while the initial complexity of the protocol scaled double-exponentially with the commitment time, our analysis shows that the correct dependence is only linear. This has dramatic implications in terms of implementation: in particular, the commitment time can easily be made arbitrarily long, by only requiring both parties to communicate classically and perform efficient classical computation.

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

↑