No full-text available
To read the full-text of this research,
you can request a copy directly from the authors.
Application of quantum cryptography protocols in authentication process
Abstract
This article presents proposition of using quantum cryptography protocols in authentication process. Model is based on BB84 protocol. It is certain that protocol needs a little modification but most fundamental features are kept. Article presents an example model of authentication process.
... It protects against attackers within the network where it can detect any eavesdropping attempt. It has been widely reported in literature that symmetric key distribution has several limitations due to its very design [5,6]. ...
... 2. Apply the Pretty Printed function as pretty (psi) to represent superposition state (state vector psi). 3. Apply the unitary matrix as shown in equation (5) in parallel to represent the function as U_f=uf (f, m, n) where x is the bit string, m is the input, and n is the output bits. Function (f) should be in the form of f (x, n) and do unitary matrix from f. 4. Apply the Hadamard transform (reversible gate) to returns the n-qubits where the Hadamard matrix implemented as H = Hadamard (n). ...
the reported research in literature for message transformation by a third party does not provide the necessary efficiency and security against different attacks. The data transmitted through the computer network must be confidential and authenticated in advance. In this paper, we develop and improve security of the braided single stage quantum cryptography. This improvement is based on a novel authentication algorithm by using signature verification without using the three stages protocol to share the secret key between the sender and receiver. This approach will work against attacks such as replay and man-in-the-middle by increasing the security as well as the over efficiency, reducing the overhead through using three stages and increasing the speed of the communication between two parties.
... Since the first QIA protocol [14] was proposed in 1995, quantum key distribution (QKD) and quantum entanglement have been widely used to design QIA protocols. Although the QKD-based protocol [15][16][17] can be easier implemented in reality, the limitations of the QKD protocol itself prevent further security improvements [18,19]. Quantum entanglement provides high security [20][21][22], multi-party authentication [23,24], and semi-quantum authentication [25,26] for some QIA protocols. ...
In this work, we propose a bit-oriented QIA protocol based on special properties of quantum rotation and the public key cryptographic framework. The proposed protocol exhibited good resistance to both forward search and measure-resend attacks, whereby its security performance was directly related to the length of the authentication code. From our analysis, it was demonstrated that the protocol has good performance, in terms of quantum bit efficiency. In addition, the protocol is well-expandable. The developed protocol is resource-efficient and can be also applied in quantum computing networks.
... All the QIA protocol designed with or without entanglement can be classified further as communication task or computational task as shown in Fig. 2. Many protocol are designed based on communication like quantum key distribution (QKD) [15,16], quantum secure direct communications (QSDC) [4,8], quantum secret sharing(QSS) [19][20][21] and teleportation [22,23] BB84 (without entanglement) [24] and Ekret91 (Entanglement) [25]. QKD protocol used in generation of key between the trusted user and the reduced version of the protocol helps in developing QIA.QSDC is a two way protocol, where both the parties directly communicate a message without the help of finite key. ...
Classical authentication schemes are in treat due to current developments in quantum computing. A new quantum authentication protocol designed based on quantum secure direct communication using single photon is proposed in the paper. It can assist verification of the legitimate user identity without revealing the pre-shared key used in the encryption of secure message through one time pad. In the existing protocol, frequent involvement of Eve during trusted identification obtains important information about the pre-shared key. A random Authentication keys and decoy states were used in checking the presence of Eve by a trusted party in two communication channels. The concept of phase kickback helps in revealing the identification the adversary involvement during authentication key verification by CNOT attack. The security of the proposed protocol analyzed was under impersonates attack, intercept measure-resend attack, and entangle measure attacks. The proposed protocol does not require quantum memory or any other entangles sources; therefore, it is feasible for the implementation of with current technology.
... Of course, one may need to slightly modify the original protocol of QKD to reduce it to a scheme for QIA. For example, such an effort was made in [96] where a scheme of QIA was obtained by slightly modifying BB84 protocol of QKD. Lately, a counterfactual QKD scheme was modified to propose a scheme for QIA in [83]. ...
Secure communication has achieved a new dimension with the advent of the schemes of quantum key distribution (QKD) as in contrast with classical cryptography, quantum cryptography can provide unconditional security. However, a successful implementation of a scheme for QKD requires identity authentication as a prerequisite. A security loophole in the identity authentication scheme may lead to the vulnerability of the entire secure communication scheme. Consequently, identity authentication is extremely important, and in the last three decades several schemes for identity authentication using quantum resources have been proposed. The chronological development of these protocols, which are now referred to as quantum identity authentication (QIA) protocols, is briefly reviewed here with specific attention to the causal connection involved in their development. The existing protocols are classified on the basis of the required quantum resources, and their relative merits and demerits are analyzed. Further, in the process of the classification of the protocols for QIA, it is observed that the existing protocols can also be classified in a few groups based on the inherent computational tasks used to design the protocols. Realization of these symmetries has led to the possibility of designing a set of new protocols for quantum identity authentication, which are based on the existing schemes for the secure computational and communication tasks. The security of such protocols is also critically analyzed.
... Of course, one may need to slightly modify the original protocol of QKD to reduce it to a scheme for QIA. For example, such an effort was made in [89] where a scheme of QIA was obtained by slightly modifying BB84 protocol of QKD. Lately, a counterfactual QKD scheme was modified to propose a scheme for QIA in [76]. ...
Secure communication has achieved a new dimension with the advent of the schemes of quantum key distribution (QKD) as in contrast to classical cryptography, quantum cryptography can provide unconditional security. However, a successful implementation of a scheme of QKD requires identity authentication as a prerequisite. A security loophole in the identity authentication scheme may lead to the vulnerability of the entire secure communication scheme. Consequently, identity authentication is extremely important and in the last three decades several schemes for identity authentication, using quantum resources have been proposed. The chronological development of these protocols, which are now referred to as quantum identity authentication (QIA) protocols, are briefly reviewed here with specific attention to the causal connection involved in their development. The existing protocols are classified on the basis of the required quantum resources and their relative merits and demerits are analyzed. Further, in the process of the classification of the protocols for QIA, it's observed that the existing protocols can also be classified in a few groups based on the inherent computational tasks used to design the protocols. Realization of these symmetries has led to the possibility of designing a set of new protocols for quantum identity authentication, which are based on the existing schemes of the secure computational and communication tasks. The security of such protocols is also critically analyzed.
... In the language of cryptography, this implies that sharing of prior secret is not necessary. This advantage has been used in various authentication protocols studied by X. Zhang (2009) [73], Y. Jing (2010) [74], H. Yuan (2014) [75], and other recent articles [76], [77], [78], [79], [80], [81], [72]. M. Oya proposed a QKD based authentication protocol which has better security measures than its predecessors, and was also shown to be implementable in Photonics technology [82]. ...
Quantum computers are considered a blessing to the dynamic technological world that promises to solve complex problems much faster than their known classical counterparts. Such computational power imposes critical threats on modern cryptography where it has been proven that asymmetric key cryptosystem will be rendered useless in a quantum world. However, we can utilize such a powerful mechanism for improving computer security by implementing such technology to solve complex data security problems such as authentication, secrets management, and others. Mainly, Quantum Authentication (QA) is an emerging concept in computer security that creates robust authentication for organizations, systems, and individuals. To delve deeper into the concept, for this research, we have further investigated QA through a detailed systematic literature review done on a corpus of N=859 papers. We briefly discuss the major protocols used by various papers to achieve QA, and also note the distribution of papers using those protocols. We analyzed the technological limitations mentioned by previous researchers and highlighted the lack of human-centered solutions for such modern inventions. We emphasize the importance of research in the user aspect of QA to make the users aware of its potential advantages and disadvantages as we move to the quantum age.
Quantum identity authentication (QIA) can theoretically realize the unconditional security of identity information. The current QIA protocols generally assume that the pre-agreed keys are not leaked. However, the keys themselves may be compromised. In this paper, a double-blind quantum identity authentication protocol based on scalar product computation is proposed. In the key generation stage, the scalar product of the two keys is stored in the database of a third-party platform. The two parties calculate the scalar product of their keys using a quantum private query (QPQ) protocol and compare the results with the expected results for authentication. Our protocol allows the two parties to be double-blind, i.e., they do not know each other's key. In this way, even if one party's key is leaked, the other party's key cannot be obtained.
Waveguided beam splitters were microfabricated by using a commercial two-photon lithography system (Nanoscribe), Ip-Dip as the waveguides and fused silica as the substrate, and they were covered with Loctite. The gap between the waveguides in the coupler was used to determine the transmission and reflection coefficients, and our results were compared with simulation results (using OptiFDTD software). The input and output ports of the beam splitters were spliced with multimode optical fibers in a robust system that can easily be handled. Then, they were tested by leading single photons (from an SPDC) to the beam splitters to produce different quantum statistics that were rated using the Fano factor.
Quantum Cryptography (QC) is an emerging security technique in which two parties communicate via a quantum channel. The fundamentals of quantum cryptography are No-cloning theorem and Heisenberg's uncertainty principle. This research paper proposes a simulation of quantum key exchange and authentication followed by an implementation of DNA based algorithm for secure message exchange.
We describe a theory of authentication and a system that implements it. Our theory is based on the notion of principal and a ‘speaks for’ relation between principals. A simple principal either has a name or is a communication channel; a compound principal can express an adopted role or delegated authority. The theory shows how to reason about a principal’s authority by deducing the other principals that it can speak for; authenticating a channel is one important application. We use the theory to explain many existing and proposed security mechanisms. In particular, we describe the system we have built. It passes principals efficiently as arguments or results of remote procedure calls, and it handles public and shared key encryption, name lookup in a large name space, groups of principals, program loading, delegation, access control, and revocation.
We describe a theory of authentication and a system that implements it. Our theory is based on the notion of principal and a 'speaks for' relation between principals. A simple principal either has a name or is a communication channel; a compound principal can express an adopted role or delegated authority. The theory shows how to reason about a principal's authority by deducing the other principals that it can speak for; authenticating a channel is one important application. We use the theory to explain many existing and proposed security mechanisms. In particular, we describe the system we have built. It passes principals efficiently as arguments or results of remote procedure calls, and it handles public and shared key encryption, name lookup in a large name space, groups of principals, program loading, delegation, access control, and revocation.
A quantum authentication protocol is presented in this paper. It is based on the correlations of the EPR(Einstain-Podolski-Rosen) pair which is a two-qubit system in one of the four Bell states. The two parties share a sequence of EPR pairs as the authentication key. To authenticate each other, they need to create auxiliary particles and make them interact with the authentication key. Then one can affirm the other's identity by performing the Bell states measurement. No one without the authentication key can pass the authentication process. So the protocol is secure. No classical channel and classical information exchange is needed in the authentication process. After the authentication process, the authentication key can be turned into the origin state. So the authentication key can be reused.
In this paper, we propose a secure user authentication protocol with nonentanglement-based QKD on jammable public channels between two parties, Alice and Bob. First, via an arbitrator (Trent), the protocol provides both quantum authentication and quantum key distribution. Second, due to the registration to the trusted third party and the initial bit string of Alice (or Bob), used for reversing the photon, only Alice (or Bob) could make the operation according to IA (or IB) . In other words, the protocol also provides quantum signature.
In this paper, we propose an efficient biometric-based remote user authentication scheme using smart cards, in which the computation cost is relatively low compared with other related schemes. The security of the proposed scheme is based on the one-way hash function, biometrics verification and smart card. Moreover, the proposed scheme enables the user to change their passwords freely and provides mutual authentication between the users and the remote server. In addition, many remote authentication schemes use timestamps to resist replay attacks. Therefore, synchronized clock is required between the user and the remote server. In our scheme, it does not require synchronized clocks between two entities because we use random numbers in place of timestamps.
When utilizing services over public networks, a remote user authentication mechanism forms a first line of defense by rejecting illegal logins from unauthorized users. On-line applications over the Internet such as E-learning, on-line games, etc. are ever more common; remote user participation via networks plays a vital role in security and should be guaranteed. Without this countermeasure, malicious users are likely to enable agents to communicate with remote on-line systems. While existing remote user authentication schemes rarely address this issue, this paper highlights the problem of guaranteeing remote user participation. This proposed user authentication scheme benefits from combining CAPTCHA techniques and visual secret sharing to ensure deliberate human interaction. This scheme provides mutual authentication and is secure against certain known attacks, as well as low in computation cost.
We show our approach in developing an identity management system with respect to multilateral security. After examining digital pseudonyms and credentials as basic concepts of such a system, we give an introduction to technologies for multilateral security and describe an architecture which enables multilaterally secure communication. By means of different scenarios we show requirements of an identity management system, and outline an approach in developing an identity manager and its infrastructure. Finally, we discuss problems and risks of identity management systems which must be considered when using such a system.
Authentication ensures that system's resources are not obtained fraudulently by illegal users. Password authentication is one of the simplest and the most convenient authentication mechanisms over insecure networks. The problem of password authentication in an insecure networks is present in many application areas. Since computing resources have grown tremendously, password authentication is more frequently required in areas such as computer networks, wireless networks, remote login, operation systems, and database management systems. Many schemes based on cryptography have been proposed to solve the problem. However, previous schemes are vulnerable to various attacks and are neither efficient, nor user friendly. Users cannot choose and change their passwords at will. In this paper, we propose a new password authentication scheme to achieve the all proposed requirements. Furthermore, our scheme can support the Diffie–Hellman key agreement protocol over insecure networks. Users and the system can use the agreed session key to encrypt/decrypt their communicated messages using the symmetric cryptosystem.
Authentication protocols are the basis of security in many distributed systems, and it is therefore essential to ensure that these protocols function correctly. Unfortunately, their design has been extremely error prone. Most of the protocols found in the literature contain redundancies or security flaws. A simple logic has allowed us to describe the beliefs of trustworthy parties involved in authentication protocols and the evolution of these beliefs as a consequence of communication. We have been able to explain a variety of authentication protocols formally, to discover subtleties and errors in them, and to suggest improvements. In this paper we present the logic and then give the results of our analysis of four published protocols, chosen either because of their practical importance or because they serve to illustrate our method.
Authentication protocols are the basis of security in many distributed systems, and it is therefore essential to ensure that these protocols function correctly. Unfortunately, their design has been extremely error prone. Most of the protocols found in the literature contain redundancies or security flaws.
A simple logic has allowed us to describe the beliefs of trustworthy parties involved in authentication protocols and the evolution of these beliefs as a consequence of communication. We have been able to explain a variety of authentication protocols formally, to discover subtleties and errors in them, and to suggest improvements. In this paper, we present the logic and then give the results of our analysis of four published protocols, chosen either because of their practical importance or because they serve to illustrate our method.
Use of encryption to achieve authenticated communication in computer networks is discussed. Example protocols are presented for the establishment of authenticated connections, for the management of authenticated mail, and for signature verification and document integrity guarantee. Both conventional and public-key encryption algorithms are considered as the basis for protocols.
This paper presents a simulation of neural network systems for identifying computer users. A comparative evaluation study of three neural network paradigms as applied to the identification of computer users using keystroke intervals when typing a well-known phrase is made. The input vectors were made up of the time intervals between successive keystrokes created by users while typing characters. Each input vector was classified into one of several classes, thereby identifying the user who typed the phrase. We investigated and compared the performance of the neural network paradigms as applied to this problem. These paradigms are: Adaptive Resonance Theory-2 (ART-2), backpropagation, and counterpropagation. The identification technique presented here is accurate, practical, and novel.
Practical application of the generalized Bell's theorem in the so-called key distribution process in cryptography is reported. The proposed scheme is based on the Bohm's version of the Einstein-Podolsky-Rosen gedanken experiment and Bell's theorem is used to test for eavesdropping.
Quantum techniques for key distribution—the classically impossible task of distributing secret information over an insecure channel whose transmissions are subject to inspection by an eavesdropper, between parties who share no secret initially—have been proposed using (a) four nonorthogonally polarized single-photon states or low-intensity light pulses, and (b) polarization-entangled or spacetime-entangled two-photon states. Here we show that in principle any two nonorthogonal quantum states suffice, and describe a practical interferometric realization using low-intensity coherent light pulses.
Biometrics is emerging as the most foolproof method of automated personal identification in demand in an ever more automated world. Biometric systems are automated methods of verifying or recognizing the identity of a living person on the basis of some physiological characteristic, like a fingerprint or iris pattern, or some aspect of behavior, like handwriting or keystroke patterns. This paper describes the range of biometric systems in development or on the market including: handwriting; fingerprints; iris patterns; human faces; and speech.< >
Identity Management and Its Support of Multilateral Security Computer Networks, no. 37, [15] D. Denning: Security strategies for e-companies
- S Clauß
- M Kuhntopp
S. Clauß, M. Kuhntopp: Identity Management and Its Support of Multilateral Security. Elsevier, Computer Networks, no. 37, [15] D. Denning: Security strategies for e-companies. Information Security Magazine 1/ 2001
Password pain relief. Information Security Magazine
- R Yasin
Rozproszone systemy autentyfikacji
- A Kapralski
A Practical Approach to User Authentication. Electronic Cipher no. 9412. Newsletter of IEEE Computer Society Technical Committee on Security and Privacy
- M Brown
- S J Rogers
Seven Issues with Human Authentication Technologies
- L O Gorman
Karta elektroniczna - bezpieczny nosnik informacji. Wy-dawnictwo MIKOM
- M Kubas
- M Molski
The importance of authentication
- B Schneier
Problemy autentykacji uzytkowników i bezpiecznej transmisji danych w sieciach WLAN 802
- M Bednarczyk
Ikebata: A Microcomputer-Based Personal Identification Sys-tem
- H Yoshikawa
Security strategies for e-companies. Information Security Magazine 1
- D Denning
Smart Card Programming and Security
A Microcomputer-Based Personal Identification Sys-tem
- H Yoshikawa
- S Ikebata