Đang chuẩn bị nút TẢI XUỐNG, xin hãy chờ
Tải xuống
Tuyển tập báo cáo các nghiên cứu khoa học quốc tế ngành hóa học dành cho các bạn yêu hóa học tham khảo đề tài: IResearch Article A Simple Scheme for Constructing Fault-Tolerant Passwords from Biometric Data | Hindawi Publishing Corporation EURASIP Journal on Information Security Volume 2010 Article ID 819376 11 pages doi 10.1155 2010 819376 Research Article A Simple Scheme for Constructing Fault-Tolerant Passwords from Biometric Data Vladimir B. Balakirsky and A. J. Han Vinck Institute for Experimental Mathematics University of Duisburg-Essen 45326 Essen Germany Correspondence should be addressed to A. J. Han Vinck vinck@iem.unLdue.de Received 6 April 2010 Revised 19 July 2010 Accepted 18 October 2010 Academic Editor Bulent Sankur Copyright 2010 V. B. Balakirsky and A. J. H. Vinck. This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use distribution and reproduction in any medium provided the original work is properly cited. We present a simple combinatorial construction for the mapping of the biometric vectors to short strings called the passwords. A verifier has to decide whether a given vector can be considered as a corrupted version of the original biometric vector whose password is known or not. The evaluations of the compression factor the false rejection acceptance rates are derived and an illustration of a possible implementation of the verification algorithm for the DNA data is presented. 1. Introduction Let us consider the data transmission scheme in Figure 1. The source generates a vector b e 0 1 N containing the outcomes of the measurements of some biometric parameters of a user. This vector is encoded as the vector pw b e 0 1 K called the password of the user which is stored in the database under the user s name. The password is read from the database upon request and given to the verifier together with the vector b e 0 1 N generated by some source. The verifier has to check whether the vector b can be considered as a corrupted version of the vector b accept or not reject . The decision can be expressed as the value of a Boolean function p pw b b e Acc Rej and the formal specification of the .
