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

TL;DR

This paper introduces a novel four-party quantum secret-sharing scheme that integrates Grover's quantum search algorithm, enhancing security and encoding capacity, and demonstrates its practical feasibility via cloud-based simulation.

Contribution

It combines Grover's search with quantum secret sharing using three-particle states, offering improved security and higher encoding capacity over existing methods.

Findings

Scheme is secure against malicious participants and eavesdroppers.

Simulation on IBM-QE confirms practical feasibility.

Outperforms existing quantum secret-sharing schemes in capacity.

Abstract

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.