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

Physical Review A

Quantum secret-sharing protocol based on Grover’s algorithm

Li‐Yi Hsu

Published Aug 18, 2003• 168 citations
Publisher

Abstract

A marked state can be found with certainty in the two-qubit case of Grover's algorithm. This property is included in the proposed quantum secret-sharing protocol. In the proposed scheme, the sender prepares some initial state in private and then performs a phase shift of the marked state as the sender's bit. Then, the sender sends these two qubits to each of the two receivers. Only when the sender broadcasts the initially prepared state and then the receivers perform the corresponding inversion operation about the average, is the sender's bit faithfully revealed. Moreover, the sender can detect deception using cheat-detecting states. The proposed quantum secret-sharing protocol is shown to be secure.

DOI
10.1103/physreva.68.022306

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•1 citation

An efficient quantum secret sharing using secure direct communication

Mahsa Khorrampanah, Monireh Houshmand

Inspired by quantum secure direct communication, a three-party quantum secret sharing approach is proposed. In the preparation phase, the sender shares a GHZ state among users. After she ensures about the security of the channel, she generates an auxiliary GHZ state and keeps it. Then she encodes three-bit information on the GHZ states, by applying the appropriate gates on her qubits. In the decoding phase, the three parties measure their qubits. The receivers achieve no information on the encoded message individually and just when they know the others' measurement results have access to the secret message. The security of the preparation phase against various attacks is investigated. Since no qubits carrying the message are transmitted, the protocol is completely secure, if the perfect quantum channel is used. The proposed approach has a better efficiency as compared to the previous ones.

Iranian Conference on Electrical Engineering•May 1, 2013•10 citations

New quantum secret sharing protocol based on entanglement swapping

Dan Liu

The insecurity of the protocols for quantum secret sharing(QSS) based on entanglement swapping was analyzed,and a new method of QSS based on entanglement swapping was proposed.The entanglement states were all generated by the sender,and the order of two photons sent to the same agent was randomly changed.After the photons arrived at the receiver,for the detection mode,the order of the two photons was announced,so that the two parties detected the security of the quantum channel;for the information mode,the two receivers respectively did Bell measurement on the two photons they owned,and then communicated through classical channel to share the secret key with the sender.Analysis results show that this protocol not only ensures the validity and security of the shared information,but also only uses the entanglement states of two photons without unitary operation.

Journal of Optoelectronics·laser•Jan 1, 2011•2 citations

Quantum Secret Sharing Based on Entanglement Swapping and Local Operation

Qin Su-juan, Tailin Liu, Wen Qiao-yan

To improve the efficiency of quantum secret sharing, a protocol share the message directly among the users was proposed. The scheme made full use of entanglement swapping of Bell states and local operations. For detection of eavesdropping, the EPR pairs were divided into two parts: the checking parts and the encoding parts. After insuring the security of the quantum channel by measuring the checking particles in conjugate bases, the sender encoded her bits via the local unitary operations on the encoding parts. Investigation shows that the protocol is secure and two Bell states can be used to share two bits message.

Beijing Youdian Xueyuan xuebao•Jan 1, 2005•2 citations

A new scheme for quantum secret sharing

Saber Bagherinezhad, Karimipour

We introduce a protocol for quantum secret sharing based on reusable entangled states. The entangled state between the sender and the receiver acts only as a carrier and no measurement is performed on this shared state. Half of the sequence of bits can be retrieved independently and for the other half the receivers need each other's assistance. We also show that the protocol is completely safe against eavesdropping.

•Apr 21, 2002•0 citations

Grover's algorithm based multi-qubit secret sharing scheme

Arti Chamoli, Chandra Mohan Bhandari

Some of the secret sharing schemes having unique quantum features like parallelism and entanglement are supposed to be relatively secure. Different schemes proposed by various researchers over the years have features which could be specific to the nature and need of a situation. Following Hsu's proposed scheme we propose a secret sharing scheme using Grover's search algorithm for a four qubit system with several marked states. Further, the scheme has been generalised to an n-qubit syatem.

arXiv:0707.1042•Jul 6, 2007•2 citations
A marked state can be found with certainty in the two-qubit case of Grover's algorithm. This property is included in the proposed quantum secret-sharing protocol. In the proposed scheme, the sender prepares some initial state in private and then performs a phase shift of the marked state as the sender's bit. Then, the sender sends these two qubits to each of the two receivers. Only when the sender broadcasts the initially prepared state and then the receivers perform the corresponding inversion operation about the average, is the sender's bit faithfully revealed. Moreover, the sender can detect deception using cheat-detecting states. The proposed quantum secret-sharing protocol is shown to be secure.
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.
Inspired by quantum secure direct communication, a three-party quantum secret sharing approach is proposed. In the preparation phase, the sender shares a GHZ state among users. After she ensures about the security of the channel, she generates an auxiliary GHZ state and keeps it. Then she encodes three-bit information on the GHZ states, by applying the appropriate gates on her qubits. In the decoding phase, the three parties measure their qubits. The receivers achieve no information on the encoded message individually and just when they know the others' measurement results have access to the secret message. The security of the preparation phase against various attacks is investigated. Since no qubits carrying the message are transmitted, the protocol is completely secure, if the perfect quantum channel is used. The proposed approach has a better efficiency as compared to the previous ones.
The insecurity of the protocols for quantum secret sharing(QSS) based on entanglement swapping was analyzed,and a new method of QSS based on entanglement swapping was proposed.The entanglement states were all generated by the sender,and the order of two photons sent to the same agent was randomly changed.After the photons arrived at the receiver,for the detection mode,the order of the two photons was announced,so that the two parties detected the security of the quantum channel;for the information mode,the two receivers respectively did Bell measurement on the two photons they owned,and then communicated through classical channel to share the secret key with the sender.Analysis results show that this protocol not only ensures the validity and security of the shared information,but also only uses the entanglement states of two photons without unitary operation.
To improve the efficiency of quantum secret sharing, a protocol share the message directly among the users was proposed. The scheme made full use of entanglement swapping of Bell states and local operations. For detection of eavesdropping, the EPR pairs were divided into two parts: the checking parts and the encoding parts. After insuring the security of the quantum channel by measuring the checking particles in conjugate bases, the sender encoded her bits via the local unitary operations on the encoding parts. Investigation shows that the protocol is secure and two Bell states can be used to share two bits message.
Some of the secret sharing schemes having unique quantum features like parallelism and entanglement are supposed to be relatively secure. Different schemes proposed by various researchers over the years have features which could be specific to the nature and need of a situation. Following Hsu's proposed scheme we propose a secret sharing scheme using Grover's search algorithm for a four qubit system with several marked states. Further, the scheme has been generalised to an n-qubit syatem.