Quantum security computation on shared secrets

Abstract

Ouyang et al. proposed an $(n,n)$ threshold quantum secret sharing scheme, where the number of participants is limited to $n=4k+1,k\in Z^{+}$, and the security evaluation of the scheme was carried out accordingly. In this paper, we propose an $(n,n)$ threshold quantum secret sharing scheme for the number of participants $n$ in any case ( $n\in Z^{+}$ ). The scheme is based on a quantum circuit, which consists of Clifford group gates and Toffoli gate. We study the properties of the quantum circuit in this paper and use the quantum circuit to analyze the security of the scheme for dishonest participants.

References in corpus (15)

• Quantum secret sharing
• How to share a quantum secret
• Efficient Multi-Party Quantum Secret Sharing Schemes
• On the Theory of Quantum Secret Sharing
• Experimental Demonstration of Blind Quantum Computing
• Universal blind quantum computation
• Graph States for Quantum Secret Sharing
• Methodology for quantum logic gate constructions
• Universality in Quantum Computation
• Unconditionally verifiable blind computation
• Verifiable measurement-only blind quantum computing with stabilizer testing
• Blind topological measurement-based quantum computation
• An efficient quantum secret sharing scheme with Einstein-Podolsky-Rosen Pairs
• A Generalized Information Theoretical Model for Quantum Secret Sharing
• Computing on quantum shared secrets