Multiparty Quantum Key Agreement Based on Quantum Search Algorithm

Quantum key agreement is an important topic that the shared key must be negotiated equally by all participants, and any nontrivial subset of participants cannot fully determine the shared key. To date, the embed modes of subkey in all the previously proposed quantum key agreement protocols are based...

Full description

Saved in:
Bibliographic Details
Published inScientific reports Vol. 7; no. 1; p. 45046
Main Authors Cao, Hao, Ma, Wenping
Format Journal Article
LanguageEnglish
Published London Nature Publishing Group UK 23.03.2017
Nature Publishing Group
Subjects
Online AccessGet full text
ISSN2045-2322
2045-2322
DOI10.1038/srep45046

Cover

More Information
Summary:Quantum key agreement is an important topic that the shared key must be negotiated equally by all participants, and any nontrivial subset of participants cannot fully determine the shared key. To date, the embed modes of subkey in all the previously proposed quantum key agreement protocols are based on either BB84 or entangled states. The research of the quantum key agreement protocol based on quantum search algorithms is still blank. In this paper, on the basis of investigating the properties of quantum search algorithms, we propose the first quantum key agreement protocol whose embed mode of subkey is based on a quantum search algorithm known as Grover’s algorithm. A novel example of protocols with 5 – party is presented. The efficiency analysis shows that our protocol is prior to existing MQKA protocols. Furthermore it is secure against both external attack and internal attacks.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
content type line 23
ISSN:2045-2322
2045-2322
DOI:10.1038/srep45046