An Efficient Simulation of Quantum Secret Sharing

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.

Implementing quantum anonymous multi-party ranking: the influence and application of the law of large numbers

“…Encouragingly, quantum protocols provide unconditional security in theory. Many researchers have designed various SMC schemes based on quantum mechanical principles, including quantum secret sharing (QSS) [10][11][12][13], quantum private query (QPQ) [14][15][16], quantum anonymous multi-party ranking (QAMR) [17][18][19][20], quantum secure multi-party summation (QSMS) [21,22], and among others [23][24][25][26][27][28]. In QAMR, each participant can obtain the ranking of his private data in ascending or descending order at the end of the protocol without revealing their private data.…”