A Lattice-Based Approach to Privacy-Preserving Biometric Authentication Without Relying on Trusted Third Parties

DOI10.1007/978-3-319-72359-4_17zbMath1506.94085OpenAlexW2775777051MaRDI QIDQ5056025

Nandita Bhattacharjee, Trung Dinh, Ron Steinfeld

Publication date: 9 December 2022

Published in: Information Security Practice and Experience (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-72359-4_17

zbMATH Keywords

Hamming-distancebiometric authentication schemetwo-factor authentication protocol

Mathematics Subject Classification ID

Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Related Items (1)

BETA: biometric-enabled threshold authentication

Uses Software

• SCiFI

Cites Work

• Unnamed Item
• Unnamed Item
• Zero-knowledge proofs of identity
• Homomorphic encryption and secure comparison
• Fully homomorphic SIMD operations
• Cancellable biometrics and annotations on biohash
• Privacy-Preserving Fingerprint Authentication Resistant to Hill-Climbing Attacks
• Improved Security Proofs in Lattice-Based Cryptography: Using the Rényi Divergence Rather Than the Statistical Distance
• Homomorphic Encryption from Learning with Errors: Conceptually-Simpler, Asymptotically-Faster, Attribute-Based
• Maliciously Circuit-Private FHE
• Private Fingerprint Matching
• Practical Packing Method in Somewhat Homomorphic Encryption
• Faster Fully Homomorphic Encryption
• Cryptographically-Secure and Efficient Remote Cancelable Biometrics Based on Public-Key Homomorphic Encryption
• On Ideal Lattices and Learning with Errors over Rings
• Fully Homomorphic Encryption over the Integers
• i-Hop Homomorphic Encryption and Rerandomizable Yao Circuits
• Efficient Binary Conversion for Paillier Encrypted Values
• Evaluating Branching Programs on Encrypted Data
• Concurrently Secure Identification Schemes Based on the Worst-Case Hardness of Lattice Problems
• An Application of the Goldwasser-Micali Cryptosystem to Biometric Authentication
• Efficient Public Key Encryption Based on Ideal Lattices
• The Knowledge Complexity of Interactive Proof Systems
• Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
• A new identification scheme based on syndrome decoding
• Improved Zero-Knowledge Proofs of Knowledge for the ISIS Problem, and Applications
• Fully homomorphic encryption using ideal lattices
• Fully Homomorphic Encryption from Ring-LWE and Security for Key Dependent Messages
• GGHLite: More Efficient Multilinear Maps from Ideal Lattices
• Advances in Cryptology - CRYPTO 2003
• Lattice-Based Identification Schemes Secure Under Active Attacks
• On lattices, learning with errors, random linear codes, and cryptography

This page was built for publication: A Lattice-Based Approach to Privacy-Preserving Biometric Authentication Without Relying on Trusted Third Parties