Content uploaded by Khaled Elleithy
Author content
All content in this area was uploaded by Khaled Elleithy
Content may be subject to copyright.
A preview of the PDF is not available
A New Algorithm for Three-Party Quantum Key Distribution
Abstract and Figures
this paper aims to solve the security issues between two parties communicating through a Quantum channel. One of the most effective factors in Quantum cryptography is the trust between two or more parties. Communication parties need to verify the authenticity of each other and who they claim to be. The proposed model introduces a trusted center as a new party. This will be used for key distribution and trust establishment. Thus, the trusted center will be part of the process of identity verification and key agreement. Although, the suggested model in this paper is introduced between two parties and a trust center, it could be extended to cover more parties by repeating the same process on each party. This paper provides a new mechanism to establish trust between different parties. In the presented technique, each party can assure that they are communicating with the legitimate party.
Figures - uploaded by Khaled Elleithy
Author content
All figure content in this area was uploaded by Khaled Elleithy
Content may be subject to copyright.
... On the other hand, in some special cases, three-party QKD (3PQKD) communication is desired. That is why many 3PQKD protocols have been proposed [6][7][8][9][10][11]. However, these 3PQKD protocols are all based on two dimensions. ...
... This section compares the performance of our protocol with those of the related classical protocols in [6][7][8][9][10][11] based on a trusted three-party, classical information exchanges (CIE) and the information capacity (IC). ...
... 1. Firstly, in almost all of the existing 3PQKD protocols, researchers have proposed to use a trusted three-party (TTP) to help two other parties establish a secure key [6][7][8][9][10][11]. In contrast, our protocol does not need to assume that the third party is trusted, as it is well known that the participants are all honest in a QKD system (see Table 1). ...
The orthogonality of the orbital angular momentum (OAM) eigenstates enables a single photon carry an arbitrary number of bits. Moreover, additional degrees of freedom (DOFs) of OAM can span a high-dimensional Hilbert space, which could greatly increase information capacity and security. Moreover, the use of the spin angular momentum–OAM hybrid entangled state can increase Shannon dimensionality, because photons can be hybrid entangled in multiple DOFs. Based on these observations, we develop a hybrid entanglement quantum key distribution (QKD) protocol to achieve three-party quantum key distribution without classical message exchanges. In our proposed protocol, a communicating party uses a spatial light modulator (SLM) and a specific phase hologram to modulate photons’ OAM state. Similarly, the other communicating parties use their SLMs and the fixed different phase holograms to modulate the OAM entangled photon pairs, producing the shared key among the parties Alice, Bob and Charlie without classical message exchanges. More importantly, when the same operation is repeated for every party, our protocol could be extended to a multiple-party QKD protocol.
... This concept has come from two principles. One is 'Heisenberg uncertainty theorem' [3] which states that it is impossible to measure a quantum state without disturbing the system [5]. Another principle is 'no-cloning theorem' [4] which states that exact quantum state can't be copied without first destroying it [5]. ...
... One is 'Heisenberg uncertainty theorem' [3] which states that it is impossible to measure a quantum state without disturbing the system [5]. Another principle is 'no-cloning theorem' [4] which states that exact quantum state can't be copied without first destroying it [5]. ...
... Existing QKD methods e.g. [5] uses three quantum channels and two classical channels. Two quantum channels are used to transmit the secret key and one quantum channel is used to transmit the data between the sender and the receiver. ...
In this paper we propose a new algorithm for secret key sharing by utilizing quantum entanglement swapping and remote preparation of quantum state. This algorithm is used when two parties do not share an Einstein-Podolsky-Rosen (EPR) pair but one wishes to transmit a secret key to the other. In order to successfully accomplish this process, a third party who shares an EPR pair with both parties will help them build a new EPR pair. The new EPR pair will be used between the sender and the receiver to remotely prepare a quantum state. This process will provide a secure way to share secret keys between the two parties who do not share EPR pairs. Furthermore, the process doesn't require sending any physical quantum state, instead the sender prepares a known state and sends only one classical bit to the receiver to help build an intended quantum state.
In cryptography, key distribution is the function that delivers a key to two parties who wish to communicate with each other in secure manner. Therefore, key distribution must be secure enough to thwart any attempts to compromise the system. In this project (paper) we will introduce a secure key distribution system based on quantum theory.
Hilbert space of multi-partite system is studied. Entanglement in multi-particle system is quantified and examples are provided. Application of entangled tri-particles in cryptography is introduced. It is shown that sending information using a tri-partite entangled system is more secure than sending them using an entangled pair of particles.
The quantum cryptographic key assignment problem is getting important in an optic network, when it is to assign cryptographic keys to each of communication parties via insecure optic channel. In this paper, we propose Three-Party Authenticated Quantum Key Distribution Protocol with Time-Bound (3PAQKD-TB). Each session key corresponding to the measurement bases dynamically changed for each time-period, which is belonging to the intersection set from both two parties' negotiated time bounds. In the constraint time-periods, the session key will be changed at each time-period. Both parties will generate the different polarization quantum states at each time-period. Therefore, the eavesdropper cannot guess easily the bases.
This paper investigates a new information reconciliation method for quantum key distribution in the case where two parties exchange key in the presence of a malevolent eavesdropper. We have observed that reconciliation is a special case of channel coding and for that existing techniques can be adapted for reconciliation. We describe an explicit reconciliation method based on Turbo codes. We believe that the proposed method can improve the efficiency of quantum key distribution protocols based on discrete quantum states.
Quantum key distribution (QKD) provides unconditional physical layer security for the distribution of encryption keys between legitimate parties. This paper presents a quantum key distribution protocol over a two-way quantum channel. This protocol does not require any classical communication channel for key sifting and key reconciliation. Utilizing the proposed protocol, one can reduce the overhead in the classical channel and increase the speed with which keys can be exchanged. Absence of a classical communication channel reduces operational overhead.
We present an experimental demonstration of a full quantum key distribution system employing weak laser pulses over a standard telecommunications fiber that uses the so-called "Plug and Play" or "auto-compensating" scheme. First experimental results show a fringe visibility of 0.985 and a quantum bit error rate of 2.3 % for a 25 km optical link.
We reviewed the confidentiality and authentication for multi-party applications. A conceptual model of a secure multicast network has been presented by adding a quantum key distribution (QKD) network to its architecture. The model is divided into three phases, the first phase, QKD network generate secure keys to encrypt not only data but also authentication process. The second phase, authentication making sure that no one except the legitimate user receive the message and making sure that nobody except the legitimate sender writes or modifies it. In the last phase, Multicast network encrypt the data by secure key and send it to receivers. The proposed scheme amid to provide a secure end to end communication for multicast network.
A quantum digital authentication scheme based on hash function is proposed in this paper. The security of the quantum protocol lies on the existence of quantum one way function by fundamental quantum principle. The practical difficulties in quantum control and quantum computation made quantum protocol hard to implement. Lack of authentication made the quantum protocol vulnerable to hackers. By introducing two level quantum system, authentications can be achieved with the help of hash function. To guarantee the authenticity, hash codes are split in to two parts and exchange of code is made through two quantum channels. This scheme uses a programmable polarizer ensuring the quantum one way function and removing the practical difficulties of quantum control and quantum computation. The proposed scheme presents a novel method to construct secure quantum authentication for future communication
In this paper, we point out Partially Entangled States quantum dialogue, which enables both legitimate parties to exchange their 2 bit secret messages in a direct way. Two step security check guarantees the security of this protocol. Partially Entangled States used as information carrier are easy to prepare and store, there is no need to transmit quantum states with secret message in quantum channel and two users can simultaneously communicate with the third party. The protocol is secure against the intercept-resend attack and the entangle-measure attack.
.th Abstract- Quantum Key (QKD) is developed to improve the security network in key exchange field. There are several success network equipment in implement QKD. However, the key distribution is limited to use in point-to-point scope. In this paper, we propose a design in quantum cryptography network that will extend the ability of number of users in present quantum cryptography network from point-to-point to multi-user network and sustain the security of the network. The developed system is implemented based on the existing quantum cryptography by managing the pairs joining of QKD system. The result of simulation is proven the feasibility to implement the proposed concept in real implementation.
It is generally accepted that quantum key distribution (QKD) could supply legitimate users with unconditional security during their communication. Quite a lot of satisfactory efforts have been achieved on experimentations with quantum cryptography. However, when the eavesdropper has extra-powerful computational ability, has access to a quantum computer, for example, and can carry into execution any eavesdropping measurement that is allowed by the laws of physics, the security against such attacks has not been widely studied and rigorously proved for most QKD protocols. Quite recently, Shor and Preskill proved concisely the unconditional security of the Bennett-Brassard 1984 (BB84) protocol. Their method is highly valued for its clarity of concept and concision of form. In order to take advantage of the Shor-Preskill technique in their proof of the unconditional security of the BB84 QKD protocol, we introduced in this paper a transformation that can translate the Bennett 1992 (B92) protocol into the BB84 protocol. By proving that the transformation leaks no more information to the eavesdropper, we proved the unconditional security of the B92 protocol. We also settled the problem proposed by Lo about how to prove the unconditional security of the B92 protocol with the Shor-Preskill method.