Threshold Quantum Secret Sharing

TL;DR

This paper proposes an improved quantum secret sharing protocol that ensures secret reconstruction is possible without requiring participants to know others' information, enhancing security and practicality.

Contribution

It introduces a new quantum secret sharing protocol that addresses the reconstruction issue in previous schemes, enabling secret recovery without additional participant information.

Findings

The protocol successfully reconstructs secrets without extra participant data.

It enhances security by reducing information leakage.

The method is applicable to $(t,n)$ threshold schemes with modulo d.

Abstract

One crucial and basic method for disclosing a secret to every participant in quantum cryptography is quantum secret sharing. Numerous intricate protocols, including secure multiparty summation, multiplication, sorting, voting, and more, can be designed with it. A quantum secret sharing protocol with a $(t,n)$ threshold approach and modulo d, where t and n represent the threshold number of participants and the total number of participants, respectively was recently discussed by Song et al. Kao et al. notes that without the information of other participants, the secret in Song {\em et al.'s}protocol cannot be reconstructed. We address a protocol that solves this issue in this paper.