Fundamental Limits of Biometric Identification Systems with Strong Secrecy

02/12/2020
by   Vamoua Yachongka, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/05/2019

Identification, Secrecy, Template, and Privacy-Leakage of Biometric Identification System under Noisy Enrollment

In this study, we investigate fundamental trade-off among identification...
research
09/07/2020

Multiple Private Key Generation for Continuous Memoryless Sources with A Helper

We propose a method to study the secrecy constraints in key generation p...
research
05/08/2019

Fundamental Limits of Identification System With Secret Binding Under Noisy Enrollment

We investigate fundamental limits among identification, secrecy, templat...
research
10/21/2020

Biometric Identification Systems With Noisy Enrollment for Gaussian Source

In the present paper, we investigate the fundamental trade-off of identi...
research
05/27/2022

Can Foundation Models Help Us Achieve Perfect Secrecy?

A key promise of machine learning is the ability to assist users with pe...
research
01/25/2017

Wiretap channel capacity: Secrecy criteria, strong converse, and phase change

This paper employs equal-image-size source partitioning techniques to de...
research
07/10/2019

Adding Common Randomness Can Remove the Secrecy Constraints in Communication Networks

In communication networks secrecy constraints usually incur an extra lim...

Please sign up or login with your details

Forgot password? Click here to reset