arXiv quant-ph/00040172000-04-04quant-ph

量子比特托管

Quantum Bit Escrow

Dorit Aharonov, Amnon Ta-Shma, Umesh Vazirani, Andrew Yao

备注：: 10 pages. To appear in STOC 2000 (Proceedings of the Thirty Second Annual ACM Symposium on Theory Of Computing.)

摘要：

无条件安全的比特承诺和抛硬币在经典世界中是不可能的。比特承诺在量子世界中也是不可能的。我们引入了一个相关的新原语- { \em量子比特托管}。在这个原语中，Alice向Bob提交了一个比特$b$。承诺是{ \em binding}，在这个意义上，如果Alice被要求透露比特，Alice不能在没有被检测到欺骗的良好概率的情况下偏置她的承诺。承诺是{ \em sealing}，在这个意义上，如果Bob学习了关于编码位的信息，那么如果以后他被要求证明他是诚实地玩，他以很大的概率被检测到作弊。严格证明量子密码协议的正确性已被证明是一项艰巨的任务。我们开发的技术来证明量子比特托管协议的绑定和密封性能的定量陈述。我们构建的一个相关的原始协议是量子偏置硬币翻转协议，其中没有玩家可以控制游戏，即，即使是全能的作弊者也必须以某种恒定的概率输掉，这与经典世界形成鲜明对比，在经典世界中，这种协议是不可能的。

英文摘要：

Unconditionally secure bit commitment and coin flipping are known to be impossible in the classical world. Bit commitment is known to be impossible also in the quantum world. We introduce a related new primitive - {\em quantum bit escrow}. In this primitive Alice commits to a bit $b$ to Bob. The commitment is {\em binding} in the sense that if Alice is asked to reveal the bit, Alice can not bias her commitment without having a good probability of being detected cheating. The commitment is {\em sealing} in the sense that if Bob learns information about the encoded bit, then if later on he is asked to prove he was playing honestly, he is detected cheating with a good probability. Rigorously proving the correctness of quantum cryptographic protocols has proved to be a difficult task. We develop techniques to prove quantitative statements about the binding and sealing properties of the quantum bit escrow protocol. A related primitive we construct is a quantum biased coin flipping protocol where no player can control the game, i.e., even an all-powerful cheating player must lose with some constant probability, which stands in sharp contrast to the classical world where such protocols are impossible.

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

摘要：

英文摘要：

相关论文