A Lattice-Based Approach to Privacy-Preserving Biometric Authentication Without Relying on Trusted Third Parties
From MaRDI portal
A Lattice-Based Approach to Privacy-Preserving Biometric Authentication Without Relying on Trusted Third Parties
Recommendations
- Lattice-Based Secure Biometric Authentication for Hamming Distance
- An Authentication Protocol with Encrypted Biometric Data
- An efficient entity authentication protocol with enhanced security and privacy properties
- Packed homomorphic encryption based on ideal lattices and its application to biometrics
- On privacy-preserving biometric authentication
Cites work
- scientific article; zbMATH DE number 176565 (Why is no real title available?)
- scientific article; zbMATH DE number 708820 (Why is no real title available?)
- A new identification scheme based on syndrome decoding
- Advances in Cryptology - CRYPTO 2003
- An Application of the Goldwasser-Micali Cryptosystem to Biometric Authentication
- Cancellable biometrics and annotations on biohash
- Concurrently Secure Identification Schemes Based on the Worst-Case Hardness of Lattice Problems
- Cryptographically-secure and efficient remote cancelable biometrics based on public-key homomorphic encryption
- Efficient Binary Conversion for Paillier Encrypted Values
- Efficient public key encryption based on ideal lattices (extended abstract)
- Evaluating Branching Programs on Encrypted Data
- Faster fully homomorphic encryption
- Fully homomorphic SIMD operations
- Fully homomorphic encryption from ring-LWE and security for key dependent messages
- Fully homomorphic encryption over the integers
- Fully homomorphic encryption using ideal lattices
- GGHLite: more efficient multilinear maps from ideal lattices
- Homomorphic encryption and secure comparison
- Homomorphic encryption from learning with errors: conceptually-simpler, asymptotically-faster, attribute-based
- Improved security proofs in lattice-based cryptography: using the Rényi divergence rather than the statistical distance
- Improved zero-knowledge proofs of knowledge for the ISIS problem, and applications
- Lattice-Based Identification Schemes Secure Under Active Attacks
- Maliciously circuit-private FHE
- On ideal lattices and learning with errors over rings
- On lattices, learning with errors, random linear codes, and cryptography
- Practical packing method in somewhat homomorphic encryption
- Privacy-preserving fingerprint authentication resistant to hill-climbing attacks
- Private fingerprint matching
- Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
- The Knowledge Complexity of Interactive Proof Systems
- Zero-knowledge proofs of identity
- \(i\)-hop homomorphic encryption and rerandomizable Yao circuits
Cited in
(11)- Privacy-Preserving Similarity Evaluation and Application to Remote Biometrics Authentication
- An Application of the Goldwasser-Micali Cryptosystem to Biometric Authentication
- scientific article; zbMATH DE number 2089662 (Why is no real title available?)
- An Authentication Protocol with Encrypted Biometric Data
- On privacy-preserving biometric authentication
- Lattice-Based Secure Biometric Authentication for Hamming Distance
- A framework for UC secure privacy preserving biometric authentication using efficient functional encryption
- Secure Biometric Authentication with Improved Accuracy
- An efficient entity authentication protocol with enhanced security and privacy properties
- BETA: biometric-enabled threshold authentication
- Packed homomorphic encryption based on ideal lattices and its application to biometrics
This page was built for publication: A Lattice-Based Approach to Privacy-Preserving Biometric Authentication Without Relying on Trusted Third Parties
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5056025)
