Papers
Topics
Authors
Recent
2000 character limit reached

Fundamental Limits of Biometric Identification Systems with Strong Secrecy

Published 12 Feb 2020 in cs.IT and math.IT | (2002.05100v2)

Abstract: The fundamental limits of biometric identification systems under a strong secrecy criterion are investigated. In the previous studies of this scenario, the fundamental trade-off among secrecy, template, privacy- and secrecy-leakages has been revealed in the case where there is only one user, while the case of multiple users has not been discussed yet. In this study, we consider the system with exponentially many users, and we characterize the capacity region of the rate tuples including the user (identification) rate under the strong secrecy criterion. In the achievability proof, we derive a new method to incorporate multiple users by extending the random binning for one user's case. The obtained result shows that the characterization of the capacity region does not vary regardless of the weak or strong secrecy criterion in terms of secrecy-leakage.

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.