CCS '99 Proceedings of the 6th ACM conference on Computer and communications security
Proofs of Partial Knowledge and Simplified Design of Witness Hiding Protocols
CRYPTO '94 Proceedings of the 14th Annual International Cryptology Conference on Advances in Cryptology
Statistical Zero Knowledge Protocols to Prove Modular Polynomial Relations
CRYPTO '97 Proceedings of the 17th Annual International Cryptology Conference on Advances in Cryptology
Handbook of Fingerprint Recognition
Handbook of Fingerprint Recognition
Secure smartcardbased fingerprint authentication
WBMA '03 Proceedings of the 2003 ACM SIGMM workshop on Biometrics methods and applications
Enhancing security and privacy in biometrics-based authentication systems
IBM Systems Journal - End-to-end security
Efficient proofs that a committed number lies in an interval
EUROCRYPT'00 Proceedings of the 19th international conference on Theory and application of cryptographic techniques
Hi-index | 0.02 |
In this paper, a new method for secure remote biometric authentication preventing the vulnerability of compromised biometrics is presented. The idea is based on a public-key cryptographical protocol, referred as Zero-knowledge Proof, which allows a user to prove that she has surely a valid biometric data without revealing the data. Hence, the scheme is free from the risk of disclosure of biometric data. Even if a malicious administrator has a privilege access to the private database, it is infeasible for him to learn the private template. This paper studies two well-known definitions, the cosine correlationand the Euclidean distanceas similarities of given two feature vectors. Both similarities are defined with some multiplications and additions, which can be performed in privacy-preserving way because of the useful property of public-key commitment scheme, additive homomorphism. The estimation based on the experimental implementation shows that the private Euclidean distance scheme archives better accuracy in terms of false acceptance and rejection than the private cosine coloration scheme, but it requires about 5/2 n茂戮驴 overhead to evaluate n-dimension feature vectors consisting of 茂戮驴-bit integers.