Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

CRC Press eBooks

Semi-quantum private comparison protocol with graph state

Chia‐Wei Tsai, Jyun-Jie Hong, Y.-J. Lee, Jason Lin, Chun‐Wei Yang

Published Dec 12, 2023• 1 citation
Publisher

Abstract

The quantum private comparison (QPC) protocol is an important research issue in the quantum secure computation field. The participants obtain the relational comparison between each other private messages without leaking any secret information by QPC protocol. In order to improve the practicality of quantum secure communication protocol, the semi-quantum concept was proposed to let the users who only have limited quantum capabilities (called the classical users) can also achieve the quantum secure communication protocol. According to the semi-quantum concept, this study proposes a semi-quantum private comparison (SQPC) protocol using a measurement property of a graph state https://www.w3.org/1998/Math/MathML" display="inline"> |G ⟩ 123 = 1 2 2 000 + 001 + 010 − 011 + 100 − 101 − 110 − | 111 ⟩ 123 https://www.w3.org/1999/xlink" xlink:href=" https://s3-euw1-ap-pe-df-pch-content-public-p.s3.eu-west-1.amazonaws.com/9781003460763/a1dd00af-5f0d-42a5-a080-674b9e863cf3/content/inline-math11_1.tif "/> . The proposed SQPC protocol lets the two classical users can compare whether their private messages are equal or not with the assistance of a dishonest three-party quantum user (TP), in which TP owns the complete quantum capabilities and the classical users only equip the two quantum devices including (1) Hadamard operation and (2) Z-basis https://www.w3.org/1998/Math/MathML" display="inline"> 0 , | 1 ⟩ https://www.w3.org/1999/xlink" xlink:href=" https://s3-euw1-ap-pe-df-pch-content-public-p.s3.eu-west-1.amazonaws.com/9781003460763/a1dd00af-5f0d-42a5-a080-674b9e863cf3/content/inline-math11_2.tif "/> measurement. Because the one-way qubit transmission is adopted, the proposed SQPC protocol is free from quantum Trojan horse attack. Moreover, a security analysis also is given to prove that the proposed SQPC is robust under the collective attack.

DOI
10.1201/9781003460763-11

Related papers

Novel semi-quantum private comparison protocol with Bell states

Li‐Hua Gong, Mao-Long Li, Hao Cao +1 more

Abstract Based on Bell states, a new semi-quantum private comparison protocol is proposed that enables two classical users to securely compare the equality of their private information with the aid of a semi-honest third party. Different from the existing semi-quantum private comparison protocols, the two classical participants in the presented protocol do not need to measure and prepare any quantum state, which not only reduces the consumption of quantum devices, but also greatly improves the feasibility of the protocol. Performing different unitary operations on the received particles, classical users can securely compare their secret information. Besides, the devised protocol has higher qubit efficiency than the other similar counterparts, since participants can compare a two-bit privacy each time with one qubit. Meanwhile, after completing the comparison process, all Bell states could be reused since they still retain the corresponding entanglement property, which greatly facilitates the recycle of quantum resources. Security analyses indicate that the designed scheme is secure against external attack and internal attack. Moreover, the operations involved in our scheme are simulated on the IBM Quantum Experience to demonstrate the effectiveness and security of our scheme.

Laser Physics Letters•Apr 10, 2024•60 citations

8 Puzzle

Andreas Wichert

The n -puzzle is a classical problem for modeling algorithms. For n -puzzle there are https://www.w3.org/1998/Math/MathML" display="inline"> n + 1 https://www.w3.org/1999/xlink" xlink:href=" https://s3-euw1-ap-pe-df-pch-content-public-p.s3.eu-west-1.amazonaws.com/9781003374404/4745344c-4074-4386-85e6-ca8a3849de1f/content/math10_1.tif "/> different objects: n cells and one empty cell. Each object can be coded by https://www.w3.org/1998/Math/MathML" display="inline"> ρ = ⌈ log 2 ⁡ n + 1 ⌉ https://www.w3.org/1999/xlink" xlink:href=" https://s3-euw1-ap-pe-df-pch-content-public-p.s3.eu-west-1.amazonaws.com/9781003374404/4745344c-4074-4386-85e6-ca8a3849de1f/content/math10_2.tif "/> qubits and a configuration of https://www.w3.org/1998/Math/MathML" display="inline"> n + 1 https://www.w3.org/1999/xlink" xlink:href=" https://s3-euw1-ap-pe-df-pch-content-public-p.s3.eu-west-1.amazonaws.com/9781003374404/4745344c-4074-4386-85e6-ca8a3849de1f/content/math10_3.tif "/> objects can be represented by a register of https://www.w3.org/1998/Math/MathML" display="inline"> z := ρ ⋅ ( n + 1 ) https://www.w3.org/1999/xlink" xlink:href=" https://s3-euw1-ap-pe-df-pch-content-public-p.s3.eu-west-1.amazonaws.com/9781003374404/4745344c-4074-4386-85e6-ca8a3849de1f/content/math10_4.tif "/> qubits https://www.w3.org/1998/Math/MathML" display="inline"> | x ⟩ https://www.w3.org/1999/xlink" xlink:href=" https://s3-euw1-ap-pe-df-pch-content-public-p.s3.eu-west-1.amazonaws.com/9781003374404/4745344c-4074-4386-85e6-ca8a3849de1f/content/math10_5.tif "/> . The function https://www.w3.org/1998/Math/MathML" display="inline"> g ( x ) https://www.w3.org/1999/xlink" xlink:href=" https://s3-euw1-ap-pe-df-pch-content-public-p.s3.eu-west-1.amazonaws.com/9781003374404/4745344c-4074-4386-85e6-ca8a3849de1f/content/math10_6.tif "/> is represented a unitary operator T . T acts on the https://www.w3.org/1998/Math/MathML" display="inline"> z + 1 https://www.w3.org/1999/xlink" xlink:href=" https://s3-euw1-ap-pe-df-pch-content-public-p.s3.eu-west-1.amazonaws.com/9781003374404/4745344c-4074-4386-85e6-ca8a3849de1f/content/math10_7.tif "/> qubits with https://www.w3.org/1998/Math/MathML" display="inline"> x ∈ B z https://www.w3.org/1999/xlink" xlink:href=" https://s3-euw1-ap-pe-df-pch-content-public-p.s3.eu-west-1.amazonaws.com/9781003374404/4745344c-4074-4386-85e6-ca8a3849de1f/content/math10_8.tif "/> and https://www.w3.org/1998/Math/MathML" display="inline"> c ∈ B 1 https://www.w3.org/1999/xlink" xlink:href=" https://s3-euw1-ap-pe-df-pch-content-public-p.s3.eu-west-1.amazonaws.com/9781003374404/4745344c-4074-4386-85e6-ca8a3849de1f/content/math10_9.tif "/> https://www.w3.org/1998/Math/MathML" display="block"> T ⋅ | x ⟩ | c ⟩ = | x ⟩ | f ( x ) ⊕ c ⟩ . https://www.w3.org/1999/xlink" xlink:href=" https://s3-euw1-ap-pe-df-pch-content-public-p.s3.eu-west-1.amazonaws.com/9781003374404/4745344c-4074-4386-85e6-ca8a3849de1f/content/math10_10.tif "/>

Chapman & Hall/CRC eBooks•Nov 28, 2023•0 citations

Single-state semiquantum private comparison based on Bell entangled states.

Mao-Jie Geng, Ying Chen, Tian-Jie Xu +1 more

In this paper, a novel semiquantum private comparison (SQPC) protocol based on single kind of Bell entangled states is proposed, which allows two classical parties to judge the equality of their private inputs securely and correctly under the help of a semi-honest third party (TP) who possesses complete quantum capabilities. TP is allowed to misbehave on her own but cannot conspire with anyone else. Our protocol does not need to share secret keys among different participants in advance, and needs neither unitary operations nor quantum entanglement swapping. Moreover, our protocol only needs to prepare single kind of Bell entangled states as initial quantum resource. Detailed security analysis turns out that our protocol is secure against various outside and participant attacks. Compared with most of the existing SQPC protocols based on Bell entangled states, our protocol is more feasible in practice.

•Nov 27, 2021•0 citations

Quantum measurement 1

Helmut Bez, Tony Croft

In this chapter, the simplest quantum measurement situation, i.e., where the state is an eigenvector of the observable to be measured, is considered. The states are therefore non-superimposed and measurement Axiom 3.2 of Section 13.7 in the previous chapter is applicable. We consider states in https://www.w3.org/1998/Math/MathML" display="inline"> ℂ 2 , ℂ 2 ⊗ ℂ 2 https://www.w3.org/1999/xlink" xlink:href=" https://s3-euw1-ap-pe-df-pch-content-public-p.s3.eu-west-1.amazonaws.com/9781003264569/7139ce19-0d58-4a0c-820f-b76fb033e438/content/math14_1.tif "/> and https://www.w3.org/1998/Math/MathML" display="inline"> ℂ 2 ⊗ ℂ 2 ⊗ ℂ 2 https://www.w3.org/1999/xlink" xlink:href=" https://s3-euw1-ap-pe-df-pch-content-public-p.s3.eu-west-1.amazonaws.com/9781003264569/7139ce19-0d58-4a0c-820f-b76fb033e438/content/math14_2.tif "/> . The generalisation to https://www.w3.org/1998/Math/MathML" display="inline"> ⊗ n ℂ 2 https://www.w3.org/1999/xlink" xlink:href=" https://s3-euw1-ap-pe-df-pch-content-public-p.s3.eu-west-1.amazonaws.com/9781003264569/7139ce19-0d58-4a0c-820f-b76fb033e438/content/math14_3.tif "/> is then clear.

Chapman & Hall/CRC eBooks•Jan 6, 2023•0 citations

A Novel Semi-quantum Private Comparison Scheme Using Bell Entangle States

Yuhua Sun, Lili Yan, Zhibin Sun +1 more

Private comparison is the basis of many encryption technologies, and several related Quantum Private Comparison (QPC) protocols have been published in recent years. In these existing protocols, secret information is encoded by using conjugate coding or orthogonal states, and all users are quantum participants. In this paper, a novel semi-quantum private comparison scheme is proposed, which employs Bell entangled states as quantum resources. Two semi-quantum participants compare the equivalence of their private information with the help of a semi-honest third party (TP). Compared with the previous classical protocols, these two semi-quantum users can only make some particular action, such as to measure, prepare and reflect quantum qubits only in the classical basis {|0⟩,|1⟩} , and TP needs to perform Bell basis measurement on reflecting qubits to obtain the results of the comparison. Further, analysis results show that this scheme can avoid outside and participant attacks and its’ qubit efficiency is better than the other two protocols mentioned in the paper.

Computers, materials & continua/Computers, materials & continua (Print)•Jan 1, 2021•11 citations

Lightweight Secure Key Authentication Scheme for Industrial Internet of Things

M Anoop, Ismail Mohamed Keshta, Vrince Vimal +2 more

In recent years, Industrial Internet of Things (IIoT) technologies based on group information sharing have been widely applied in industrial manufacturing and global trade due to their real-time, secure, and interoperable characteristics. However, most of these technologies rely on group key negotiation protocols, which suffer from drawbacks such as high overhead, weak security, and low scalability. Therefore, designing secure and efficient group key negotiation protocols has become a scientific challenge that needs to be addressed. In this paper, a fully structured group key negotiation protocol is proposed using the mathematical structure of balanced incomplete block designs and an elliptic curve Qu-Vanstone (ECQV) authentication protocol. Firstly, to reduce the computational overhead of the protocol, the ECQV authentication protocol is utilized to avoid performing pairing operations. Then, to prove the security of the protocol, security proofs are conducted based on the elliptic curve decisional Diffie–Hellman assumption. Lastly, to reduce the communication overhead and improve the scalability of the protocol, an extension to existing group key negotiation protocols is proposed using asymmetric balanced incomplete block designs, increasing the supported number of members from https://www.w3.org/1998/Math/MathML" display="inline"> q 2 https://www.w3.org/1999/xlink" xlink:href=" https://s3-euw1-ap-pe-df-pch-content-public-p.s3.eu-west-1.amazonaws.com/9781003466284/c64b8b66-5b04-4d90-b345-58effd21948c/content/math6_1.tif "/> to https://www.w3.org/1998/Math/MathML" display="inline"> q 2 https://www.w3.org/1999/xlink" xlink:href=" https://s3-euw1-ap-pe-df-pch-content-public-p.s3.eu-west-1.amazonaws.com/9781003466284/c64b8b66-5b04-4d90-b345-58effd21948c/content/math6_2.tif "/> and https://www.w3.org/1998/Math/MathML" display="inline"> q 2 + q + 1 https://www.w3.org/1999/xlink" xlink:href=" https://s3-euw1-ap-pe-df-pch-content-public-p.s3.eu-west-1.amazonaws.com/9781003466284/c64b8b66-5b04-4d90-b345-58effd21948c/content/math6_3.tif "/> . Experimental results demonstrate that the proposed protocol can reduce computational overhead to https://www.w3.org/1998/Math/MathML" display="inline"> O n n m https://www.w3.org/1999/xlink" xlink:href=" https://s3-euw1-ap-pe-df-pch-content-public-p.s3.eu-west-1.amazonaws.com/9781003466284/c64b8b66-5b04-4d90-b345-58effd21948c/content/math6_4.tif "/> and communication overhead to https://www.w3.org/1998/Math/MathML" display="inline"> O n n https://www.w3.org/1999/xlink" xlink:href=" https://s3-euw1-ap-pe-df-pch-content-public-p.s3.eu-west-1.amazonaws.com/9781003466284/c64b8b66-5b04-4d90-b345-58effd21948c/content/math6_5.tif "/> . The protocol ensures resistance against chosen plaintext attacks while allowing flexible adaptation of the number of participants in group key negotiation protocols, thereby enhancing both the security and efficiency of the protocol.

CRC Press eBooks•Sep 3, 2024•1 citation
The quantum private comparison (QPC) protocol is an important research issue in the quantum secure computation field. The participants obtain the relational comparison between each other private messages without leaking any secret information by QPC protocol. In order to improve the practicality of quantum secure communication protocol, the semi-quantum concept was proposed to let the users who only have limited quantum capabilities (called the classical users) can also achieve the quantum secure communication protocol. According to the semi-quantum concept, this study proposes a semi-quantum private comparison (SQPC) protocol using a measurement property of a graph state https://www.w3.org/1998/Math/MathML" display="inline"> |G ⟩ 123 = 1 2 2 000 + 001 + 010 − 011 + 100 − 101 − 110 − | 111 ⟩ 123 https://www.w3.org/1999/xlink" xlink:href=" https://s3-euw1-ap-pe-df-pch-content-public-p.s3.eu-west-1.amazonaws.com/9781003460763/a1dd00af-5f0d-42a5-a080-674b9e863cf3/content/inline-math11_1.tif "/> . The proposed SQPC protocol lets the two classical users can compare whether their private messages are equal or not with the assistance of a dishonest three-party quantum user (TP), in which TP owns the complete quantum capabilities and the classical users only equip the two quantum devices including (1) Hadamard operation and (2) Z-basis https://www.w3.org/1998/Math/MathML" display="inline"> 0 , | 1 ⟩ https://www.w3.org/1999/xlink" xlink:href=" https://s3-euw1-ap-pe-df-pch-content-public-p.s3.eu-west-1.amazonaws.com/9781003460763/a1dd00af-5f0d-42a5-a080-674b9e863cf3/content/inline-math11_2.tif "/> measurement. Because the one-way qubit transmission is adopted, the proposed SQPC protocol is free from quantum Trojan horse attack. Moreover, a security analysis also is given to prove that the proposed SQPC is robust under the collective attack.
Abstract Based on Bell states, a new semi-quantum private comparison protocol is proposed that enables two classical users to securely compare the equality of their private information with the aid of a semi-honest third party. Different from the existing semi-quantum private comparison protocols, the two classical participants in the presented protocol do not need to measure and prepare any quantum state, which not only reduces the consumption of quantum devices, but also greatly improves the feasibility of the protocol. Performing different unitary operations on the received particles, classical users can securely compare their secret information. Besides, the devised protocol has higher qubit efficiency than the other similar counterparts, since participants can compare a two-bit privacy each time with one qubit. Meanwhile, after completing the comparison process, all Bell states could be reused since they still retain the corresponding entanglement property, which greatly facilitates the recycle of quantum resources. Security analyses indicate that the designed scheme is secure against external attack and internal attack. Moreover, the operations involved in our scheme are simulated on the IBM Quantum Experience to demonstrate the effectiveness and security of our scheme.
The n -puzzle is a classical problem for modeling algorithms. For n -puzzle there are https://www.w3.org/1998/Math/MathML" display="inline"> n + 1 https://www.w3.org/1999/xlink" xlink:href=" https://s3-euw1-ap-pe-df-pch-content-public-p.s3.eu-west-1.amazonaws.com/9781003374404/4745344c-4074-4386-85e6-ca8a3849de1f/content/math10_1.tif "/> different objects: n cells and one empty cell. Each object can be coded by https://www.w3.org/1998/Math/MathML" display="inline"> ρ = ⌈ log 2 ⁡ n + 1 ⌉ https://www.w3.org/1999/xlink" xlink:href=" https://s3-euw1-ap-pe-df-pch-content-public-p.s3.eu-west-1.amazonaws.com/9781003374404/4745344c-4074-4386-85e6-ca8a3849de1f/content/math10_2.tif "/> qubits and a configuration of https://www.w3.org/1998/Math/MathML" display="inline"> n + 1 https://www.w3.org/1999/xlink" xlink:href=" https://s3-euw1-ap-pe-df-pch-content-public-p.s3.eu-west-1.amazonaws.com/9781003374404/4745344c-4074-4386-85e6-ca8a3849de1f/content/math10_3.tif "/> objects can be represented by a register of https://www.w3.org/1998/Math/MathML" display="inline"> z := ρ ⋅ ( n + 1 ) https://www.w3.org/1999/xlink" xlink:href=" https://s3-euw1-ap-pe-df-pch-content-public-p.s3.eu-west-1.amazonaws.com/9781003374404/4745344c-4074-4386-85e6-ca8a3849de1f/content/math10_4.tif "/> qubits https://www.w3.org/1998/Math/MathML" display="inline"> | x ⟩ https://www.w3.org/1999/xlink" xlink:href=" https://s3-euw1-ap-pe-df-pch-content-public-p.s3.eu-west-1.amazonaws.com/9781003374404/4745344c-4074-4386-85e6-ca8a3849de1f/content/math10_5.tif "/> . The function https://www.w3.org/1998/Math/MathML" display="inline"> g ( x ) https://www.w3.org/1999/xlink" xlink:href=" https://s3-euw1-ap-pe-df-pch-content-public-p.s3.eu-west-1.amazonaws.com/9781003374404/4745344c-4074-4386-85e6-ca8a3849de1f/content/math10_6.tif "/> is represented a unitary operator T . T acts on the https://www.w3.org/1998/Math/MathML" display="inline"> z + 1 https://www.w3.org/1999/xlink" xlink:href=" https://s3-euw1-ap-pe-df-pch-content-public-p.s3.eu-west-1.amazonaws.com/9781003374404/4745344c-4074-4386-85e6-ca8a3849de1f/content/math10_7.tif "/> qubits with https://www.w3.org/1998/Math/MathML" display="inline"> x ∈ B z https://www.w3.org/1999/xlink" xlink:href=" https://s3-euw1-ap-pe-df-pch-content-public-p.s3.eu-west-1.amazonaws.com/9781003374404/4745344c-4074-4386-85e6-ca8a3849de1f/content/math10_8.tif "/> and https://www.w3.org/1998/Math/MathML" display="inline"> c ∈ B 1 https://www.w3.org/1999/xlink" xlink:href=" https://s3-euw1-ap-pe-df-pch-content-public-p.s3.eu-west-1.amazonaws.com/9781003374404/4745344c-4074-4386-85e6-ca8a3849de1f/content/math10_9.tif "/> https://www.w3.org/1998/Math/MathML" display="block"> T ⋅ | x ⟩ | c ⟩ = | x ⟩ | f ( x ) ⊕ c ⟩ . https://www.w3.org/1999/xlink" xlink:href=" https://s3-euw1-ap-pe-df-pch-content-public-p.s3.eu-west-1.amazonaws.com/9781003374404/4745344c-4074-4386-85e6-ca8a3849de1f/content/math10_10.tif "/>
In this paper, a novel semiquantum private comparison (SQPC) protocol based on single kind of Bell entangled states is proposed, which allows two classical parties to judge the equality of their private inputs securely and correctly under the help of a semi-honest third party (TP) who possesses complete quantum capabilities. TP is allowed to misbehave on her own but cannot conspire with anyone else. Our protocol does not need to share secret keys among different participants in advance, and needs neither unitary operations nor quantum entanglement swapping. Moreover, our protocol only needs to prepare single kind of Bell entangled states as initial quantum resource. Detailed security analysis turns out that our protocol is secure against various outside and participant attacks. Compared with most of the existing SQPC protocols based on Bell entangled states, our protocol is more feasible in practice.
In this chapter, the simplest quantum measurement situation, i.e., where the state is an eigenvector of the observable to be measured, is considered. The states are therefore non-superimposed and measurement Axiom 3.2 of Section 13.7 in the previous chapter is applicable. We consider states in https://www.w3.org/1998/Math/MathML" display="inline"> ℂ 2 , ℂ 2 ⊗ ℂ 2 https://www.w3.org/1999/xlink" xlink:href=" https://s3-euw1-ap-pe-df-pch-content-public-p.s3.eu-west-1.amazonaws.com/9781003264569/7139ce19-0d58-4a0c-820f-b76fb033e438/content/math14_1.tif "/> and https://www.w3.org/1998/Math/MathML" display="inline"> ℂ 2 ⊗ ℂ 2 ⊗ ℂ 2 https://www.w3.org/1999/xlink" xlink:href=" https://s3-euw1-ap-pe-df-pch-content-public-p.s3.eu-west-1.amazonaws.com/9781003264569/7139ce19-0d58-4a0c-820f-b76fb033e438/content/math14_2.tif "/> . The generalisation to https://www.w3.org/1998/Math/MathML" display="inline"> ⊗ n ℂ 2 https://www.w3.org/1999/xlink" xlink:href=" https://s3-euw1-ap-pe-df-pch-content-public-p.s3.eu-west-1.amazonaws.com/9781003264569/7139ce19-0d58-4a0c-820f-b76fb033e438/content/math14_3.tif "/> is then clear.
Private comparison is the basis of many encryption technologies, and several related Quantum Private Comparison (QPC) protocols have been published in recent years. In these existing protocols, secret information is encoded by using conjugate coding or orthogonal states, and all users are quantum participants. In this paper, a novel semi-quantum private comparison scheme is proposed, which employs Bell entangled states as quantum resources. Two semi-quantum participants compare the equivalence of their private information with the help of a semi-honest third party (TP). Compared with the previous classical protocols, these two semi-quantum users can only make some particular action, such as to measure, prepare and reflect quantum qubits only in the classical basis {|0⟩,|1⟩} , and TP needs to perform Bell basis measurement on reflecting qubits to obtain the results of the comparison. Further, analysis results show that this scheme can avoid outside and participant attacks and its’ qubit efficiency is better than the other two protocols mentioned in the paper.
In recent years, Industrial Internet of Things (IIoT) technologies based on group information sharing have been widely applied in industrial manufacturing and global trade due to their real-time, secure, and interoperable characteristics. However, most of these technologies rely on group key negotiation protocols, which suffer from drawbacks such as high overhead, weak security, and low scalability. Therefore, designing secure and efficient group key negotiation protocols has become a scientific challenge that needs to be addressed. In this paper, a fully structured group key negotiation protocol is proposed using the mathematical structure of balanced incomplete block designs and an elliptic curve Qu-Vanstone (ECQV) authentication protocol. Firstly, to reduce the computational overhead of the protocol, the ECQV authentication protocol is utilized to avoid performing pairing operations. Then, to prove the security of the protocol, security proofs are conducted based on the elliptic curve decisional Diffie–Hellman assumption. Lastly, to reduce the communication overhead and improve the scalability of the protocol, an extension to existing group key negotiation protocols is proposed using asymmetric balanced incomplete block designs, increasing the supported number of members from https://www.w3.org/1998/Math/MathML" display="inline"> q 2 https://www.w3.org/1999/xlink" xlink:href=" https://s3-euw1-ap-pe-df-pch-content-public-p.s3.eu-west-1.amazonaws.com/9781003466284/c64b8b66-5b04-4d90-b345-58effd21948c/content/math6_1.tif "/> to https://www.w3.org/1998/Math/MathML" display="inline"> q 2 https://www.w3.org/1999/xlink" xlink:href=" https://s3-euw1-ap-pe-df-pch-content-public-p.s3.eu-west-1.amazonaws.com/9781003466284/c64b8b66-5b04-4d90-b345-58effd21948c/content/math6_2.tif "/> and https://www.w3.org/1998/Math/MathML" display="inline"> q 2 + q + 1 https://www.w3.org/1999/xlink" xlink:href=" https://s3-euw1-ap-pe-df-pch-content-public-p.s3.eu-west-1.amazonaws.com/9781003466284/c64b8b66-5b04-4d90-b345-58effd21948c/content/math6_3.tif "/> . Experimental results demonstrate that the proposed protocol can reduce computational overhead to https://www.w3.org/1998/Math/MathML" display="inline"> O n n m https://www.w3.org/1999/xlink" xlink:href=" https://s3-euw1-ap-pe-df-pch-content-public-p.s3.eu-west-1.amazonaws.com/9781003466284/c64b8b66-5b04-4d90-b345-58effd21948c/content/math6_4.tif "/> and communication overhead to https://www.w3.org/1998/Math/MathML" display="inline"> O n n https://www.w3.org/1999/xlink" xlink:href=" https://s3-euw1-ap-pe-df-pch-content-public-p.s3.eu-west-1.amazonaws.com/9781003466284/c64b8b66-5b04-4d90-b345-58effd21948c/content/math6_5.tif "/> . The protocol ensures resistance against chosen plaintext attacks while allowing flexible adaptation of the number of participants in group key negotiation protocols, thereby enhancing both the security and efficiency of the protocol.