In this paper, we design a new quantum key distribution protocol, allowing two limited semi-quantum or "classical" users to establish a shared secret key with the help of a fully quantum server. A semi-quantum user can only prepare and measure qubits in the computational basis and so must rely on this quantum server to produce qubits in alternative bases and also to perform alternative measurements. However, we assume that the sever is untrusted and we prove the unconditional security of our protocol even in the worst case: when this quantum server is an all-powerful adversary. We also compute a lower bound of the key rate of our protocol, in the asymptotic scenario, as a function of the observed error rate in the channel allowing us to compute the maximally tolerated error of our protocol. Our results show that a semi-quantum protocol may hold similar security to a fully quantum one.
A new multi-user quantum key distribution protocol with mutual authentication is proposed on a star network. Here, two arbitrary users are able to perform key distribution with the assistance of a semi-trusted center. Bell states are used as information carriers and transmitted in a quantum channel between the center and one user. A keyed hash function is utilized to ensure the identities of three parties. Finally, the security of this protocol with respect to various kinds of attacks is discussed.  The security of a multi-user quantum communication network protocol using χ-type entangled states (, J. Korean Phys. Soc. 61:1–5, 2012) is analyzed. We find that, by using one χ-type state in this protocol, two participants can only share 2 bits of information, not 4 bits as the authors stated. In addition, we give a special attack strategy by which an eavesdropper can elicit half of the secret information without being detected. Finally, we improve the protocol to be secure against all the present attacks. We propose a theoretical scheme for secure quantum key distribution network following the ideas in quantum dense coding. In this scheme, the server of the network provides the service for preparing and measuring the Bell states, and the users encode the states with local unitary operations. For preventing the server from eavesdropping, we design a decoy when the particle is transmitted between the users. The scheme has high capacity as one particle carries two bits of information and its efficiency for qubits approaches 100 . Moreover, it is unnecessary for the users to store the quantum states, which makes this scheme more convenient in applications than others. Quantum correlations between two particles show nonclassical properties that can be used for providing secure transmission of information. We present a quantum cryptographic system in which users store particles in a transmission center, where their quantum states are preserved using quantum memories. Correlations between the particles stored by two users are created upon request by projecting their product state onto a fully entangled state. Our system allows for secure communication between any pair of users who have particles in the same center. Unlike other quantum cryptographic systems, it can work without quantum channels and it is suitable for building a quantum cryptographic network. We also present a modified system with many centers. 1996 The American Physical Society. 