Huang et al. (2021) introduced a quantum key agreement scheme using a quantum search algorithm. They initially designed a two-party protocol, later extending it to accommodate three-or N-party scenarios. Notably, Huang et al.'s protocol avoids the need for complex quantum technologies such as entangled quantum particles. However, it is observed that Huang et al.'s protocol imposes a burden on a single participant when applied to multiparty scenarios. This paper contends that such centralization to a single participant is suboptimal for multiparty settings. Thus, our work seeks to build upon the foundations laid by Huang et al. in a manner that addresses this limitation, presenting a modified framework tailored to accommodate multiparty scenarios while distributing computational responsibilities more evenly among participants.
Huang et al. (2021) introduced a quantum key agreement scheme using a quantum search algorithm. They initially designed a two-party protocol, later extending it to accommodate three-or N-party scenarios. Notably, Huang et al.'s protocol avoids the need for complex quantum technologies such as entangled quantum particles. However, it is observed that Huang et al.'s protocol imposes a burden on a single participant when applied to multiparty scenarios. This paper contends that such centralization to a single participant is suboptimal for multiparty settings. Thus, our work seeks to build upon the foundations laid by Huang et al. in a manner that addresses this limitation, presenting a modified framework tailored to accommodate multiparty scenarios while distributing computational responsibilities more evenly among participants.
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.
Multiparty quantum key agreement (MQKA) is a significant topic that the shared key must be negotiated equally by all participants. In this paper, we use Bell state as quantum resource and add controlled-not gate to avoid information leakage. There is very little research on the quantum key agreement protocol based on quantum search algorithms. Therefore, we propose a quantum key agreement protocol which is based on Grover’s algorithm as one of the most famous quantum search algorithms. The security analysis appears very promising.
In this study, we propose a single-state multi-party quantum key agreement (MQKA) protocol with single-particle measurement. Firstly, a single-state three-party quantum key agreement protocol with single-particle measurement is introduced, followed by a security analysis that validated its capability to resist potential internal and external attacks. Furthermore, we utilize multi-particle entangled states to present a multi-party version of the single-state multi-party quantum key agreement with single-particle measurement. In comparison to previous MQKA protocols, our approach presents the following advantages: it employs one kind of multi-particle entangled state as the quantum resource; eliminates the need for entanglement swapping techniques, unitary operations, or pre-shared keys between participants; uses only the X measurement basis and Z measurement basis; transmits fewer qubits; consumes fewer qubits; and has higher qubit efficiency.
In this paper, we discuss in some detail how multiparty quantum key agreement protocols must be carefully designed and present a collusion attack to illustrate this point. Then, a secure circle-type multiparty quantum key agreement with Bell states is proposed. Bell states are used as the information carriers and transmitted among the participants, who embed their secrets into the traveling particles via certain encoding operations. In this way, all participants simultaneously obtain the same agreement key, i.e., the sum of their secret inputs, at the end of the protocol. Here, quantum state discrimination is utilized to design the encoding operations, which ensures that the proposed protocol is correct and secure against the presented collusion attack. Furthermore, it is shown that the proposed protocol satisfies three conditions of a secure quantum key agreement protocol in theory. In addition, these encoding operations consist of some common single-qubit gates, the Hadamard operator and four Pauli operators, which makes the proposed protocol feasible using current technology.
As a burgeoning branch of quantum cryptography, quantum key agreement is a kind of key establishing processes where the security and fairness of the established common key should be guaranteed simultaneously. However, the difficulty on designing a qualified quantum key agreement protocol increases significantly with the increase of the number of the involved participants. Thus far, only few of the existing multiparty quantum key agreement (MQKA) protocols can really achieve security and fairness. Nevertheless, these qualified MQKA protocols are either too inefficient or too impractical. In this paper, an MQKA protocol is proposed with single photons in travelling mode. Since only one eavesdropping detection is needed in the proposed protocol, the qubit efficiency and measurement efficiency of it are higher than those of the existing ones in theory. Compared with the protocols which make use of the entangled states or multi-particle measurements, the proposed protocol is more feasible with the current technologies. Security and fairness analysis shows that the proposed protocol is not only immune to the attacks from external eavesdroppers, but also free from the attacks from internal betrayers.
Although there are many quantum key agreement protocols currently in existence, they cannot be merged in terms of resource utilisation, efficiency, security, and other aspects, and there are also significant differences in the nature of two and more parties. Therefore, it is necessary to design a quantum key agreement protocol that can balance efficiency and security and is suitable for multiple participants. In view of this, this paper proposes a multi-party quantum key agreement protocol based on a new coding mode of bell state: temporary session keys are negotiated between adjacent participants, and then shared keys for all participants are negotiated through the exchange, conversion, and computation of quantum resources. During the implementation of the protocol, not only can the identity of the participants be authenticated, but also the quantum resources used are single, and the quantum operations performed are simple. Moreover, efficiency is fixed and does not decrease due to the increase of participants or quantum resources. In addition, the protocol also allows participants to dynamically join and leave. In terms of security, the protocol can resist most common quantum attacks. Under the existing quantum technology, this protocol is completely feasible.