...
【24h】

An Efficient Protocol for the Secure Multi-party Quantum Summation

机译:安全多方量子求和的高效协议

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

摘要

In this paper, a new and efficient quantum protocol which allows a group of mutually distrustful players to perform the summation computation is proposed. Different from previous protocols, we utilize the multi-particle entangled states as the information carriers. A third party, i.e. TP, is assumed semi-honest in the two-party quantum summation protocol. All various kinds of outside attacks and participant attacks are discussed in detail. In addition, we code all players' Bell-basis measurement outcomes into one classical bit (cbit). Not only the cost of classical information in the public communication network is decreased, but also the security of the protocol is improved. The protocol is also generalized into multi-party quantum summation. It is secure for the collusive attack performed by at most n-2 players.
机译:在本文中,提出了一种新的和高效的量子协议,其允许一组相互信任的玩家来执行求和计算。 与以前的协议不同,我们利用多粒子纠缠状态作为信息载体。 第三方,即TP,在双方量子求和协议中发现半诚实。 详细讨论各种外部攻击和参与者攻击。 此外,我们将所有玩家的贝基测量结果编写为一个经典位(Cbit)。 不仅有公共通信网络中的经典信息的成本减少,而且还提高了协议的安全性。 该协议也普遍化为多方量子求和。 它是由大多数N-2玩家执行的侵入攻击是安全的。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号