Possible schemes for sending N-bit secret message with established N EPR pairs and a classical channel between two parties, are considered. The corresponding N-particle quantum key-distribution for N-bit secret message communication is outlined.
A two-step channel-encrypting quantum key distribution protocol is proposed. Using the previously shared EPR pairs as the quantum key, two bits of classical key can be established via one information carrier EPR state on average. In theory, the efficiency of this protocol reaches 100%, and there is no need to consume any entangled states including both the quantum key and the information carriers in ideal condition. The protocol can resist the particular attack that is fatal to other some channel-encrypting schemes. Principally, we prove the security against the most general individual attack of this protocol. Entanglement collapse in practical situation, as well as the realistic implementation of this protocol is also discussed.
We present a scheme for quantum secure direct communication with quantum encryption following some ideas in the Zhang-Li-Guo quantum key distribution scheme [Phys. Rev. A \\textbf{64}, 024302 (2001)]. Instead of the bilateral rotation operations before each round of the transmission, the two parties of communication perform a single-particle measurement on some samples chosen randomly from the quantum key, the Einstein-Podolsky-Rosen pairs shared, with the two measuring bases sigmaz and sigmax. The quantum key can be used repeatedly for transmitting a secret message securely. Each of the travelling particles can carry one bit of message which can be read out directly by the receiver.
The aim of quantum key distribution protocols is to establish a secret key among two parties with high security confidence. Such algorithms generally require a quantum channel and an authenticated classical channel. This paper presents a totally new perception of communication in such protocols. The quantum communication alone satisfies all needs of array communication between the two parties. Even so, the quantum communication channel does not need to be protected or authenticated whatsoever. As such, our algorithm is a purely quantum key distribution algorithm. The only certain identification of the two parties is through public keys.
A novel secure quantum key distribution scheme using EPR pairs is presented. It has three distinct features: 1) it is very efficient. Unlike existing quantum key distribution schemes, this scheme uses all EPR pairs in distributing the key except those chosen for checking eavesdroppers; 2) this protocol has high capacity because each EPR pair carries 2 bits of key code while existing schemes carry only one bit of key code; 3) this scheme can be used for distributing a common key among arbitrary number of parties.
Quantum cryptography is based on quantum mechanics to guarantee secure communication.It allows two parties to produce a shared random bit string known only to them.These random bits can be used as a key to encrypt and decrypt messages.The most important and unique property of quantum cryptography is the ability of the two communicating users to detect the presence of any third party trying to gain knowledge of the key.It is based on fundamental aspects of quantum mechanics.By using quantum entanglement or quantum super positions and transmitting information in quantum states, a communication system can be implemented which detects eavesdropping.Quantum cryptography is used to produce and distribute a key, not to transmit any message data.This key along with certain encryption algorithm, is used to encrypt (and decrypt) a message, which can then be transmitted over a standard communication channel.This paper concentrates on comparison between classical and quantum cryptography as well as survey on various quantum key distribution protocols used to generate and distribute the key among communicating parties.
A multiparty quantum secret sharing scheme is proposed to utilize the magic properties of entanglement swapping. In this scheme, a set of (2N-1) EPR pairs is used to encode and distribute a secret message to (N-1) parties. Each secret message will be split into (N-1) packets. By performing the local unitary operations and entanglement swapping, each classical bit packet will be encoded secretly into Bell states so no subset of parties but their entire cooperation can read out the original secret message. The security of this proposed scheme is also considered.