Quantum Secure Communication Based on Nonmaximally Entangled Qubit Pair and Dining Cryptographers Problem

Author

Shi, Ronghua ; Su, Qian ; Guo, Ying ; Lee, Moon Ho

Author_Institution

Sch. of Inf. Sci. & Eng., Central South Univ., Changsha, China

fYear

2011

fDate

16-18 Nov. 2011

Firstpage

900

Lastpage

904

Abstract

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.

Keywords

cryptographic protocols; quantum cryptography; DC problem; QSS scheme; anonymous communication protocols; dining cryptographer problem; nonmaximally entangled qubit pair; quantum anonymous communication scheme; quantum secret sharing scheme; Atmospheric measurements; Cryptography; Educational institutions; Joints; Particle measurements; Protocols; Quantum entanglement; Dining Cryptographers Problem; Quantum anonymous communication; nonmaximally entangled; quantum secret sharing;

fLanguage

English

Publisher

ieee

Conference_Titel

Trust, Security and Privacy in Computing and Communications (TrustCom), 2011 IEEE 10th International Conference on

Conference_Location

Changsha

Print_ISBN

978-1-4577-2135-9

Type

conf

DOI

10.1109/TrustCom.2011.123

Filename

6120916