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

International Journal of Theoretical Physics

Quantum Secret Sharing Based on Quantum Search Algorithm

Hsin-Yi Tseng, Chia‐Wei Tsai, Tzonelih Hwang, Chuanming Li

Published May 9, 2012• 26 citations
Publisher
DOI
10.1007/s10773-012-1191-x

Related papers

Searching for optimal quantum secret sharing scheme based on local distinguishability

Zhao Dou, Gang Xu, Xiu‐Bo Chen +3 more

Quantum Information Processing•Oct 1, 2020•4 citations

Quantum secret sharing based on quantum information masking

Chen‐Ming Bai, Sujuan Zhang, Lu Liu

Quantum Information Processing•Nov 11, 2022•17 citations

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 quantum secret sharing

Huawang Qin, Yuewei Dai

Quantum Information Processing•Jan 25, 2016•11 citations

The Improved Quantum Secret Sharing Protocol Based on Grover Algorithm

Zhuo Ping Yu

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.

Journal of Physics Conference Series•Feb 1, 2022•3 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
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.
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.
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.