Efficient multiparty quantum key agreement with collective detection

Huang, Wei; Su, Qi; Liu, Bin; He, Yuan-Hang; Fan, Fan; Xu, Bingjie

doi:10.1038/s41598-017-15227-6

Cited by 28 publications

(21 citation statements)

References 65 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Comparing with previous QKA protocols under this definition of protocol efficiency, i.e. protocols with single photons [15,20,27,29], protocols with Bell states [21,24,30], our protocol possess a higher efficiency in the three-party cases. This is because of dense-coding method which enables one qubit to carry two bits of information being used in the protocol.…”

Section: Discussion and Summarymentioning

confidence: 79%

“…This is because of dense-coding method which enables one qubit to carry two bits of information being used in the protocol. It should make sense that we use the method of inserting some single photons rather than using control strings and performing rotation operations [26,27,29] to prevent the inside attacks. With one encoding operation being performed, participant in those protocols can only encode one bit information on one photon while he can encode two bits in our protocol.…”

Section: Discussion and Summarymentioning

confidence: 99%

“…In order to decode the message, participants in Ref. [26,27,29] need to exchange their control strings which are as long as the final shared key. While in our protocol, they only need to exchange very little information about the positions of those single photons.…”

Section: Discussion and Summarymentioning

confidence: 99%

“…Subsequently, Cao et al [28] proposed a MQKA protocol based on quantum search algorithm. Recently, Huang et al [29] put forward a MQKA protocol with collective detection and rotation operations. Up to now, many other different QKA protocols have been proposed [30,31,32,33,34,35,36].…”

mentioning

confidence: 99%

See 3 more Smart Citations

High-Efficiency Three-Party Quantum Key Agreement Protocol with Quantum Dense Coding and Bell States

Wang

Zhang

et al. 2019

Int J Theor Phys

View full text Add to dashboard Cite

We propose a high-efficiency three-party quantum key agreement protocol, by utilizing two-photon polarization-entangled Bell states and a few single-photon polarization states as the information carriers, and we use the quantum dense coding method to improve its efficiency. In this protocol, each participant performs one of four unitary operations to encode their sub-secret key on the passing photons which contain two parts, the first quantum qubits of Bell states and a small number of single-photon states. At the end of this protocol, based on very little information announced by other, all participants involved can deduce the same final shared key simultaneously. We analyze the security and the efficiency of this protocol, showing that it has a high efficiency and can resist both outside attacks and inside attacks. As a consequence, our protocol is a secure and efficient three-party quantum key agreement protocol.Quantum communication provides an unconditionally secure way for the transmission of information, by exploiting the principles in quantum mechanics. In recent decades, this field gains much attention of researchers all over the world. There are many important branches of quantum communication for different tasks, such as quantum key distribution (QKD) [1,2,3], quantum secure direct communication (QSDC) [4,5,6,7,8,9,10,11,12], quantum secret sharing (QSS) [13], and so on. QKD supplies a secure way for two remote legitimate parties to create a private key [1,2,3]. The parties in QKD can detect the eavesdropper, say Eve, if she monitors their quantum channel, by picking up a subset of their outcomes obtained with two nonorthogonal measuring bases to check eavesdropping. They can then discard the outcomes when they find Eve. Far different from QKD, QSDC gives an absolutely secure approach for two parties to transmit their secret message directly, without producing the private key in advance. The first QSDC scheme was proposed by Long and Liu [4] and it exploits the properties of Bell states and uses a block transmission technique in 2002. Subsequently, Deng, Long, and Liu [5] clarified the standard criterion for QSDC explicitly in 2003, and they proposed an important two-step QSDC protocol by using the Einstein-Podolsky-Rosen photon pair blocks . Recently, these two-step QSDC protocols [4,5] were experimentally implemented by two groups [6,7]. In 2004, Deng and Long [8] introduced the first QSDC protocol based on a sequence of single photons, called quantum one-time pad scheme which has been recently experimentally demonstrated by Hu et al. [9] in a noisy environment with frequency coding. In 2017, Wu et al. [10] proposed a high-capacity QSDC protocol with two-photon six-qubit hyperentangled states. QSS is used to share a secret key among some agents of a boss [13], in which the agents can reconstruct the secret if and only if they collaborate. QSS has a higher requirement than QKD because a potentially dishonest agent may injure the benefit of the boss. The inside attacks will increase largely the diffic...

show abstract

Section: Discussion and Summarymentioning

confidence: 79%

Section: Discussion and Summarymentioning

confidence: 99%

Section: Discussion and Summarymentioning

confidence: 99%

mentioning

confidence: 99%

See 2 more Smart Citations

High-Efficiency Three-Party Quantum Key Agreement Protocol with Quantum Dense Coding and Bell States

Wang

Zhang

et al. 2019

Int J Theor Phys

View full text Add to dashboard Cite

show abstract

“…information processing, encrypted transmission, machine learning, etc.) has also achieved some important results, such as quantum key agreement (QKA) [6], [7], quantum secure direct communication (QSDC) [8], [9], quantum teleportation and remote state preparation (QT&RSP) [10]- [12], quantum steganography (QS) [13]- [15], delegating quantum computation (DQC) [16], [17], and quantum machine learning [18], [19].…”

Section: Introductionmentioning

confidence: 99%

A Unitary Weights Based One-Iteration Quantum Perceptron Algorithm for Non-Ideal Training Sets

et al. 2019

View full text Add to dashboard Cite

In order to solve the problem of non-ideal training sets (i.e., the less-complete or overcomplete sets) and implement one-iteration learning, a novel efficient quantum perceptron algorithm based on unitary weights is proposed, where the singular value decomposition of the total weight matrix from the training set is calculated to make the weight matrix to be unitary. The example validation of quantum gates {H, S, T, CNOT, Toffoli, Fredkin} shows that our algorithm can accurately implement arbitrary quantum gates within one iteration. The performance comparison between our algorithm and other quantum perceptron algorithms demonstrates the advantages of our algorithm in terms of applicability, accuracy, and availability. For further validating the applicability of our algorithm, a quantum composite gate which consists of several basic quantum gates is also illustrated. INDEX TERMS Quantum perceptron, unitary weight, one-iteration learning, non-ideal training set, singular value decomposition, universal quantum gates.

show abstract