Fingerprint recognition systems [1] are based on quite complex algorithms for extracting the unique characteristics of individuals to identify and authenticate with a minimum of errors. Individual characteristics are captured by technical means, and then compared against previously stored templates to verify or identify an individual. The manipulation of the biometric data from the collection to the comparison with the ones stored in the databases, as well as the protection of the stored templates against their copying or alteration, are of crucial importance. Quantum secret sharing is a procedure of sharing a quantum message into multiple parts, such that no subset of the parts is sufficient to reconstruct the message, but the whole set is. This paper shows how this technique can be implemented to protect fingerprint templates. In this research, we extend quantum secret sharing (QSS) to quantum images, implement in Qiskit and show how a fingerprint template can be stored in quantum systems and then, using GHZ states can be shared, and the cooperation of all shares is required to rebuild the original template.
Secret sharing is a procedure for splitting a message into several parts so that no subset of parts is sufficient to read the message, but the entire set is. We show how this procedure can be implemented using Greenberger-Horne-Zeilinger (GHZ) states. In the quantum case the presence of an eavesdropper will introduce errors so that his presence can be detected. We also show how GHZ states can be used to split quantum information into two parts so that both parts are necessary to reconstruct the original qubit.
Quantum secret sharing (QSS) is a cryptographic protocol that leverages quantum mechanics to distribute a secret among multiple parties. With respect to the classical counterpart, in QSS, the secret is encoded into quantum states and shared by a dealer such that only an authorized subsets of participants, i.e., the players, can reconstruct it. Several state-of-the-art studies aim to transpose classical secret sharing into the quantum realm, while maintaining their reliance on traditional network topologies (e.g., star, ring, and fully connected), and require that all the
nplayers calculate the secret. These studies exploit the Greenberger–Horne–Zeilinger state, which is a type of maximally entangled quantum state involving three or more qubits. However, none of these works account for redundancy, enhanced security/privacy features, or authentication mechanisms able to fingerprint players. To address these gaps, in this article, we introduce a new concept of QSS, which leans on a generic distributed quantum network, based on a threshold scheme, where all the players collaborate also to the routing of quantum information among them. The dealer, by exploiting a custom flexible weighting system, takes advantage of a newly defined quantum Dijkstra algorithm to select the most suitable subset of
tplayers, out of the entire set on
nplayers, to involve in the computation. To fingerprint and authenticate users, CRYSTAL-Kyber primitives are adopted, while also protecting each player’s privacy by hiding their identities. We show the effectiveness and performance of the proposed protocol by testing it against the main classical and quantum attacks, thereby improving the state-of-the-art security measures.
Abstract The fundamental concept of secret sharing involves dividing a secret into multiple parts and distributing them among several participants, who collectively safeguard the secret. When it comes to restoring the secret, cooperation among specific participants is necessary to reconstruct the original secret. Quantum secret sharing (QSS) employs quantum methods to address some limitations of classical secret sharing. Semi-QSS, an advancement of quantum methods, requires fewer quantum resources. Previous semi-quantum protocols demanded at least one participant with full quantum capabilities and randomly generated secret information. This paper introduces a protocol allowing three participants lacking complete quantum capabilities to share secret information of specific bits with the assistance of a third party possessing complete quantum capabilities. Unlike previous approaches, this protocol does not require participants to possess full quantum capabilities and shares secret information of specific bits. These characteristics make the protocol more practical and flexible for real-world applications.
Fingerprint-based authentication is widely used because it is convenient and dependable, yet it also raises serious security concerns. Unlike passwords, biometric traits cannot be replaced once exposed, so the protection of stored templates is essential. At the same time, progress in quantum computing creates new risks for the classical cryptographic methods that are typically used to safeguard biometric data.This paper introduces QuMetric, a hybrid fingerprint authentication framework that combines classical template protection with lightweight quantum similarity evaluation. Instead of encoding raw fingerprint images directly into quantum states, the method first extracts minutiae, converts them into a rotation-invariant radial-angular histogram, protects the feature representation using a key derived from simulated quantum key distribution (QKD), and then maps the protected data into quantum states using angle-based RYrotations. Authentication is performed through a hybrid similarity score that combines quantum state fidelity with Hamming similarity.The proposed system uses only 12 qubits, which keeps it practical for near-term quantum hardware. Experiments on the SOCOFing dataset using 200 subjects, 1,999 genuine pairs, and 1,000 impostor pairs produce an Equal Error Rate (EER) of 7.85% and an Area Under the ROC Curve (AUC) of 0.9761.These results show that secure and resource-efficient quantum-assisted biometric authentication is feasible within current NISQ-era constraints.
Fingerprints remain constant throughout life. In over 140 years of fingerprint analysis, no two fingerprints have ever been found to be identical, even in identical twins. Each of us is born with a unique set of fingerprints, although experts still don’t know with what exactly what we use them for. In information technology terms, biometrics is associated with technologies and techniques designed to secure and confirm identity based on individual, measurable biological characteristics of the person. Fingerprints can be used in systems and schemes designed to gain access to a computer, a room and, why not, a bank account. A verification system authenticates the person’s claimed identity by comparing the fingerprints provided by the person at a given point in time with the measures of these features previously stored in the system and associated with the person’s claimed identity. This paper presents a quantum matching algorithm for biometric fingerprints. For this, classical fingerprinting was encoded into quantum states using an adapted Novel Enhanced Quantum model and the quantum circuits, for storage and for matching, were implemented and tested on the IBM Quantum Experience platform and on a local virtual quantum simulator.
Biometrics are intended to add an extra layer of security to various applications by authenticating a user based on a biometric sample taken from them. At the same time advantage, from the users' perspective, is that they are no longer required to use biometric memorizing credentials. Fingerprinting has been in use since the 19thcentury in determining identity. Because users' biometric templates are stored within any system, their security becomes extremely sensitive, as theft or simple copying of the biometric can compromise the identity of all users enrolled in the system. This paper presents a quantum-based biometric fingerprint encryption method. The method uses an adapted Novel Enhanced Quantum (NEQR) model to store biometric fingerprint in quantum systems and proposes quantum techniques of Confusion and Feistel algorithm to encryption it. The quantum encryption circuit was implemented and tested both in the IBM Quantum cloud and locally on the QASM quantum simulator.