Security and Communication Networks · 2010 · 40 citations · 31 references
ComputingComputer ScienceCybersecurityAuthenticationComputer SecurityCryptographyBiometric AuthenticationCryptographic HashingData ProtectionHash FunctionsBiometric RecognitionBiometrics PrivacyBloom FiltersEncrypted StorageHamming DistanceHashingLocality-sensitive HashingPrivacy
Abstract Biometrics make human identification possible with a sample of a biometric trait and an associated database. Classical identification techniques lead to privacy concerns. This paper introduces a new method to identify someone using his biometrics in an encrypted way. Our construction combines Bloom Filters with Storage and Locality‐Sensitive Hashing. We apply this error‐tolerant scheme, in a Hamming space, to achieve biometric identification in an efficient way. This is the first non‐trivial identification scheme dealing with fuzziness and encrypted data. Copyright © 2010 John Wiley & Sons, Ltd.
31
Adi Shamir · Communications of the ACM · 1979 · 13.5K citations · Full text
Space/time trade-offs in hash coding with allowable errors
Burton H. Bloom · Communications of the ACM · 1970 · 7.5K citations · Full text
Piotr Indyk, Rajeev Motwani · 1998 · 4.2K citations · Full text