An Efficient Simulation of Quantum Secret Sharing

TL;DR

This paper introduces a new quantum secret sharing protocol that enhances security, flexibility, and practicality, avoiding information disclosure and resisting various attack strategies in quantum cryptography.

Contribution

It proposes a secure, efficient d-level quantum secret sharing protocol that improves upon existing schemes by eliminating the need for trusted players and enhancing security features.

Findings

Protocol resists intercept-resend and intercept attacks

No information about the secret is disclosed to players

Enhanced security against forgery, collision, and collusion attacks

Abstract

In quantum cryptography, quantum secret sharing $(QSS)$ is a fundamental primitive. $QSS$ can be used to create complex and secure multiparty quantum protocols. Existing $QSS$ protocols are either at the $(n, n)$ threshold $2$ level or at the $(t, n)$ threshold $d$ level with a trusted player, where $n$ denotes the number of players and $t$ denotes the threshold number of players. Here, we propose a secure $d$-level $QSS$ protocol for sharing a secret with efficient simulation. This protocol is more secure, flexible, and practical as compared to the existing $QSS$ protocols: $(n, n)$ threshold $2$-level and $(t,n)$ threshold $d$-level with a trusted player. Further, it does not disclose any information about the secret to players. Its security analysis shows that the intercept-resend, intercept, entangle-measure, forgery, collision and collusion attacks are not possible in this protocol.