Generalized quantum secret sharing
暂无分享,去创建一个
We explore a generalization of quantum secret sharing (QSS) in which classical shares play a complementary role to quantum shares, exploring further consequences of an idea first studied by Nascimento, Mueller-Quade, and Imai [Phys. Rev. A 64, 042311 (2001)]. We examine three ways, termed inflation, compression, and twin thresholding, by which the proportion of classical shares can be augmented. This has the important application that it reduces quantum (information processing) players by replacing them with their classical counterparts, thereby making quantum secret sharing considerably easier and less expensive to implement in a practical setting. In compression, a QSS scheme is turned into an equivalent scheme with fewer quantum players, compensated for by suitable classical shares. In inflation, a QSS scheme is enlarged by adding only classical shares and players. In a twin-threshold scheme, we invoke two separate thresholds for classical and quantum shares based on the idea of information dilution.
[1] John E. Hopcroft,et al. Complexity of Computer Computations , 1974, IFIP Congress.
[2] Brian Cantwell Smith,et al. The Foundations of Computing , 1996 .
[3] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[4] Raymond E. Miller,et al. Complexity of Computer Computations , 1972 .
[5] 염흥렬,et al. [서평]「Applied Cryptography」 , 1997 .