Download full-text PDF

A New Algorithm for Three-Party Quantum Key Distribution

Conference Paper (PDF Available)  · August 2013with273 Reads
DOI: 10.1109/INTECH.2013.6653692
Conference: Conference: 2013 Third International Conference on Innovative Computing Technology (INTECH), At London, United Kingdom
Abstract
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.
Full-text
Content uploaded by Khaled Elleithy
Author content
A New Algorithm for Three-Party Quantum Key.pdf
1 B
Sorry, there is no online preview for this file type.
Conference Paper
July 2012
    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... [Show full abstract]
    Conference Paper
    August 2013
      Classical cryptography is based on the computational difficulty to compute the secret key using the current computing systems. Depending only on the difficulty of computational complexity does not provide enough security because finding a fast method to calculate the secret key will compromise the security of the systems. Quantum computing uses the law of physics for communication allowing new... [Show full abstract]
      Conference Paper
      April 2014
        In this paper we propose a new protocol for multiparty secret key sharing by using quantum entanglement swapping. Quantum Entanglement swapping is a process that allows two non-interacting quantum systems to be entangled. Further, to increase the security level and to make sure that the users are legitimate, authentication for both parties will be required by a trusted third party. In this... [Show full abstract]
        Conference Paper
        April 2016
          Authentication is one of the security services that ensures sufficient security of the system by identification and verification. Also, it assures the identity of the communicating party to be that the claimed one. To build a quantum channel between two unauthenticated to each other parties, first, a trusted authority is needed to establish a mutual authentication with each party. Using Bell... [Show full abstract]
          Conference Paper
          May 2014
            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... [Show full abstract]
            Discover more