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

arXiv:0707.1042

Grover's algorithm based multi-qubit secret sharing scheme

Arti Chamoli, Chandra Mohan Bhandari

Published Jul 6, 2007• 2 citations
arXivHTMLPDF

Abstract

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.

DOI
10.48550/arxiv.0707.1042

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

Quantum secret-sharing protocol based on Grover’s algorithm

Li‐Yi Hsu

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.

Physical Review A•Aug 18, 2003•168 citations

Quantum cryptography based on Grover's algorithm

Z. Sakhi, R. Kabil, Abderrahim Tragha +1 more

Some cryptographic applications of quantum algorithm on many qubits system are presented. We analyze a basic concept of Grover algorithm and it's implementation in the case of four qubits system. We show specially that Grover algorithm allows as obtaining a maximal probability to get the result. Some features of quantum cryptography and Quantum Secret-Sharing protocol based on Grover's algorithm are also presented.

International Conference on the Innovative Computing Technology (INTECH)•Sep 1, 2012•13 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•4 citations

Quantum secret sharing with shared key dependent on receivers

Juan Xu

A novel quantum secret sharing scheme between one and many parties with four states is proposed. Different from existing schemes, the bit value of shared key in this scheme depends on the operations done by the receivers, say Bobs, not the preparer Alice, which is highly applicable in some cases. This paper also gives the definition of qubit capacity, in order to signify the relative amount of quantum resource needed in schemes. The analysis shows that the qubit capacity of our scheme is 1, which means it saves quantum resource due to the absence of entanglement and bitwise Exclusive OR operations on qubits' measuring results. Besides, this scheme has features of being convenient for receivers, feasible with current technology, and also secure against some common attacks.

International Conference on Natural Computation (ICNC)•Jul 1, 2011•3 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
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.
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.
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.
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.
A novel quantum secret sharing scheme between one and many parties with four states is proposed. Different from existing schemes, the bit value of shared key in this scheme depends on the operations done by the receivers, say Bobs, not the preparer Alice, which is highly applicable in some cases. This paper also gives the definition of qubit capacity, in order to signify the relative amount of quantum resource needed in schemes. The analysis shows that the qubit capacity of our scheme is 1, which means it saves quantum resource due to the absence of entanglement and bitwise Exclusive OR operations on qubits' measuring results. Besides, this scheme has features of being convenient for receivers, feasible with current technology, and also secure against some common attacks.
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.