Collusive attacks to “circle-type” multi-party quantum key agreement protocols

详细信息    查看全文

• 作者：Bin Liu ; Di Xiao ; Heng-Yue Jia ; Run-Zong Liu
• 刊名：Quantum Information Processing
• 出版年：2016
• 出版时间：May 2016
• 年：2016
• 卷：15
• 期：5
• 页码：2113-2124
• 全文大小：605 KB
• 刊物类别：Physics and Astronomy
• 刊物主题：Physics
  Physics
  Mathematics
  Engineering, general
  Computer Science, general
  Characterization and Evaluation Materials
  
• 出版者：Springer Netherlands
• ISSN：1573-1332
• 卷排序：15

文摘

We find that existing multi-party quantum key agreement (MQKA) protocols designed for fairness of the key are, in fact, unfair. Our analysis shows that these protocols are sensitive to collusive attacks; that is, dishonest participants can collaborate in predetermining the key without being detected. In fact, the transmission structures of the quantum particles in those unfair MQKA protocols, three of which have already been analyzed, have much in common. We call these unfair MQKA protocols circle-type MQKA protocols. Likewise, the transmission structures of the quantum particles in MQKA protocols that can resist collusive attacks are also similar. We call such protocols complete-graph-type MQKA protocols. A MQKA protocol also exists that can resist the above attacks but is still not fair, and we call it the tree-type MQKA protocol. We first point out a common, easily missed loophole that severely compromises the fairness of present circle-type MQKA protocols. Then we show that two dishonest participants at special positions can totally predetermine the key generated by circle-type MQKA protocols. We anticipate that our observations will contribute to secure and fair MQKA protocols, especially circle-type protocols.KeywordsQuantum key agreementQuantum cryptographyQuantum informationCollusive attack