Search icon CANCEL
Arrow left icon
Explore Products
Best Sellers
New Releases
Books
Videos
Audiobooks
Learning Hub
Conferences
Free Learning
Arrow right icon
Arrow up icon
GO TO TOP
Identity Management with Biometrics

You're reading from   Identity Management with Biometrics Explore the latest innovative solutions to provide secure identification and authentication

Arrow left icon
Product type Paperback
Published in Oct 2020
Publisher Packt
ISBN-13 9781838988388
Length 368 pages
Edition 1st Edition
Arrow right icon
Author (1):
Arrow left icon
Lisa Bock Lisa Bock
Author Profile Icon Lisa Bock
Lisa Bock
Arrow right icon
View More author details
Toc

Table of Contents (20) Chapters Close

Preface 1. Section 1 –Understanding Biometric Authentication
2. Chapter 1: Exploring Biometric Technology FREE CHAPTER 3. Chapter 2: Biometrics and Mobile Devices 4. Chapter 3: Recognizing Biometric Characteristics 5. Chapter 4: Comparing Advantages and Modalities 6. Section 2 – Applying Biometric Technologies
7. Chapter 5: Implementing Fingerprint Technology 8. Chapter 6: Using Facial Recognition 9. Chapter 7: Learning Iris Recognition 10. Chapter 8: Using Voice Recognition 11. Chapter 9: Considering Alternate Biometrics 12. Section 3 – Deploying a Large-Scale Biometric System
13. Chapter 10: Selecting the Right Biometric 14. Chapter 11: Integrating the Biometric System 15. Chapter 12: Testing and System Deployment 16. Chapter 13: Discovering Practical Biometric Applications 17. Chapter 14: Addressing Privacy Concerns 18. Assessments 19. Other Books You May Enjoy

Matching templates and preventing spoofing

Once the encoded template is created, the system will either identify or authenticate, according to the design.

The template is compared against a record in search of a match. As with any biometric, the match will never be 100%. Matching occurs as a result of whether or not the threshold is acceptable.

One way to evaluate whether a sample matches a template is by calculating the Hamming distance. The Hamming distance is the result of comparing two binary values, as we’ll see next.

Calculating the Hamming distance

The Hamming distance is a comparison of two binary values. To calculate the Hamming distance, we use an exclusive OR (XOR) operation on both values. When complete, count the number of bits that are equal to 1, and that will be the Hamming distance.

Important note

An XOR operation is a logical operation that compares two values. In an XOR operation, if A =1 and B =1 but not both, the output is 1.

For example...

lock icon The rest of the chapter is locked
Register for a free Packt account to unlock a world of extra content!
A free Packt account unlocks extra newsletters, articles, discounted offers, and much more. Start advancing your knowledge today.
Unlock this book and the full library FREE for 7 days
Get unlimited access to 7000+ expert-authored eBooks and videos courses covering every tech area you can think of
Renews at AU $24.99/month. Cancel anytime