New Fair Multiparty Quantum Key Agreement Secure against Collusive Attacks

AbstractFairness is an important standard needed to be considered in a secure quantum key agreement (QKA) protocol. However, it found that most of the quantum key agreement protocols in the travelling model are not fair, i.e., some of the dishonest participants can collaborate to predetermine the final key without being detected. Thus, how to construct a fair and secure key agreement protocol has obtained much attention. In this paper, a new fair multiparty QKA protocol that can resist the collusive attack is proposed. More specifically, we show that in a client-server scenario, it is possible for the clients to share a key and reveal nothing about what key has been agreed upon to the server. The server prepares quantum states for clients to encode messages to avoid the participants’ collusive attack. This construction improves on previous work, which requires either preparing multiple quantum resources by clients or two-way quantum communication. It is proven that the protocol does not reveal to any eavesdropper, including the server, what key has been agreed upon, and the dishonest participants can be prevented from collaborating to predetermine the final key.

Download Full-text

Secure multiparty quantum key agreement against collusive attacks

Scientific Reports ◽

10.1038/s41598-021-88837-w ◽

2021 ◽

Vol 11 (1) ◽

Author(s):

Hussein Abulkasim ◽

Atefeh Mashatan ◽

Shohini Ghose

Keyword(s):

Key Agreement ◽

Sensitive Information ◽

Quantum Key Agreement ◽

Key Agreement Protocol ◽

Proposed Model ◽

Shared Key ◽

Agreement Protocols ◽

Collusive Attacks ◽

Attack Strategy ◽

Collusive Attack

AbstractQuantum key agreement enables remote participants to fairly establish a secure shared key based on their private inputs. In the circular-type multiparty quantum key agreement mode, two or more malicious participants can collude together to steal private inputs of honest participants or to generate the final key alone. In this work, we focus on a powerful collusive attack strategy in which two or more malicious participants in particular positions, can learn sensitive information or generate the final key alone without revealing their malicious behaviour. Many of the current circular-type multiparty quantum key agreement protocols are not secure against this collusive attack strategy. As an example, we analyze the security of a recently proposed multiparty key agreement protocol to show the vulnerability of existing circular-type multiparty quantum key agreement protocols against this collusive attack. Moreover, we design a general secure multiparty key agreement model that would remove this vulnerability from such circular-type key agreement protocols and describe the necessary steps to implement this model. The proposed model is general and does not depend on the specific physical implementation of the quantum key agreement.

Download Full-text

Two-party quantum key agreement protocol with four-particle entangled states

Modern Physics Letters B ◽

10.1142/s0217984916503322 ◽

2016 ◽

Vol 30 (26) ◽

pp. 1650332 ◽

Cited By ~ 6

Author(s):

Yefeng He ◽

Wenping Ma

Keyword(s):

Key Agreement ◽

Security Analysis ◽

Information Leakage ◽

Quantum States ◽

Entangled States ◽

Correlation Property ◽

Quantum Key Agreement ◽

Key Agreement Protocol ◽

Delayed Measurement ◽

Quantum Key Agreement Protocol

Based on four-particle entangled states and the delayed measurement technique, a two-party quantum key agreement protocol is proposed in this paper. In the protocol, two participants can deduce the measurement results of each other’s initial quantum states in terms of the measurement correlation property of four-particle entangled states. According to the corresponding initial quantum states deduced by themselves, two parties can extract the secret keys of each other by using the publicly announced value or by performing the delayed measurement, respectively. This guarantees the fair establishment of a shared key. Since each particle in quantum channel is transmitted only once, the protocol is congenitally free from the Trojan horse attacks. The security analysis shows that the protocol not only can resist against both participant and outsider attacks but also has no information leakage problem. Moreover, it has high qubit efficiency.

Download Full-text

Multi-party quantum key agreement with teleportation

Modern Physics Letters B ◽

10.1142/s0217984917501020 ◽

2017 ◽

Vol 31 (10) ◽

pp. 1750102 ◽

Cited By ~ 9

Author(s):

Binbin Cai ◽

Gongde Guo ◽

Song Lin

Keyword(s):

Quantum Teleportation ◽

Key Agreement ◽

Security Analysis ◽

Quantum States ◽

Quantum Key Agreement ◽

Quantum Channels ◽

Secret Key ◽

Key Agreement Protocol ◽

Shared Key ◽

Quantum Key Agreement Protocol

Based on the technique of quantum teleportation, a new multi-party quantum key agreement protocol is proposed. In this protocol, all users first share EPR pairs via public quantum channels. Afterwards, the states of signal particles can be transferred between two adjacent users by quantum teleportation. With the help of four unitary encoding operations, all users can encode their separate secret key into the traveling quantum states. In the end, all users can derive the final shared key synchronously. The security analysis shows that the presented protocol is secure against some common attacks and completely loss tolerant.

Download Full-text

Multi-party traveling-mode quantum key agreement protocols immune to collusive attack

Quantum Information Processing ◽

10.1007/s11128-018-1993-8 ◽

2018 ◽

Vol 17 (9) ◽

Cited By ~ 6

Author(s):

Hao Cao ◽

Wenping Ma

Keyword(s):

Key Agreement ◽

Quantum Key Agreement ◽

Agreement Protocols ◽

Collusive Attack

Download Full-text

Highly Efficient Symmetric Key Based Authentication and Key Agreement Protocol Using Keccak

Sensors ◽

10.3390/s20082160 ◽

2020 ◽

Vol 20 (8) ◽

pp. 2160 ◽

Cited By ~ 2

Author(s):

An Braeken

Keyword(s):

Efficient Solution ◽

Key Agreement ◽

Client Server ◽

Authentication And Key Agreement ◽

Server Side ◽

Key Agreement Protocol ◽

Highly Efficient ◽

Symmetric Key ◽

Client Side ◽

Agreement Protocols

Efficient authentication and key agreement protocols between two entities are required in many application areas. In particular, for client–server type of architectures, the client is mostly represented by a constrained device and thus highly efficient protocols are needed. We propose in this paper two protocols enabling the construction of a mutual authenticated key ensuring anonymity and unlinkability of the client and resisting the most well known attacks. The main difference between the two proposed protocols is in the storage requirements on the server side. The innovation of our protocols relies on the fact that, thanks to the usage of the sponge construction, available in the newly proposed SHA3 standard with underlying Keccak design, the computation cost can be reduced to only one hash operation on the client side in case of the protocol with storage and two hash operations for the protocol without storage and thus leads to a very efficient solution.

Download Full-text