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

Journal of Physics Conference Series

The Improved Quantum Secret Sharing Protocol Based on Grover Algorithm

Zhuo Ping Yu

Published Feb 1, 2022• 3 citations
Publisher

Abstract

Abstract Quantum secret sharing(QSS) is a cryptographic protocol based on the uncertainty principle and quantum no-cloning theorem and is an essential aspect in quantum computing. This paper describes the Grover search algorithm and how to improve QSS protocol by Grover Algorithm. The QSS based on the Grover algorithm is more secure and easier to operate compared to old QSS protocols. Some scientists improved the security of the first QSS protocol based on QSA by changing the check mode. After that, a protocol with quite different procedures was proposed. The improved one enhances the feasibility of the protocol and it could also make sure that the communication is secure from the attacks.

DOI
10.1088/1742-6596/2209/1/012031

Related papers

A Four-Party Quantum Secret-Sharing Scheme based on Grover's Search Algorithm

Deepa Rathi, Farhan Musanna, Sanjeev Kumar

The work presents an amalgam of quantum search algorithm (QSA) and quantum secret sharing (QSS). The proposed QSS scheme utilizes Grover's three-particle quantum state. In this scheme, the dealer prepares an encoded state by encoding the classical information as a marked state and shares the states' qubits between three participants. The participants combine their qubits and find the marked state as a measurement result of the three-qubit state. The security analysis shows the scheme is stringent against malicious participants or eavesdroppers. In comparison to the existing schemes, our protocol fairs pretty well and has a high encoding capacity. The simulation analysis is done on the cloud platform IBM-QE thereby showing the practical feasibility of the scheme.

arXiv:2111.08932•Nov 17, 2021•0 citations

Efficient and secure quantum secret sharing scheme based on polarized single photons

Wei Wang

To improve the efficiency and security of quantum secret sharing,with the help of Grover’s algorithm,a quantum secret sharing scheme based on polarized single photons is proposed.Efficiency analysis indicates that all qubits can be used in the secret sharing and its theoretical efficiency achieves to 100%.In the security proving,with Grover’s operator and quantum entanglement,the protocol can resist the middleman attack effectively.And by using auxiliary qubit,the protocol can detect the Trojan horse attack with high probability.The extension of Grover’s operator shows the scheme which contains pairs is feasible and applicable.Finally,a view concerning the future work in quantum secret sharing is represented.

Jisuanji gongcheng yu sheji•Jan 1, 2010•0 citations

Quantum secret sharing protocol through noisy channel with application in visual cryptography

Deepa Rathi, Sanjeev Kumar, Farhan Musanna +1 more

Summary This study presents a quantum secret sharing (QSS) protocol designed using Grover's search algorithm in a noisy environment. The proposed protocol utilizes Grover's three‐particle quantum state. The proposed scheme is divided into secret information sharing and eavesdropping checking. The dealer prepares an encoded state by encoding the classical information as a marked state and shares the states' qubits between three participants. Using the amplitude‐damping noise and the phase‐damping noise as conventional noisy channels, it can be demonstrated that secret information can be conveyed between participants with some information lost. The security analysis shows the scheme is stringent against malicious participants or eavesdroppers. The simulation analysis is done on the cloud platform IBM‐QE thereby showing the practical feasibility of the scheme. Finally, an application of the proposed scheme is demonstrated in visual cryptography using the GNEQR representation of images.

Concurrency and Computation Practice and Experience•Sep 25, 2023•1 citation

Eavesdropping in a quantum secret sharing protocol based on Grover algorithm and its solution

Jun Li

A detailed analysis has showed that the quantum secret sharing protocol based on the Grover algorithm (Phys Rev A, 2003, 68: 022306) is insecure. A dishonest receiver may obtain the full information without being detected. A quantum secret-sharing protocol is presents here, which mends the security loophole of the original secret-sharing protocol, and doubles the information capacity.

Science in China. Series G, Physics, mechanics & astronomy/Science in China. Series G, Physics, Mechanics & Astronomy•Jan 1, 2010•0 citations

A flexible framework for (n,n) quantum secret sharing

Kuo-Chun Tseng, Wei-Lin Lee, Chi‐Yuan Chen +1 more

With the rise of quantum computing, traditional cryptography is facing serious threats. Secret sharing, as an important primitive of cryptography, is also affected. Because secret sharing is widely used in many fields, researchers have started to explore quantum secret sharing (QSS). QSS uses basic principles of quantum mechanics to provide strong security and can protect against both eavesdropping and malicious attacks. However, most existing QSS studies focus on specific situations and lack the flexibility needed for complex multiparty environments. In this work, we propose a general QSS framework that can be applied to different scenarios. We first design a basic [Formula: see text] QSS protocol, and then extend it to support multiparty communication and dynamic changes in participants. Our security analysis shows that the proposed method keeps strong security, uses fewer resources, and works independently without the need for a trusted third party (TP). This protocol offers a unified solution that can meet different application needs and provides a new approach to handling diverse QSS tasks more efficiently.

Modern Physics Letters A•Jul 4, 2025•1 citation

Counterfactual Quantum Secret Sharing

Nomi Lae, Shehbaz Tariq, Saw Nang Paing +4 more

The emerging quantum technology has highlighted the necessity for secure and efficient secret sharing in quantum networks. In this paper, we introduce a verifiable multiparty counterfactual quantum secret sharing (QSS) protocol, enhancing security and efficiency. This QSS protocol utilizes a low-depth quantum circuit to encrypt and decrypt information, which comprises a unitary operator constructed using a preshared secret key. To ensure the robustness and verifiability of the shared secret key, the protocol imposes constraints on the participants with the Chinese remainder theorem. The most significant advantage of our proposed QSS protocol is incorporating counterfactual communication, which considerably enhances the scheme’s security by enabling exchange-free information sharing among participants, thereby minimizing the risk of eavesdropping or intercept-and-resend attacks. Furthermore, we incorporate a weighted-threshold mechanism that provides flexibility, enabling diverse use cases to design security protocols for quantum networks. The security analysis of the counterfactual QSS protocol and its implementation on IBM Quantum computers reveals strong resilience to internal and external attacks, along with high efficiency and robustness, making it effective for quantum encryption in the noisy intermediate-scale quantum era.

IEEE Transactions on Communications•Jun 5, 2025•1 citation
Abstract Quantum secret sharing(QSS) is a cryptographic protocol based on the uncertainty principle and quantum no-cloning theorem and is an essential aspect in quantum computing. This paper describes the Grover search algorithm and how to improve QSS protocol by Grover Algorithm. The QSS based on the Grover algorithm is more secure and easier to operate compared to old QSS protocols. Some scientists improved the security of the first QSS protocol based on QSA by changing the check mode. After that, a protocol with quite different procedures was proposed. The improved one enhances the feasibility of the protocol and it could also make sure that the communication is secure from the attacks.
The work presents an amalgam of quantum search algorithm (QSA) and quantum secret sharing (QSS). The proposed QSS scheme utilizes Grover's three-particle quantum state. In this scheme, the dealer prepares an encoded state by encoding the classical information as a marked state and shares the states' qubits between three participants. The participants combine their qubits and find the marked state as a measurement result of the three-qubit state. The security analysis shows the scheme is stringent against malicious participants or eavesdroppers. In comparison to the existing schemes, our protocol fairs pretty well and has a high encoding capacity. The simulation analysis is done on the cloud platform IBM-QE thereby showing the practical feasibility of the scheme.
To improve the efficiency and security of quantum secret sharing,with the help of Grover’s algorithm,a quantum secret sharing scheme based on polarized single photons is proposed.Efficiency analysis indicates that all qubits can be used in the secret sharing and its theoretical efficiency achieves to 100%.In the security proving,with Grover’s operator and quantum entanglement,the protocol can resist the middleman attack effectively.And by using auxiliary qubit,the protocol can detect the Trojan horse attack with high probability.The extension of Grover’s operator shows the scheme which contains pairs is feasible and applicable.Finally,a view concerning the future work in quantum secret sharing is represented.
Summary This study presents a quantum secret sharing (QSS) protocol designed using Grover's search algorithm in a noisy environment. The proposed protocol utilizes Grover's three‐particle quantum state. The proposed scheme is divided into secret information sharing and eavesdropping checking. The dealer prepares an encoded state by encoding the classical information as a marked state and shares the states' qubits between three participants. Using the amplitude‐damping noise and the phase‐damping noise as conventional noisy channels, it can be demonstrated that secret information can be conveyed between participants with some information lost. The security analysis shows the scheme is stringent against malicious participants or eavesdroppers. The simulation analysis is done on the cloud platform IBM‐QE thereby showing the practical feasibility of the scheme. Finally, an application of the proposed scheme is demonstrated in visual cryptography using the GNEQR representation of images.
With the rise of quantum computing, traditional cryptography is facing serious threats. Secret sharing, as an important primitive of cryptography, is also affected. Because secret sharing is widely used in many fields, researchers have started to explore quantum secret sharing (QSS). QSS uses basic principles of quantum mechanics to provide strong security and can protect against both eavesdropping and malicious attacks. However, most existing QSS studies focus on specific situations and lack the flexibility needed for complex multiparty environments. In this work, we propose a general QSS framework that can be applied to different scenarios. We first design a basic [Formula: see text] QSS protocol, and then extend it to support multiparty communication and dynamic changes in participants. Our security analysis shows that the proposed method keeps strong security, uses fewer resources, and works independently without the need for a trusted third party (TP). This protocol offers a unified solution that can meet different application needs and provides a new approach to handling diverse QSS tasks more efficiently.
The emerging quantum technology has highlighted the necessity for secure and efficient secret sharing in quantum networks. In this paper, we introduce a verifiable multiparty counterfactual quantum secret sharing (QSS) protocol, enhancing security and efficiency. This QSS protocol utilizes a low-depth quantum circuit to encrypt and decrypt information, which comprises a unitary operator constructed using a preshared secret key. To ensure the robustness and verifiability of the shared secret key, the protocol imposes constraints on the participants with the Chinese remainder theorem. The most significant advantage of our proposed QSS protocol is incorporating counterfactual communication, which considerably enhances the scheme’s security by enabling exchange-free information sharing among participants, thereby minimizing the risk of eavesdropping or intercept-and-resend attacks. Furthermore, we incorporate a weighted-threshold mechanism that provides flexibility, enabling diverse use cases to design security protocols for quantum networks. The security analysis of the counterfactual QSS protocol and its implementation on IBM Quantum computers reveals strong resilience to internal and external attacks, along with high efficiency and robustness, making it effective for quantum encryption in the noisy intermediate-scale quantum era.