Papers
Topics
Authors
Recent
Search
2000 character limit reached

Fundamental Limits of Identification System With Secret Binding Under Noisy Enrollment

Published 8 May 2019 in cs.IT and math.IT | (1905.03598v2)

Abstract: We study the fundamental limits of biometric identification systems with chosen secret from an information theoretic perspective. Ignatenko and Willems (2015) characterized the capacity region of identification, secrecy, and privacy-leakage rates of the system provided that the enrollment channel is noiseless. In the enrollment process, however, it is highly considered that noise occurs when bio-data is scanned. Recently, Yachongka and Yagi (2019) characterized the capacity region of the system with generated secret considering noisy enrollment and template constraint. In this paper, we are interested in characterizing the capacity region of identification, secrecy, template, and privacy-leakage rates of the system with chosen secret under the same settings as Yachongka and Yagi (2019). As special cases, the obtained result shows that the characterization reduces to the one given by Ignatenko and Willems (2015) where the enrollment channel is noiseless and there is no constraint on the template rate, and it also coincides with the result derived by G\"unl\"u and Kramer (2018) where there is only one individual.

Citations (3)

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (2)

Collections

Sign up for free to add this paper to one or more collections.