Quantum Secure Communication Based on Nonmaximally Entangled Qubit Pair and Dining Cryptographers Problem
Ronghua Shi, Qian Su, Ying Guo, Moon Ho Lee · 2011
A novel quantum anonymous communication scheme is proposed on the basis of Dining Cryptographers (DC) Problem and nonmaximally entangled qubit pair. The scheme takes advantage of quantum-mechanical impossibility of local unitary transformation between certain nonmaximally entangled states to provide truly random number which can be brightly used in anonymous communication protocols based on DC-Nets. The analysis and discussions demonstrate that the proposed quantum anonymous communication scheme can be performed securely with high capacity and untraceability. The scheme can also be extended to a (2, 2) quantum secret sharing (QSS) scheme.