vix.ing · top · new · best · stats

An Efficient Simulation of Quantum Secret Sharing

2021/03/20 by Kartick Sutradhar, Sutradhar, Kartick, Hari Om +1
Computer Science · Physics and Astronomy · #Cryptography and Security (cs.CR) #FOS: Computer and information sciences #FOS: Physical sciences #Quantum Computing Algorithms and Architecture #Quantum Information and Cryptography #Quantum Mechanics and Applications #Quantum Physics (quant-ph) #cs.CR #quant-ph

paper · pdf · doi:10.48550/arxiv.2103.11206

arxiv created 2021/03/20 · openalex publication_date 2021/03/20 · arxiv updated 2021/03/23 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

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.

Citations

Related