In this paper, we propose a novel construction method of biometric authentication algorithm based on quantum entropy distribution fuzzy hash. Utilizing the special attributes of normalized quantum information entropy, the quantum fuzzy hash is combined with the distribution architecture of quantum data sequence, and can extract the maximum common feature of quantum information exist in these homologous data files. Based on the degree of difference in these hash values, the proposed quantum entropy distribution fuzzy hash algorithms can efficiently identify similarity quantum data files. The novel quantum entropy distribution fuzzy hash is constituted by quantum algorithm, and the corresponding biometric authentication algorithm solved the problem that classical similar algorithms cannot efficiently resist the attack of quantum Turing machine. Theoretical analysis proves that the securities of the proposed schemes are satisfying conditions of the information security and access control validity.
In this paper, we propose a novel construction method of biometric authentication algorithm based on quantum entropy distribution fuzzy hash. Utilizing the special attributes of normalized quantum information entropy, the quantum fuzzy hash is combined with the distribution architecture of quantum data sequence, and can extract the maximum common feature of quantum information exist in these homologous data files. Based on the degree of difference in these hash values, the proposed quantum entropy distribution fuzzy hash algorithms can efficiently identify similarity quantum data files. The novel quantum entropy distribution fuzzy hash is constituted by quantum algorithm, and the corresponding biometric authentication algorithm solved the problem that classical similar algorithms cannot efficiently resist the attack of quantum Turing machine. Theoretical analysis proves that the securities of the proposed schemes are satisfying conditions of the information security and access control validity.
Fuzzy commitment based on classical cryptographic algorithms can not resist the attack of quantum algorithms.This paper presents a quantum fuzzy commitment by using entanglement-assisted quantum error correcting codes and quantum hash.Fuzzy commitment set can be constructed from the codes space of the entanglement-assisted quantum error-correcting codes,and the quantum codes need not satisfy the requirement of self-dual constraint.In commitment phase,the code word is transformed based on commitment witness.The information process can resist quantum Fourier sampling attack.Then,we present a quantum hash algorithm.The random qubits are adjusted with diffusion and confusion,and then encrypted by using the random secret key.The security of the process is same as the one-time pad.The proposed scheme can resist the attack of quantum Turing machines.Based on the quantum fuzzy commitment,this paper also gives a quantum challenge-response biometric authentication scheme.Theoretical analysis shows that our protocol has good security and validity.
We propose a new method of quantum fuzzy classification hashing scheme constructed from the method of quantum information processing. Based on the uniform random fuzziness of the template set produced by the quantum fuzzy classification hashing, Security of the identification scheme is equivalent to one-time pad. Compared to the construction schemes based on similar method, the novel quantum fuzzy classification hashing scheme has a more simplified structure. Our algorithms have outstanding data security and validity. Theoretical analysis shows that the quantum fuzzy classification hashing can effectively resist the attack of quantum computation.
A significant problem facing cybersecurity is that most client/server identity authentication schemes depend on computational complexity which is recently challenged by the super exponential computational abilities of quantum computers. Quantum cryptography with its quantum mechanics principles solves this problem and provides mathematically un-hackable secure communication for the quantum computers epoch. Biometric authentication has a big challenge related to its protection as it has to be submitted and stored in encrypted form. Unfortunately, most existing biometric cryptosystems rely on classical cryptography, so they are insecure in quantum era. This problem is solved in this paper by introducing a novel three-factor biometric quantum identity authentication scheme combining something you know (password), something you produce (client’s voice), and something you are (client’s face image) is proposed. The scheme consists of two phases: client enrollment and client login/authentication. The methodology is to use in the enrollment phase, two layers of quantum encryption for the client’s voice signal. Each layer consists of two simple quantum circuits of SWAP and C-NOT quantum gates respectively using a different pseudorandom key obtained from a cellular automata (CA) pseudorandom generator. The proposed scheme has many merits. Firstly, it introduces a new design of muti-factors quantum biometric authentication scheme as the biometric voice data is processed, transmitted, and stored at the server database in an encrypted unconditionally secure quantum form which provides parallel processing, real-time communications, inherent level of security against attacks, tamper-proof security and exponential powerful storage capability due to the quantum properties. Secondly, the proposed scheme achieves double-layers security by combing quantum voice encryption and quantum secure direct communication in one process such that the quantum channel eavesdropper cannot obtain any valuable information in case of information leakage. Thirdly, the distribution and management of encryption key problem is solved as there is no need for key exchange prior to communication. Fourthly, it achieves high communication efficiency as although it is a three-factor biometric identity authentication, only one biometric data is sent in quantum encrypted form to the server. Fifthly, the numerical simulations showed that the proposed scheme has large key space, high key sensitivity and more robust performance against different types of attacks compared to other existing classical and quantum voice encryption schemes. Finally, as an identity authentication method, the proposed scheme achieves identification accuracy of 100% with zero False Rejection Rate (FRR) and zero False acceptance rate (FAR) which is perfect.
Biometric authentication has become integral to digital identity systems, particularly in smart cities where it enables secure access to services across governance, transportation, and public infrastructure. Centralised architectures, though widely used, pose privacy and scalability challenges due to the aggregation of sensitive biometric data. Decentralised identity frameworks offer better data sovereignty and eliminate single points of failure but introduce new security concerns, particularly around mutual trust among distributed devices. In such environments, biometric sensors and verification agents must authenticate one another before sharing sensitive biometric data. Existing authentication schemes rely on classical public key infrastructure, which is increasingly susceptible to quantum attacks. This work addresses this gap by proposing a quantum-secure communication protocol for decentralised biometric systems, built upon an enhanced Quantum Key Distribution (QKD) system. The protocol incorporates quantum-resilient authentication at both the classical and quantum layers of QKD: post-quantum cryptography (PQC) is used to secure the classical channel, while authentication qubits verify the integrity of the quantum channel. Once trust is established, QKD generates symmetric keys for encrypting biometric data in transit. Qiskit-based simulations show a key generation rate of 15 bits/sec and 89% efficiency. This layered, quantum-resilient approach offers scalable, robust authentication for next-generation smart city infrastructures.
Quantum authentication protocol can be used to authenticate classical messages in a secure manner. In this paper, by using the cryptographic hash function and non-orthogonal qubits, a quantum authentication protocol of classical messages is proposed. In our protocol, the classical messages and their corresponding tags are encoded as nonorthogonal qubits. The message receiver decodes the classical messages and their corresponding tags from the received qubits by using the authentication key. To verify the validity of the received classical messages, the message receiver verifies whether the hash values of the decoded classical messages are equal to the corresponding tags. Our scheme can be proved to be secure against forgery attack and measurement attack. On the other hand, the authentication key is a binary string, which can be securely obtained and easily saved. What is more, because the authentication key remains secure after executing the authentication protocol, it provides the possibility of reusing the authentication key.
Several remote user authentication schemes have been proposed using external memory and smart cards. Smart card-based schemes have user mobility and deployment problems, and those based on external memory have a tamper resistance problem. Although Cherbal and Benchetioui’s scheme solved remote authentication problems using Elliptical Curve Cryptography and 2-Factor authentication, they still have not addressed key distribution, perfect forward secrecy, and session hijacking issues. This research proposes an enhanced multi-factor authentication and access control scheme based on the S13 quantum key distribution protocol, using a client file in an external memory. The proposed scheme combines the powers of an enhanced quantum key distribution, a lightweight tamper-resistance client file, and biometrics to overcome these limitations. The security of the proposed scheme was verified, validated, and evaluated against the reviewed scheme using various tools. The AVISPA simulation results showed that the proposed scheme is validated, secure against session hijacking, has a secure key distribution policy, and ensures perfect forward secrecy. The security functionalities analysis shows that the proposed scheme has the highest security index of 13 and is the only scheme that used the tamper-resistance client file in an external memory for the first time. The performance evaluation results showed that the proposed scheme is more efficient than the reviewed scheme with a computation cost of 0.83125s and 0.25902s and a percentage improvement of 48.48% and 73.98% for the respective user and server and a more efficient communication costs of 2112 bits than the reviewed scheme with a percentage improvement of 16.46%.