ISSN: 0976-3031
Research Article
AUTHENTICATION USING KEY DISTRIBUTION PROTOCOL WITH CRYPTOGRAPHY
Roja N
1, Revathy N*
2, Guhan T
3, Kavitha V
4and Gayathri C
51,2,4,5
PG and Research Department of Computer Applications, Hindusthan College of Arts and Science,
Coimbatore, India
3
Department of Computer Science and Engineering, Sri Ramakrishna Engineering College,
Coimbatore, India
DOI: http://dx.doi.org/10.24327/ijrsr.2019.1009.3975
ARTICLE INFO ABSTRACT
Key distribution protocols to safeguard security in large networks, ushering in new directions in classical cryptography and cryptography. Two three-party Key distribution protocols, one with implicit user authentication and the other with explicit mutual authentication, are proposed to demonstrate the merits of the new combination, which include the following: 1) security against such attacks as man-in-the-middle, eavesdropping and replay, 2) efficiency is improved as the proposed protocols contain the fewest number of communication rounds among existing Key distribution protocols, and 3) two parties can share and use a long-term secret. To prove the security of the proposed schemes, this work also presents a new primitive called the Unbiased-Chosen Basis (UCB) assumption.
INTRODUCTION
Quantum cryptography, or quantum key distribution (QKD), uses quantum mechanics to guarantee secure communication. It enables two parties to produce a shared random bit string known only to them, which can be used as a key to encrypt and decrypt messages.
An 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. These results from a fundamental part of quantum mechanics: the process of measuring a quantum system in general disturbs the system. A third party trying to eavesdrop on the key must in some way measure it, thus introducing detectable anomalies. By using quantum superposition or quantum entanglement and transmitting information in quantum states, a communication system can be implemented which detects eavesdropping. If the level of eavesdropping is below a certain threshold a key can be produced which is guaranteed as secure (i.e. the eavesdropper has no information about), otherwise no secure key is possible and communication is aborted.
Modules Description
Login Sender Trusted Center Receiver
Module Description Login Module
User Login Admin Login
Sender Module
Secret key Authentication
The sender give the secret key to the trusted center, then the TC will verify the secret and authenticate to the corresponding sender and get the session key from TC or else TC not allow the user transmission
Encryption
The message is encrypted by the received session key and appends the quit with that encrypted message, then
International Journal of
Recent Scientific
Research
International Journal of Recent Scientific Research
Vol. 10, Issue, 09(D), pp. 34794-34798, September, 2019
Copyright © Roja N et al, 2019, this is an open-access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution and reproduction in any medium, provided the original work is properly cited.
DOI: 10.24327/IJRSR
CODEN: IJRSFP (USA)
Article History:
Received 4th June, 2019
Received in revised form 25th July, 2019 Accepted 23rd August, 2019
Published online 28th September, 2019
Key Words:
Man-in-the-middle attack, Unbiased-Chosen Basis (UCB), Mutual
transmit the whole information to the corresponding receiver.
Trusted Center Module
Secret Key Verification
Verify the secret key received from the user and authenticate the corresponding user for secure transmission.
Session Key Generation
It is shared secret key which is used to for encryption and decryption. The size of session key is 8 bits. This session key is generated from pseudo random prime number and exponential value of random number Qubit Generation
Quantum Key Generation Hashing
Key Distribution
Receiver Module
Secret key Authentication Decryption
Study about the System Existing system
In classical cryptography, three-party key distribution protocols utilize challenge response mechanisms or timestamps to prevent replay attacks. However, challenge response mechanisms require at least two communication rounds between the TC and participants, and the timestamp approach needs the assumption of clock synchronization, which is not practical in distributed systems (due to the unpredictable nature of network delays and potential hostile attacks). Furthermore, classical cryptography cannot detect the existence of passive attacks such as eavesdropping. On the contrary, a channel eliminates eavesdropping, and, therefore, replay attacks.
This fact can then be used to reduce the number of rounds of other protocols based on challenge-response mechanisms to a trusted center (and not only three-party authenticated key distribution protocols).
Disadvantages of Basic Scheme
Web Browser or other client Program provides credentials in the form of username and Password. Although the scheme is easily implemented, it relies
on the assumption that the connection between the client and server computers is secure and can be trusted
The credentials are passed as plaintext and could be intercepted easily. The scheme also provides no protection for the information passed back from the server.
Proposed System
In mutual cryptography, key distribution protocols employ mechanisms to distribute session keys and public discussions to check for eavesdroppers and verify the correctness of a session key. However, public discussions require additional communication rounds between a sender and receiver and precious qubits. By contrast, classical cryptography provides
convenient techniques that enable efficient key verification and user authentication.
Advantages
Quantum cryptography, or quantum key distribution (QKD), uses quantum mechanics to guarantee secure communication. It enables two parties to produce a shared random bit string known only to them, which can be used as a key to encrypt and decrypt messages.
An 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. These results from a fundamental part of quantum mechanics: the process of measuring a quantum system in general disturbs the system. A third party trying to eavesdrop on the key must in some way measure it, thus introducing detectable anomalies. By using quantum superposition or quantum entanglement and transmitting information in quantum states, a communication system can be implemented which detects eavesdropping. If the level of eavesdropping is below a certain threshold a key can be produced which is guaranteed as secure (i.e. the eavesdropper has no information about), otherwise no secure key is possible and communication is aborted.
System Implmentation
Implementation is the process that actually yields the lowest-level system elements in the system hierarchy (system breakdown structure). The system elements are made, bought, or reused. Production involves the hardware fabrication processes of forming, removing, joining, and finishing; or the software realization processes of coding and testing; or the operational procedures development processes for operators' roles. If implementation involves a production process, a manufacturing system which uses the established technical and management processes may be required.
The purpose of the implementation process is to design and create (or fabricate) a system element conforming to that element’s design properties and/or requirements. The element is constructed employing appropriate technologies and industry practices. This process bridges the system definition processes and the integration process.
System Implementation is the stage in the project where the theoretical design is turned into a working system. The most critical stage is achieving a successful system and in giving confidence on the new system for the user that it will work efficiently and effectively. The existing system was long time process.
Experimental Results Main Form Design
Main Page – Sender
Sender - Login Page
Secret key used to send
Receiver - Login Page
Sending Process
Sending Process Starts
Data has been sent
Data has been sent
Receive the Data
CONCLUSION
Authentication is the process of recognizing a user's identity. It can be done in two phases
* Identification and * Actual authentication.
This study proposed two three-party QKDPs to demonstrate the advantages of combining classical cryptography with quantum cryptography. Compared with classical three-party key distribution protocols, the proposed QKDPs easily resist replay and passive attacks. Compared with other QKDPs, the proposed schemes efficiently achieve key verification and user authentication and preserve a long-term secret key between the TC and each user. Additionally, the proposed QKDPs have fewer communication rounds than other protocols.
Although the requirement of the quantum channel can be costly in practice, it may not be costly in the future. Moreover, the proposed QKDPs have been shown secure under the random oracle model. By combining the advantages of classical cryptography with quantum cryptography, this work presents a new direction in designing QKDPs.
Scope for Future Enhancement
In future our project is meant, in contrast to quantum key distribution where unconditional security can be achieved based only on the laws of quantum physics, in the case of various tasks in mistrustful cryptography there are no-go theorems showing that it is impossible to achieve unconditionally secure protocols based only on the laws of quantum physics. However, some of these tasks can be implemented with unconditional security if the protocols not only exploit quantum mechanics but also special relativity.
References
G. Li, “Efficient Network Authentication Protocols: Lower Bounds and Optimal Implementations,” Distributed Computing, vol. 9, no. 3, pp. 131-145, 1995.
A. Kehne, J. Schonwalder, and H. Langendorfer, “A Nonce-Based Protocol for Multiple Authentications,” ACM Operating Systems Rev., vol. 26, no. 4, pp. 84-89, 1992. M. Bellare and P. Rogaway, “Provably Secure Session Key
Distribution: The Three Party Case,” Proc. 27th ACM Symp. Theory of Computing, pp. 57-66, 1995.
J. Nam, S. Cho, S. Kim, and D. Won, “Simple and Efficient Group Key Agreement Based on Factoring,” Proc. Int’l Conf. Computational Science and Its Applications (ICCSA ’04), pp. 645-654, 2004.
H.A. Wen, T.F. Lee, and T. Hwang, “A Provably Secure Three- Party Password-Based Authenticated Key Exchange Protocol Using Weil Pairing,” IEEE Proc. Comm., vol. 152, no. 2, pp. 138-143, 2005
How to cite this article:
Roja N et al., 2019, Authentication Using Key Distribution Protocol With Cryptography. Int J Recent Sci Res. 10(09), pp. 34794-34798. DOI: http://dx.doi.org/10.24327/ijrsr.2019.1009.3975
