Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Dianzi xuebao

Quantum Fuzzy Commitment and Biometric Authentication Scheme Based on Entanglement-Assisted Quantum Error-Correcting Codes

Song Yao-liang

Published Jan 1, 2012• 0 citations
OpenAlex

Abstract

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.

Related papers

Biometric authentication constructed from quantum entropy distribution fuzzy hash

Dong Cao, Yaoliang Song

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.

•Oct 1, 2014•2 citations

Quantum Fuzzy Classification Hashing Algorithm with the One-Time Pad Security Properties

Dong Cao

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.

Applied Mechanics and Materials•Dec 1, 2014•1 citation

Quantum-Enhanced Multi-Factor Authentication Framework for Digital Banking Systems: A Post-Quantum Cryptographic Approach

Praveen Kumar Reddy Gujjala

The digital banking ecosystem faces unprecedented security challenges with the imminent advent of quantum computing, which threatens to compromise existing cryptographic infrastructures. Traditional multi-factor authentication (MFA) systems in banking rely on classical cryptographic primitives vulnerable to quantum attacks, creating critical security gaps in financial transactions and customer data protection. This paper introduces a novel Quantum-Enhanced Multi-Factor Authentication Framework (QE-MFAF) specifically designed for digital banking systems, integrating lattice-based post-quantum cryptography with biometric fuzzy commitment schemes and behavioral analytics. The proposed framework incorporates a hybrid authentication mechanism combining quantum-resistant cryptographic protocols, continuous behavioral pattern recognition using deep learning models, and secure multi-party computation for transaction verification. Experimental validation on a synthetic banking dataset demonstrates superior performance with 99.7% authentication accuracy, 0.02% false positive rate, and 15ms average authentication latency while maintaining quantum resistance. The framework successfully mitigates advanced persistent threats, insider attacks, and quantum-based cryptographic vulnerabilities while ensuring seamless user experience in high-transaction banking environments. Performance comparisons with existing banking authentication systems show 34% improvement in security metrics and 28% reduction in computational overhead.

International Journal For Multidisciplinary Research•Dec 7, 2023•8 citations

Computationally secure bit commitment protocol based on quantum steganography

Cao Dong, Song Yao-liang

In quantum bit commitment(QBC),most existed proposals analyze little of communicating an innocent message over noisy quantum channels.These methods are not practical.Based on the information hiding characteristics of quantum steganography,a novel QBC protocal is proposed.An elegant scheme is presented for disguising secret information as quantum noise,and embedding it in stego qubits which encode into a codeword of quantum error-correcting code.The method is proved secure and effective in the presence of noisy quantum channel and it's a potential eavesdropper.The results of theoretical analysis and numerical simulation show that the proposed scheme has perfect concealing and binding properties. Theoretical analysis proved the validity.The method forms a theoretical basis for the promotion and application of quantum cryptographic protocols.

Chinese Journal of Quantum Electronics•Jan 28, 2012•1 citation

A Quantum Secure Entity Authentication Protocol Design for Network Security

Surjit Paul, Sanjay Kumar, Rajiv Ranjan Suman

Authentication is one of the significant issues for all kinds of network communications. Most of the authentication protocols designed and implemented so far for entity authentication are based on classical cryptographic techniques to prevent themselves from different types of attacks. These protocols use either password or challenge for authentication. In this article, the design of the proposed quantum secure entity authentication protocol is shown. The proposed protocol is based on the challenge response method. Due to quantum computer capability to break mathematical complexity-based cryptographic techniques, the proposed protocol uses the one-time pad (OTP) to secure itself from attacks, i.e., eavesdropping, reply attack, password guessing attack, man-in-the-middle attack, brute-force attack, quantum computer attack, etc. Security of the proposed protocol was analyzed, and it shows that the proposed protocol may prevent itself from different types of attacks. Further, analysis for quantum Secure was carried out. From the analysis, it is found that if the OTP key is truly random and cannot be reused, then a computer with infinite capacity or quantum computer cannot break the encrypted challenge and response. The proposed protocol may be used for entity authentication for the client, server, process, and user.

IGI Global eBooks•Jan 1, 2021•0 citations

Practical Biometric-Authenticated Quantum Key Agreement via A Single Quantum Channel

Mengyan Li, Wei Gao, Bingling Wang +1 more

When designing a practical biometric-authenticated two-party quantum key agreement (QKA) protocol, it is essential to comprehensively consider factors such as authentication mechanisms, allocation of quantum resources, reliability of quantum channels, and qubit efficiency. This paper introduces a fully trusted registry that leverages fuzzy extractors for participant registration and authentication, uses Bell states as the primary quantum resource, and integrates entanglement swapping of Bell states with Bell measurements and classical binary encoding to achieve feasible qubit efficiency in generating the final shared key by a single quantum channel. Additionally, the proposed protocol has been successfully simulated using Qiskit, and its correctness has been rigorously verified. Further security analysis and performance comparisons show this protocol can achieve optimal results within the constraints of current quantum technologies.

Procedia Computer Science•Jan 1, 2026•0 citations
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.
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.
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.
The digital banking ecosystem faces unprecedented security challenges with the imminent advent of quantum computing, which threatens to compromise existing cryptographic infrastructures. Traditional multi-factor authentication (MFA) systems in banking rely on classical cryptographic primitives vulnerable to quantum attacks, creating critical security gaps in financial transactions and customer data protection. This paper introduces a novel Quantum-Enhanced Multi-Factor Authentication Framework (QE-MFAF) specifically designed for digital banking systems, integrating lattice-based post-quantum cryptography with biometric fuzzy commitment schemes and behavioral analytics. The proposed framework incorporates a hybrid authentication mechanism combining quantum-resistant cryptographic protocols, continuous behavioral pattern recognition using deep learning models, and secure multi-party computation for transaction verification. Experimental validation on a synthetic banking dataset demonstrates superior performance with 99.7% authentication accuracy, 0.02% false positive rate, and 15ms average authentication latency while maintaining quantum resistance. The framework successfully mitigates advanced persistent threats, insider attacks, and quantum-based cryptographic vulnerabilities while ensuring seamless user experience in high-transaction banking environments. Performance comparisons with existing banking authentication systems show 34% improvement in security metrics and 28% reduction in computational overhead.
In quantum bit commitment(QBC),most existed proposals analyze little of communicating an innocent message over noisy quantum channels.These methods are not practical.Based on the information hiding characteristics of quantum steganography,a novel QBC protocal is proposed.An elegant scheme is presented for disguising secret information as quantum noise,and embedding it in stego qubits which encode into a codeword of quantum error-correcting code.The method is proved secure and effective in the presence of noisy quantum channel and it's a potential eavesdropper.The results of theoretical analysis and numerical simulation show that the proposed scheme has perfect concealing and binding properties. Theoretical analysis proved the validity.The method forms a theoretical basis for the promotion and application of quantum cryptographic protocols.
Authentication is one of the significant issues for all kinds of network communications. Most of the authentication protocols designed and implemented so far for entity authentication are based on classical cryptographic techniques to prevent themselves from different types of attacks. These protocols use either password or challenge for authentication. In this article, the design of the proposed quantum secure entity authentication protocol is shown. The proposed protocol is based on the challenge response method. Due to quantum computer capability to break mathematical complexity-based cryptographic techniques, the proposed protocol uses the one-time pad (OTP) to secure itself from attacks, i.e., eavesdropping, reply attack, password guessing attack, man-in-the-middle attack, brute-force attack, quantum computer attack, etc. Security of the proposed protocol was analyzed, and it shows that the proposed protocol may prevent itself from different types of attacks. Further, analysis for quantum Secure was carried out. From the analysis, it is found that if the OTP key is truly random and cannot be reused, then a computer with infinite capacity or quantum computer cannot break the encrypted challenge and response. The proposed protocol may be used for entity authentication for the client, server, process, and user.
When designing a practical biometric-authenticated two-party quantum key agreement (QKA) protocol, it is essential to comprehensively consider factors such as authentication mechanisms, allocation of quantum resources, reliability of quantum channels, and qubit efficiency. This paper introduces a fully trusted registry that leverages fuzzy extractors for participant registration and authentication, uses Bell states as the primary quantum resource, and integrates entanglement swapping of Bell states with Bell measurements and classical binary encoding to achieve feasible qubit efficiency in generating the final shared key by a single quantum channel. Additionally, the proposed protocol has been successfully simulated using Qiskit, and its correctness has been rigorously verified. Further security analysis and performance comparisons show this protocol can achieve optimal results within the constraints of current quantum technologies.