Cheater Identifiable Quantum Secret Sharing Schemes

摘要

In this paper, we show that there exists a cheater identifiable (k, n) threshold secret sharing scheme for a quantum secret. Suppose that there are at most t cheaters ((k ≧ 3t + 1)), A; or more participants can identify who are cheating. Our scheme utilizes authentication codes based on an orthogonal array and stabilizer codes, which are unconditionally secure. Moreover, we discuss the relation between n and t.